On proof complexity of circumscription

DOI10.1007/3-540-69778-0_19MaRDI QIDQ3838809zbMATH OpenFDO

Authors Uwe Egly, Hans Tompits

Publication date 5 January 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-69778-0_19

zbMATH Keywords

circumscriptionfirst-order sequent calculusnonmonotonic reasoning

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Complexity of proofs (03F20) Logic in artificial intelligence (68T27)

Recommendations

• scientific article; zbMATH DE number 1748576
• Proof-complexity results for nonmonotonic reasoning
• The complexity of theorem proving in circumscription and minimal entailment
• A sequent calculus for circumscription

Cited in

(14)

• On the satisfiability of circumscription
• On the computability of circumscription
• An efficient method for eliminating varying predicates from a circumscription
• scientific article; zbMATH DE number 1696754 (Why is no real title available?)
• On the complexity of proof deskolemization
• The complexity of theorem proving in circumscription and minimal entailment
• Some computational aspects of circumscription
• Circumscription within monotonic inferences
• scientific article; zbMATH DE number 67825 (Why is no real title available?)
• A sequent calculus for circumscription
• scientific article; zbMATH DE number 1748576 (Why is no real title available?)
• scientific article; zbMATH DE number 1765677 (Why is no real title available?)
• Decidability of circumscribed description logics revisited
• scientific article; zbMATH DE number 7155168 (Why is no real title available?)

This page was built for publication: On proof complexity of circumscription

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