Conversion of Predicate-Calculus Axioms, Viewed as Non-Deterministic Programs, to Corresponding Deterministic Programs

Sandewall, Erik

Conversion of Predicate-Calculus Axioms, Viewed as Non-Deterministic Programs, to Corresponding Deterministic Programs

Download BibTeX Cite

Proceedings of the Third International Joint Conference on Artificial Intelligence. Formalisms for A.I.. Pages 230-233.

Abstract

The paper considers the problem of converting axioms in predicate calculus to deterministic programs, which are to be used as "rules" by a GPS-type supervisor. It is shown that this can be done, but that the "objects" must then contain procedure closures or "FUNARG-expressions" which are later applied.

Erik Sandewall. 1973. Conversion of Predicate-Calculus Axioms, Viewed as Non-Deterministic Programs, to Corresponding Deterministic Programs. In Proceedings of the Third International Joint Conference on Artificial Intelligence, IJCAI-73. IJCAI, 230–233. https://ijcai.org/proceedings/1973/30

@inproceedings{ijcai1973p30,
  title     = {Conversion of Predicate-Calculus Axioms, Viewed as Non-Deterministic Programs, to Corresponding Deterministic Programs},
  author    = {Sandewall, Erik},
  booktitle = {Proceedings of the Third International Joint Conference on
               Artificial Intelligence, {IJCAI-73}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  editor    = {Nils J. Nilsson},
  pages     = {230--233},
  year      = {1973},
  month     = {8},
  note      = {Formalisms for A.I.},
  url       = {https://ijcai.org/proceedings/1973/30},
}

TY  - CPAPER
TI  - Conversion of Predicate-Calculus Axioms, Viewed as Non-Deterministic Programs, to Corresponding Deterministic Programs
AU  - Sandewall, Erik
T2  - Proceedings of the Third International Joint Conference on Artificial Intelligence, IJCAI-73
PB  - International Joint Conferences on Artificial Intelligence
PY  - 1973
SP  - 230
EP  - 233
UR  - https://ijcai.org/proceedings/1973/30
ER  -