نتایج جستجو برای: 2there is

تعداد نتایج: 7237481  

2012
R. Zuber

Some constraints on functions from sets and relations to sets are studied. Such constraints are satisfied by anaphoric functions, that is functions denoted by anaphoric determiners. These constraints are generalisations of anaphor conditions known from the study of simpler cases of nominal anaphors. In addition a generalisation of the notion of conservativity as applied to anaphoric functions i...

Journal: :TACL 2014
Peter Young Alice Lai Micah Hodosh Julia Hockenmaier

We propose to use the visual denotations of linguistic expressions (i.e. the set of images they describe) to define novel denotational similarity metrics, which we show to be at least as beneficial as distributional similarities for two tasks that require semantic inference. To compute these denotational similarities, we construct a denotation graph, i.e. a subsumption hierarchy over constituen...

2008
J. V. CUNHA R. C. SANTOS

Recent measurements are suggesting that we live in a flat Universe and that its present accelerating stage is driven by a dark energy component whose equation of state may evolve in time. Assuming two different parameterizations for the function ω(z), we constrain their free parameters from a joint analysis involving measurements from X-Ray luminosity of galaxy clusters and SNe type Ia data.

2006
Vladimir Aleksić Anatoli Degtyarev

We prove the completeness of the regular strategy of derivations for superposition-based calculi. The regular strategy was pioneered by Kanger in (Kan63), who proposed that all equality inferences take place before all other steps in the proof. We show that the strategy is complete with the redundancy notions of tautology elimination and subsumption. The implication of our result is the complet...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه پیام نور - دانشگاه پیام نور استان تهران - دانشکده ادبیات و زبانهای خارجی 1390

bserved by many teachers that most of the time, mumbling and searching for their intended words, students complain why they have forgotten the words they have learned in the previous semesters. they ask for some new ways that may help them to recall and apply the learned words more efficiently, since as they declare one of the most important skills in foreign language learning is having a g...

1984
Yoav Shoham Drew McDermott

We define the direction of knowledge, and what it means to extend that direction. A special case is function inversion, and we give three algorithms for function inversion. Their performance on non-trivial problems and their shortcomings are demonstrated. All algorithms are implemented in Prolog

2015
Weronika Juroszek

The role of parents-in-law according to Erik Erikson’s theory, has been analyzed in this paper. Erikson claims that a man develops throughout his whole life, solving subsequently appearing crises. The proper solution of these crises enables the achievement of integration. The results of research, carried out by Menelaos Apostolou, regarding the influence of parents on the choice of a son or dau...

Journal: :Theor. Comput. Sci. 2006
David W. Binkley Sebastian Danicic Tibor Gyimóthy Mark Harman Ákos Kiss Bogdan Korel

This paper presents a theory of dynamic slicing, which reveals that the relationship between static and dynamic slicing is more subtle than previously thought. The definitions of dynamic slicing are formulated in terms of the projection theory of slicing. This shows that existing forms of dynamic slicing contain three orthogonal dimensions in their slicing criteria and allows for a lattice-theo...

1997
Steffen Staab Udo Hahn

We outline a model of dimensional reasoning on time and space scales which integrates quantitative and qualitative knowledge about distances. At the core of this model lie constraints on interval boundaries, partial ordering and subsumption relations on interval relations and interval boundary constraints, as well as the transformation of interval relations to interval boundary constraints and ...

2013
Yazmin Angélica Ibáñez-García Carsten Lutz Thomas Schneider

Finite model reasoning in expressive DLs such as ALCQI and SHIQ requires non-trivial algorithmic approaches that are substantially differerent from algorithms used for reasoning about unrestricted models. In contrast, finite model reasoning in the inexpressive fragment DL-LiteF of ALCQI and SHIQ is algorithmically rather simple: using a TBox completion procedure that reverses certain terminolog...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید