Decidability and definability with circumscription
DOI10.1016/0168-0072(87)90062-5zbMATH Open0625.03017OpenAlexW2055029276MaRDI QIDQ579240FDOQ579240
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
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
dynamic logiccircumscriptionexpressive powerminimal modelcountable modelseveryday reasoninginfinite model
Artificial intelligence (68T99) Decidability of theories and sets of sentences (03B25) Second- and higher-order model theory (03C85)
Cites Work
- Elementary induction on abstract structures
- Descriptive set theory
- Title not available (Why is that?)
- Circumscription - a form of non-monotonic reasoning
- Title not available (Why is that?)
- The mathematics of non-monotonic reasoning
- On the satisfiability of circumscription
- Completeness results for circumscription
- Definability in dynamic logic
Cited In (23)
- Generalized closed world assumption is \(\Pi ^ 0_ 2\)-complete
- Circumscription: Completeness reviewed
- Is intractability of nonmonotonic reasoning a real drawback?
- A remark concerning decidability of complete theories
- Title not available (Why is that?)
- Autocircumscription
- Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
- Reasoning under minimal upper bounds in propositional logic
- Circumscribing DATALOG: expressive power and complexity
- On the satisfiability of circumscription
- On the computability of circumscription
- Complexity and undecidability results for logic programming
- Sequent calculi for skeptical reasoning in predicate default logic and other nonmonotonic logics
- The complexity of predicate default logic over a countable domain
- Circumscription within monotonic inferences
- Decidability of circumscribed description logics revisited
- Decidable structures between Church-style and Curry-style
- From decidability to undecidability by considering regular sets of instances
- Title not available (Why is that?)
- An efficient method for eliminating varying predicates from a circumscription
- Title not available (Why is that?)
- Title not available (Why is that?)
- COMPLEXITY OF UNIVERSAL CIRCUMSCRIPTION
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)
