Abstract
This paper presents the declarative and procedural semantics of Reflective Prolog, a new logic language able to represent metaknowledge and use it in the proof process via an extended resolution procedure including forms of implicit reflection. The declarative semantics of a Reflective Prolog definite program is provided in terms of the Least Reflective Herbrand Model of the program, characterized by means of a suitable mapping. The extended resolution is then shown to be sound and complete with respect to the Least Reflective Herband Model.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Foundations of Computer Science
Paper Title
Journal
Date
