HCPRVR: An Interpreter for Logic Programs

Abstract

An overview of a logic program interpreter written in Lisp is presented. The interpreter is a Horn clause-based theorem prover augmented by Lisp functions attached to some predicate names. Its application to natural language processing is discussed. The theory of operation is explained, including the high level organization of the PROVE function and an efficient version of unification. The paper concludes with comments on the overall efficiency of the interpreter.

Cite

Text

Chester. "HCPRVR: An Interpreter for Logic Programs." AAAI Conference on Artificial Intelligence, 1980.

Markdown

[Chester. "HCPRVR: An Interpreter for Logic Programs." AAAI Conference on Artificial Intelligence, 1980.](https://mlanthology.org/aaai/1980/chester1980aaai-hcprvr/)

BibTeX

@inproceedings{chester1980aaai-hcprvr,
  title     = {{HCPRVR: An Interpreter for Logic Programs}},
  author    = {Chester, Daniel L.},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {1980},
  pages     = {93-95},
  url       = {https://mlanthology.org/aaai/1980/chester1980aaai-hcprvr/}
}