Smallest equivalent sets for finite propositional formula circumscription

DOI10.1007/3-540-44957-4_60MaRDI QIDQ2767115zbMATH OpenFDO

Authors Yves Moinard, Raymond Rolland

Publication date 28 January 2002

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

Full work available at URL https://doi.org/10.1007/3-540-44957-4_60

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Recommendations

• Some computational aspects of circumscription
• The expressive power of circumscription
• scientific article; zbMATH DE number 640290
• On compact representations of propositional circumscription
• Decidability and definability with circumscription

Cited in

(1)

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

This page was built for publication: Smallest equivalent sets for finite propositional formula circumscription

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