A Theorem Prover for Prioritized Circumscription

Baker, Andrew B.; Ginsberg, Matthew L.

A Theorem Prover for Prioritized Circumscription

Download BibTeX Cite

Proceedings of the Eleventh International Joint Conference on Artificial Intelligence. Automated Deduction. Pages 463-466.

Abstract

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

Andrew B. Baker, and Matthew L. Ginsberg. 1989. A Theorem Prover for Prioritized Circumscription. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, IJCAI-89. IJCAI, 463–466. https://ijcai.org/proceedings/1989/75

@inproceedings{ijcai1989p75,
  title     = {A Theorem Prover for Prioritized Circumscription},
  author    = {Baker, Andrew B. and Ginsberg, Matthew L.},
  booktitle = {Proceedings of the Eleventh International Joint Conference on
               Artificial Intelligence, {IJCAI-89}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  editor    = {N. S. Sridharan},
  pages     = {463--466},
  year      = {1989},
  month     = {8},
  note      = {Automated Deduction},
  url       = {https://ijcai.org/proceedings/1989/75},
}

TY  - CPAPER
TI  - A Theorem Prover for Prioritized Circumscription
AU  - Baker, Andrew B.
AU  - Ginsberg, Matthew L.
T2  - Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, IJCAI-89
PB  - International Joint Conferences on Artificial Intelligence
PY  - 1989
SP  - 463
EP  - 466
UR  - https://ijcai.org/proceedings/1989/75
ER  -