Reasoning under minimal upper bounds in propositional logic

DOI10.1016/J.TCS.2006.07.054MaRDI QIDQ861253zbMATH OpenOpenAlexWikidataFDO

Authors 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 intelligenceknowledge representationpropositional logiccircumscriptionnon-monotonic reasoningminimal modelscurbing

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1696754
• scientific article; zbMATH DE number 640290
• On compact representations of propositional circumscription
• Decidability and definability with circumscription
• Computing minimal models by partial instantiation

Cites work

• scientific article; zbMATH DE number 1696754 (Why is no real title available?)
• scientific article; zbMATH DE number 3888913 (Why is no real title available?)
• scientific article; zbMATH DE number 4094866 (Why is no real title available?)
• scientific article; zbMATH DE number 1241670 (Why is no real title available?)
• scientific article; zbMATH DE number 592370 (Why is no real title available?)
• scientific article; zbMATH DE number 1142320 (Why is no real title available?)
• scientific article; zbMATH DE number 1158758 (Why is no real title available?)
• scientific article; zbMATH DE number 1946853 (Why is no real title available?)
• scientific article; zbMATH DE number 1509480 (Why is no real title available?)
• scientific article; zbMATH DE number 194618 (Why is no real title available?)
• scientific article; zbMATH DE number 1926616 (Why is no real title available?)
• scientific article; zbMATH DE number 1884398 (Why is no real title available?)
• A circumscriptive theorem prover
• A tableau calculus for minimal model reasoning
• An incremental algorithm for generating all minimal models
• Circumscription - a form of non-monotonic reasoning
• Complexity of propositional nested circumscription and nested abnormality theories
• Computing circumscription revisited: A reduction algorithm
• Computing circumscriptive databases
• Embedding circumscriptive theories in general disjunctive programs
• How many minimal upper bounds of minimal upper bounds
• Inferring negative information from disjunctive databases
• Logic Programming
• Logics in Artificial Intelligence
• Minimal model generation with positive unit hyper-resolution tableaux
• Nested abnormality theories
• On the computational cost of disjunctive logic programming: Propositional case
• Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
• Reasoning with minimal models: efficient algorithms and applications
• The complexity of belief update
• The complexity of model checking for circumscriptive formulae
• The complexity of propositional closed world reasoning and circumscription
• The well-founded semantics for general logic programs
• Theory and Applications of Satisfiability Testing

Cited in

(2)

• scientific article; zbMATH DE number 1696754 (Why is no real title available?)
• scientific article; zbMATH DE number 2044514 (Why is no real title available?)

Describes a project that uses

Uses Software

• SATCHMO

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

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