On the relationship between autoepistemic logic and parallel circumscription

Authors:
M Gelfond;H Przymusinska
Affiliations:
The University of Texas at El Paso, El Paso, TX;The University of Texas at El Paso, El Paso, TX
Venue:
ISMIS '86 Proceedings of the ACM SIGART international symposium on Methodologies for intelligent systems
Year:
1986

Citing 5
Cited 1

Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption

Journal of Logic Programming
Semantical considerations on nonmonotonic logic

Artificial Intelligence
Closed-world databases and circumscription

Artificial Intelligence
The extended closed world assumption and its relationship to parallel circumscription

PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
On Indefinite Databases and the Closed World Assumption

Proceedings of the 6th Conference on Automated Deduction

Nonmonotonic logics and their algebraic foundations

CSL'06 Proceedings of the 20th international conference on Computer Science Logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

The purpose of this paper is to investigate the relationship between two approaches to the formalization of non-monotonic reasoning - J. McCarthy's approach based on the notion of Circumscription [Mc] and the Autoepistemic Logic approach of R. Moore [Mr]. Since these two approaches differ considerably in scope, we will limit our attention to the situation where some common ground can be found. Namely, we consider only the propositional case of parallel circumpsription, when all predicates of a formula T are circumscribed simultaneously.