A theorem prover for prioritized circumscription

Authors:
Andrew B. Baker;Matthew L. Ginsberg
Affiliations:
Department of Computer Science, Stanford University, Stanford, California;Department of Computer Science, Stanford University, Stanford, California
Venue:
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1
Year:
1989

Citing 5
Cited 3

Applications of circumscription to formalizing common-sense knowledge

Artificial Intelligence
An assumption-based TMS

Artificial Intelligence
An algorithm to compute circumscription

Artificial Intelligence
On the relationship between circumscription and negation as failure

Artificial Intelligence
A circumscriptive theorem prover

Artificial Intelligence

Incorporating nonmonotonic reasoning in horn clause theories

AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 1
Transforming prioritized defaults and specificity into parallel defaults

UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
Some reflections on two current trends in formal argumentation

Logic Programs, Norms and Action

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a recent paper, Ginsberg shows how a backward-chaining ATMS can be used to construct a theorem prover for circumscription. Here, this work is extended to handle prioritized circumscription. The ideas to be described have been implemented, and examples are given of the system in use.