An extension of pointwise circumscription

DOI10.1016/S0004-3702(96)00028-8zbMATH Open1506.68140MaRDI QIDQ2676573FDOQ2676573

Authors: Koji Iwanuma, Kazuhiko Oota 

Publication date: 27 September 2022

Published in: Artificial Intelligence (Search for Journal in Brave)

Recommendations

• Some computational aspects of circumscription
• Circumscription: Completeness reviewed
• A theorem on the consistency of circumscription
• Abstract minimality and circumscription
• The expressive power of circumscription

zbMATH Keywords

approximationcomputationcircumscriptionequivalent transformationpointwise circumscriptionexistential formulas

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Cites Work

• Title not available (Why is that?)
• An algorithm to compute circumscription
• Title not available (Why is that?)
• Circumscription - a form of non-monotonic reasoning
• Title not available (Why is that?)
• Some computational aspects of circumscription
• Title not available (Why is that?)
• On the satisfiability of circumscription
• Completeness results for circumscription
• Title not available (Why is that?)
• Title not available (Why is that?)
• A generalization of collapsible cases of circumscription
• Circumscription: Completeness reviewed
• A circumscriptive theorem prover
• Conservative query normalization on parallel circumscription
• An efficient method for eliminating varying predicates from a circumscription

Cited In (5)

• Reconsideration of circumscriptive induction with pointwise circumscription
• A generalization of collapsible cases of circumscription
• Pointwise extensions of GSOS-defined operations
• Extending the reach of the point-to-set principle
• Abstract minimality and circumscription

This page was built for publication: An extension of pointwise circumscription

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