Circumscription and definability

Authors:
Yves Moinard;Raymond Rolland
Affiliations:
IRISA, Rennes-Cedex, France;IRMAR, Rennes-Cedex, France
Venue:
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Year:
1991

Citing 10
Cited 0

Saturation, nonmonotonic reasoning and the closed-world assumption

Artificial Intelligence
Applications of circumscription to formalizing common-sense knowledge

Artificial Intelligence
On the satisfiability of circumscription

Artificial Intelligence
Circumscription and implicit definability

Journal of Automated Reasoning
Pointwise circumscription

Readings in nonmonotonic reasoning
Autocircumscription

Artificial Intelligence
On the declarative semantics of logic programs with negation

Foundations of deductive databases and logic programming
The importance of open and recursive circumscription (research note)

Artificial Intelligence
The Semantics of Predicate Logic as a Programming Language

Journal of the ACM (JACM)
Introduction to Default Logic

Introduction to Default Logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

Thanks to two stronger versions of predicate circumscription (one of the best known non-monotonic reasoning methods), we give a definitive answer to two old open problems. The first one is the problem of expressing domain circumscription in terms of predicate circumscription. The second one is the problem of definability of the circumscribed predicates, asked by Doyle in 1985, and never answered since. These two results, and the way used to obtain them, could help an "automatic circumscriptor".