On compact representations of propositional circumscription

DOI10.1016/S0304-3975(96)00182-XzbMath0901.68189WikidataQ58006975 ScholiaQ58006975MaRDI QIDQ1391128

Francesco M. Donini, Riccardo Silvestri, Marco Cadoli, Marco Schaerf

Publication date: 22 July 1998

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

zbMATH Keywords

reasoningpolynomial-size representations

Mathematics Subject Classification ID

Knowledge representation (68T30) General topics in artificial intelligence (68T01)

Related Items

Reducing belief revision to circumscription (and vice versa), Redundancy in logic. I: CNF propositional formulae, The size of a revised knowledge base, The complexity of circumscriptive inference in Post's lattice, Definability for model counting, Preprocessing of intractable problems, Compiling propositional weighted bases

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some consequences of non-uniform conditions on uniform classes
• On the computability of circumscription
• An algorithm to compute circumscription
• A generalization of collapsible cases of circumscription
• A logic for default reasoning
• Circumscription - a form of non-monotonic reasoning
• The complexity of model checking for circumscriptive formulae
• Computing circumscriptive databases
• Is intractability of nonmonotonic reasoning a real drawback?
• Deduction in non-Horn databases
• The size of a revised knowledge base
• Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
• Some computational aspects of circumscription
• Minimal consequence in sentential logic
• Autoepistemic logic
• The well-founded semantics for general logic programs
• On compact representations of propositional circumscription