On Interpreters of Logic Programming Systems
Abstract
We introduce the notions of totally resolving and totally complete interpreters for Horn programming languages. We prove the existence of totally complete interpreter (an interpreter which gives all the answers for a query if the query is a logical consequence of the program) for any Horn programming language and existence of totally resolving interpreter (an interpreter which gives all the answers for any program and query) for languages whose programs have ¯nite templates of their least models. We also consider problems of total completeness and total resolvability for PROLOG interpreter from viewpoint of some (natural) program transformations and prove that it is not possible to make the interpreter totally complete.
References
Nigiyan S.A.,Khachoyan L. O.Transformations of Logic Programs. Programming and Computer Software, Vol. 23,No.6, pp.302-309,1997.
Nigiyan S. A,Khachoyan L.O. On ¢-equivalence problem of logic programs. Reports of National Academy of Sciences of Armenia,Vol.99,No. 2, pp. 99-103 ( in Russian),1999.
Clocksin W.F.,Mellish C. S. Programming in Prolog. Berlin: Springer-Verlag,1984.
Lloyd J. W. Foundations of Logic Programming. Berlin:Springer-Verlag,1984.
Nigiyan S. A . The Prolog Interpreter from the Viewpoint of Logical Semantics. Programming and Computer Software, Vol.20, No.2, pp. 69-75,1994.
Hambardzumyan A. M.The Completeness and Solvability Problems for Simple Monadic PROLOG Interpreter. Proceedings of the Conference on Computer Science and Information Technologies, Yerevan, pp.36-38, 1999.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
