ML Anthology

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

Erik Sandewall
IJCAI 1973 pp. 230-234
/ijcai/1973/sandewall1973ijcai-conversion/

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.

PDF Semantic Scholar

Cite

Text

Sandewall. "Conversion of Predicate-Calculus Axioms, Viewed as Non-Deterministic Programs, to Corresponding Deterministic Programs." International Joint Conference on Artificial Intelligence, 1973.

Markdown

[Sandewall. "Conversion of Predicate-Calculus Axioms, Viewed as Non-Deterministic Programs, to Corresponding Deterministic Programs." International Joint Conference on Artificial Intelligence, 1973.](https://mlanthology.org/ijcai/1973/sandewall1973ijcai-conversion/)

BibTeX

@inproceedings{sandewall1973ijcai-conversion,
  title     = {{Conversion of Predicate-Calculus Axioms, Viewed as Non-Deterministic Programs, to Corresponding Deterministic Programs}},
  author    = {Sandewall, Erik},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {1973},
  pages     = {230-234},
  url       = {https://mlanthology.org/ijcai/1973/sandewall1973ijcai-conversion/}
}