The complexity of theorem proving in circumscription and minimal entailment

DOI10.1007/978-3-319-08587-6_32zbMATH Open1425.03006DBLPconf/cade/BeyersdorffC14OpenAlexW1598129020WikidataQ59900280 ScholiaQ59900280MaRDI QIDQ3192208FDOQ3192208

Authors: Olaf Beyersdorff, Leroy Chew 

Publication date: 26 September 2014

Published in: Automated Reasoning (Search for Journal in Brave)

Full work available at URL: http://eprints.whiterose.ac.uk/80489/1/circumscription-CIRC-final-version.pdf

Recommendations

• scientific article; zbMATH DE number 1189101
• Some computational aspects of circumscription
• scientific article; zbMATH DE number 4106292
• On compact representations of propositional circumscription
• Logic for Programming, Artificial Intelligence, and Reasoning

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Complexity of proofs (03F20)

Cited In (9)

• Title not available (Why is that?)
• On compact representations of propositional circumscription
• Title not available (Why is that?)
• Proof complexity of modal resolution
• Title not available (Why is that?)
• Online Enumeration of All Minimal Inductive Validity Cores
• Title not available (Why is that?)
• A tableau prover for domain minimization
• The Complexity of Circumscriptive Inference in Post’s Lattice

This page was built for publication: The complexity of theorem proving in circumscription and minimal entailment

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