Computing circumscription revisited: preliminary report

Authors:
Patrick Doherty;Witold Lukaszewicz;Andrzej Szalas
Affiliations:
Dept. of Computer Science, Linkoping University, Linkoping, Sweden;Institute of Informatics, Warsaw University, Warsaw, Poland;Institute of Informatics, Warsaw University, Warsaw, Poland
Venue:
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Year:
1995

Citing 6
Cited 6

Pointwise circumscription

Readings in nonmonotonic reasoning
An algorithm to compute circumscription

Artificial Intelligence
A generalization of collapsible cases of circumscription

Artificial Intelligence
A circumscriptive theorem prover

Artificial Intelligence
Compiling circumscriptive theories into logic programs

Proceedings of the 2nd international workshop on Non-monotonic reasoning
Circumscription

Handbook of logic in artificial intelligence and logic programming (vol. 3)

Modeling Paraconsistent Reasoning by Classical Logic

FoIKS '02 Proceedings of the Second International Symposium on Foundations of Information and Knowledge Systems
Logical Deduction Using the Local Computation Framework

ECSQARU '95 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
Nonmonotonic reasoning: towards efficient calculi and implementations

Handbook of automated reasoning
A survey on knowledge compilation

AI Communications
A temporal logic-based planning and execution monitoring framework for unmanned aircraft systems

Autonomous Agents and Multi-Agent Systems
General Domain Circumscription and its Effective Reductions

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We provide a general method which can be used in an algorithmic manner to reduce certain classes of 2nd-order circumscription axioms to logically equivalent 1st order formulas The algorithm takes as input an arbitrary 2nd-order formula and either returns as output an equivalent 1st order formula, or terminates with failure In addition to demonstrating the algorithm by applying it to various circumscriptive theories, we analyze its strength and provide formal subsumption results based on compan son with existing approaches.