Reasoning under minimal upper bounds in propositional logic

DOI10.1016/j.tcs.2006.07.054zbMath1142.68532OpenAlexW2108315311WikidataQ59259664 ScholiaQ59259664MaRDI QIDQ861253

Thomas Eiter, Georg Gottlob

Publication date: 9 January 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.07.054

zbMATH Keywords

computational complexityartificial intelligencepropositional logicknowledge representationminimal modelsnon-monotonic reasoningcircumscriptioncurbing

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Logic in artificial intelligence (68T27) Knowledge representation (68T30) Classical propositional logic (03B05)

Uses Software

• SATCHMO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inferring negative information from disjunctive databases
• A circumscriptive theorem prover
• Reasoning with minimal models: efficient algorithms and applications
• Circumscription - a form of non-monotonic reasoning
• The complexity of model checking for circumscriptive formulae
• The complexity of propositional closed world reasoning and circumscription
• Computing circumscriptive databases
• Computing circumscription revisited: A reduction algorithm
• The complexity of belief update
• Nested abnormality theories
• How many minimal upper bounds of minimal upper bounds
• On the computational cost of disjunctive logic programming: Propositional case
• Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
• An incremental algorithm for generating all minimal models
• The well-founded semantics for general logic programs
• Minimal model generation with positive unit hyper-resolution tableaux
• A tableau calculus for minimal model reasoning
• Embedding circumscriptive theories in general disjunctive programs
• Complexity of propositional nested circumscription and nested abnormality theories
• Logic Programming
• Logics in Artificial Intelligence
• Theory and Applications of Satisfiability Testing

This page was built for publication: Reasoning under minimal upper bounds in propositional logic