V Lifschitz, `Circumscription', in Handbook of Logic in Artificial Intelligence and Logic Programming, volume 4, 297--352, Oxford Publ., (1994). Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Abducing Qualitative Spatio-Temporal Histories from Partial.. - Hazarika, Cohn (Correct)
....our framework. e.g. we can have z but no episode boundaries need occur during z unless some RCC sp relationship involving b and another object changes. The Circumscriptive Theory CT Circumscription is a form of nonmonotonic reasoning initially introduced by McCarthy [24] and further developed [21] for reasoning under incomplete information. The basic idea of circumscription is to limit the set of objects of which a predicate is true, a process which is known as minimising the predicate. Let # 1 and # 2 be predicates with arity n. Let x be a tuple of n distinct variables. We have the ....
V Lifschitz, `Circumscription', in Handbook of Logic in Artificial Intelligence and Logic Programming, volume 4, 297--352, Oxford Publ., (1994).
Progress in Logic-Based AI - Hubert Dreyfus Claims (Correct)
....logic level. 1 tonic reasoning, because it illustrates intermittent but definite progress. It was first proposed in [McCarthy, 1977] gained momentum with the 1980 special issue of Artificial Intelligence, and summarized in the collection [Ginsberg, 1987] It has continued to develop, see e.g. [Lifschitz, 1993]. Minsky [Minsky, 1975] mentioned the need for something like nonmonotonic reasoning, but used this fact as evidence for the inadequacy of logic based approaches to AI and the need for approaches not based on logic. This isn t how things have gone. Nonmonotonic reasoning has developed as a branch ....
Lifschitz, Vladimir "Circumscription", in Handbook of Logic for Artificial Intelligence and Logic Programming, Vol. 3, Oxford University Press, 1993.
On the Concept of Generic Object: A Nonmonotonic Reasoning.. - Bertossi, Reiter (Correct)
....predicate S Scope in the theory obtained from Sigma [ fC( a) Scope( a)g plus the definition of predicate S . 4. Since the base theory is infinite, our circumscription is not given in terms of a finitary first order formula 5 . Nevertheless, there is no problem in defining such 5 See [15] for some remarks on circumscription for infinitary theories. But, if we are willing to give up a first order base theory, we may obtain a syntactical version for the circumscription by starting from a finite theory Sigma 0 corresponding to a categorical second order axiomatization of the ....
....generic valuation has the distinguished properties of the class to which it belongs, then all valuations in the class have those properties. We can also easily show from results in [20] that the generic model of a set of formulas can be obtained as the parallel propositional circumscription (see [15]) of all the propositional variables in the formula. As Makowsky points out, generic models give a semantics to Reiter s Closed World Assumption [23] applied to propositional knowledge bases (see also [13] The relationship between CWA and circumscription has been explored in [16] 6.4 Data Types ....
Lifschitz, V. "Circumscription". In `Handbook of Logic in Artificial Intelligence and Logic Programming', Oxford University Press. To appear.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC