Incompleteness: The Proof and Paradox of Kurt Godel (Great Discoveries) WORD POWER MADE EASY Nonzero : The Logic of Human Destiny (Vintage) Middlemarch (Penguin Classics) Kaplan GRE Exam Verbal Workbook : Third Edition (Kaplan Gre Verbal Workbook) Unattended Sorrow : Recovering from Loss and Reviving the Heart Imperial Reckoning: The Untold Story of Britain's Gulag in Kenya Franklin and Winston : An Intimate Portrait of an Epic Friendship Precarious Life: The Power of Mourning and Violence

• 367-376 An Algebraic Approach to the Complexity of Propositional Circumscription .
• Circumscription is one of the most important and well studied formalisms in the realm of nonmonotonic reasoning. The model checking and inference problem for propositional circumscription has been extensively studied from the viewpoint of computational complexity. We use a new approach based on algebraic techniques to study the complexity of the model checking and inference problems for propositional variable circumscription in a unified way. We prove that there exists a dichotomy theorem for the complexity of the inference problem in propositional variable circumscription. We also study the model checking and inference problem for propositional variable circumscription in many-valued logics using the same algebraic techniques. In particular we prove dichotomy theorems for the complexity of model checking and inference for propositional variable circumscription in the case of 3-valued logic. ...

• Cogprints - Applications of Circumscription to Formalizing Common Sense Knowledge .
• Applications of Circumscription to Formalizing Common Sense Knowledge.
• McCarthy, John (1986) Applications of Circumscription to Formalizing Common Sense Knowledge. ...
• We present a new and more symmetric version of the circumscription method of nonmonotonic reasoning first described in (McCarthy 1980) and some applications to formalizing common sense knowledge. ... The new circumscription may be called formula circumscription to distinguish it from the previously defined domain circumscription and predicate circumscription. A still more general formalism called prioritized circumscription is briefly explored.

• Reducing Belief Revision to Circumscription (and viceversa).
• Previous work by Winslett has shown some correlations between a specific operator and circumscription. In this paper we greatly extend Winslett's work by establishing new relations between circumscription and a large number of belief revision operators. ...
• @article{libe-scha-97-b, title = {Reducing Belief Revision to Circumscription (and viceversa)}, year = {1997}, author = {Liberatore, Paolo and Schaerf, Marco}, journal = {Artificial Intelligence}, pages = {261-296}, number = {1-2}, volume = {93}, } .

• Next: THE MODEL THEORY OF Up: CIRCUMSCRIPTION-A FORM OF NONMONOTONIC Previous: THE FORMALISM OF CIRCUMSCRIPTION .
• DOMAIN CIRCUMSCRIPTION.
• The form of circumscription described in this paper generalizes an earlier version called minimal inference. ... We shall call the earlier form domain circumscription to contrast it with the predicate circumscription discussed in this paper. ...
• The domain circumscription of the sentence A is the sentence .
• Domain circumscription can be reduced to predicate circumscription by relativizing A with respect to a new one place predicate called (say) all, then circumscribing all in , thus getting .
• In the case of the natural numbers, the domain circumscription of true, the identically true sentence, again leads to the axiom schema of induction. ...

• home > library > dictionary > circumscription.
• Circumscription .
• One of the core constructs of Gottfredson's (1996) theory of circumscription and compromise, circumscription is the process though which an individual progressively eliminates images of occupations from his or her social space. Gottfredson proposed that stages of circumscription include orientation to size and power (ages 3-5), sex roles (ages 6-8), social valuation (ages 9-13), and the internal, unique self (ages 14 and up). ...

• Circumscription Form.
• This form is the remote program execution form for computing first-order circumscription. You can specify a circumscription problem, send it to a server at the Max-Planck Institute, which invokes the SCAN algorithm, computes the answer and sends the result back to you immediately. ...
• Forms: Basic Form | Correspondences Form | Circumscription Form | Help .
• Documentation: Theory | Computing Correspondences | Computing Circumscription | The System | Conventions | Syntax | Literature Maintained by R. ...

• The Digital Librarian's Digital Library searchDOCIS Documents in Computing and Information Science Home >> Journals and Conference Proceedings >> Artificial Intelligence  Reducing Belief Revision to Circumscription (and Vice Versa) Paolo Liberatore, Marco Schaerf  Journal Title: Artificial Intelligence Date: 1997 Volume: 93 p. ...

• Circumscription.
• Circumscription - A Form of Nonmonotonic Reasoning was published in Artificial Intelligence in 1980. ...
• The formalism of this paper is substantially superseded by that of Applications of circumscription to formalizing common sense published in 1986. ...
• title = "Circumscription---A Form of Non-Monotonic Reasoning",.

• Computing Protected Circumscription.
• This paper deals with computing circumscription in the case of Horn data with additional protection (indefinite data), an intermediate investigation between Reiter's result on predicate completion and Lifschitz's efforts to make general (formula) circumscription more efficient as a computational tool. Reiter has shown a close tie between McCarthy's circumscription and Clark's predicate completion. Here we investigate a similar tie between an extended version of circumscription involving protected data, and an extended version of predicate completion. ...
• 1984 On the adequacy of predicate circumscription for closed-world reasoning. ...
• 1984 Some results on circumscription. ...
• 1980 Circumscription--a form of nonmonotonic reasoning. ...
• 1984 Applications of circumscription to formalizing common sense knowledge. ...
• 1984a Applications of protected circumscription. ...
• 1984b Protected circumscription. ...
• 1985 Completeness results for circumscription. ...
• 1982 Circumscription implies predicate completion (sometimes). ...

• Circumscription.
• Circumscription is a rule of conjecture that allows you to jump to the conclusion that the objects you can show that posses a certain property, p, are in fact all the objects that posses that property. ...
• Circumscription can also cope with default reasoning. ...
• In circumscription this phrase would be stated as: .
• This is where we apply circumscription and, in this case, .
• Note the distinction between Default logic and circumscription: .

• A Connotative Treatment of Circumscription¡¡PRELIMINARY REPORT.
• Circumscription proposed by McCarthy is one of the most hopeful formalizations of nonmonotonic aspects of commonsense reasoning. It has several versions, however, they are all proposed for denotative minimization of predicates, that is, circumscription minimizes the extension of predicates. ... This paper proposes a solution for them by presenting a connotative treatment of circumscription. ...

• V Lifschitz, `Circumscription', in Handbook of Logic in Artificial Intelligence and Logic Programming, volume 4, 297--352, Oxford Publ. ...
• 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. ...
• V Lifschitz, `Circumscription', in Handbook of Logic in Artificial Intelligence and Logic Programming, volume 4, 297--352, Oxford Publ. ...
• Lifschitz, Vladimir "Circumscription", in Handbook of Logic for Artificial Intelligence and Logic Programming, Vol. ...
• 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. ...
• 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. ...
• "Circumscription". ...

Do you have a great site about Circumscription? Is your Circumscription site listed here? Would you like a prefered placement of your site in this directory?

It's easy! First place, the HTML from the box below on your page that you would like listed in this directory.

Then use our link submission request with your name, your contact information, and the URL of your site that has a link to this directory. After we verify your link to us, we'll make sure your site stays in our directory, and we'll give it prefered placement here also.

Here is how to make a simple text link to us. Just copy the code in this box to your website:

We can also develop a custom Guide To The Internet for your site. Please request your own custom Guide To The Internet.