Decidability and definability with circumscription

DOI10.1016/0168-0072(87)90062-5MaRDI QIDQ579240zbMATH OpenOpenAlexFDO

Authors John S. Schlipf

Publication date 1987

Published in Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0168-0072(87)90062-5

zbMATH Keywords

dynamic logiccircumscriptionexpressive powerminimal modelcountable modelseveryday reasoninginfinite model

Mathematics Subject Classification ID

Artificial intelligence (68T99) Decidability of theories and sets of sentences (03B25) Second- and higher-order model theory (03C85)

Recommendations

• Decidability of definability
• Circumscription and implicit definability
• scientific article; zbMATH DE number 67498
• scientific article; zbMATH DE number 50606
• Decidability of circumscribed description logics revisited
• Decidability in analysis
• Decidable and enumerable predicate logics of provability
• On the computability of circumscription
• scientific article; zbMATH DE number 7644092

Cites work

• scientific article; zbMATH DE number 3494394 (Why is no real title available?)
• scientific article; zbMATH DE number 3577197 (Why is no real title available?)
• Circumscription - a form of non-monotonic reasoning
• Completeness results for circumscription
• Definability in dynamic logic
• Descriptive set theory
• Elementary induction on abstract structures
• On the satisfiability of circumscription
• The mathematics of non-monotonic reasoning

Cited in

(23)

• From decidability to undecidability by considering regular sets of instances
• Generalized closed world assumption is \(\Pi ^ 0_ 2\)-complete
• Sequent calculi for skeptical reasoning in predicate default logic and other nonmonotonic logics
• Autocircumscription
• scientific article; zbMATH DE number 1696843 (Why is no real title available?)
• Decidable structures between Church-style and Curry-style
• scientific article; zbMATH DE number 4156408 (Why is no real title available?)
• Is intractability of nonmonotonic reasoning a real drawback?
• An efficient method for eliminating varying predicates from a circumscription
• scientific article; zbMATH DE number 67498 (Why is no real title available?)
• Decidability of circumscribed description logics revisited
• Circumscription: Completeness reviewed
• On the satisfiability of circumscription
• Circumscribing DATALOG: expressive power and complexity
• Reasoning under minimal upper bounds in propositional logic
• Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
• On the computability of circumscription
• The complexity of predicate default logic over a countable domain
• Circumscription within monotonic inferences
• Complexity and undecidability results for logic programming
• COMPLEXITY OF UNIVERSAL CIRCUMSCRIPTION
• A remark concerning decidability of complete theories
• scientific article; zbMATH DE number 67825 (Why is no real title available?)

This page was built for publication: Decidability and definability with circumscription

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q579240)