A Logic Program Schema and Its Applications

Yokomori, Takashi

A Logic Program Schema and Its Applications

Download BibTeX Cite

Proceedings of the Ninth International Joint Conference on Artificial Intelligence. Logic Programming. Pages 723-724.

Abstract

In this paper we consider a specific type of logic programs called recursive-schema programs and show that the class of recursive-schema programs has sufficient expressive capability, which provides an alternative simple proof for the result by Tärnlund concerning the computational power of Horn clause programs. Further, it is shown that any Turing computable logic program can be expressed as a conjunctive formula of three recursive-schema programs. Some application issues are also discussed in the contexts of program transformation and synthesis.

Takashi Yokomori. 1985. A Logic Program Schema and Its Applications. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence, IJCAI-85. IJCAI, 723–724. https://ijcai.org/proceedings/1985/142

@inproceedings{ijcai1985p142,
  title     = {A Logic Program Schema and Its Applications},
  author    = {Yokomori, Takashi},
  booktitle = {Proceedings of the Ninth International Joint Conference on
               Artificial Intelligence, {IJCAI-85}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  editor    = {Aravind Joshi},
  pages     = {723--724},
  year      = {1985},
  note      = {Logic Programming},
  url       = {https://ijcai.org/proceedings/1985/142},
}

TY  - CPAPER
TI  - A Logic Program Schema and Its Applications
AU  - Yokomori, Takashi
T2  - Proceedings of the Ninth International Joint Conference on Artificial Intelligence, IJCAI-85
PB  - International Joint Conferences on Artificial Intelligence
PY  - 1985
SP  - 723
EP  - 724
UR  - https://ijcai.org/proceedings/1985/142
ER  -