{"type":"ScholarlyArticle","title":"A Logic Program Schema and Its Applications","authors":[{"name":"Takashi Yokomori","slug":"takashi-yokomori","given":"Takashi","family":"Yokomori","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/1985/142","pdf":"https://ijcai.org/proceedings/1985/0142.pdf","markdown":"https://ijcai.org/proceedings/1985/142.md","bibtex":"https://ijcai.org/proceedings/1985/bibtex/142","volume":{"slug":"1985","title":"Proceedings of the Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1985","url":"https://ijcai.org/proceedings/1985/","year":1985,"location":"Los Angeles, California, USA","dates":"","editors":"Aravind Joshi","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Logic Programming","track":"Logic Programming","number":142,"pages":{"first":723,"last":724},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}