Knowledge compilation for closed world reasoning and circumscription

DOI10.1093/LOGCOM/11.4.579MaRDI QIDQ2761752zbMATH OpenOpenAlexFDO

Authors Sylvie Coste-Marquis, Pierre Marquis

Publication date 14 May 2003

Published in Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/logcom/11.4.579

zbMATH Keywords

closed world reasoning

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Recommendations

• The complexity of propositional closed world reasoning and circumscription
• Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
• scientific article; zbMATH DE number 589696
• On compact representations of propositional circumscription
• On compact representations of propositional circumscription

Cited in

(4)

• The complexity of propositional closed world reasoning and circumscription
• Fixed-parameter algorithms for closed world reasoning
• On compact representations of propositional circumscription
• Disjunctive closures for knowledge compilation

This page was built for publication: Knowledge compilation for closed world reasoning and circumscription

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