<string language="el">Extensional higher-order logic programming</string>
engURIhttp://hdl.handle.net/10795/3623πληροφορικήβιομηχανία πληροφορικήςλογισμικόWe propose a purely extensional semantics for higher-order logic programming. In this semantics program
predicates denote sets of ordered tuples, and two predicates are equal i they are equal as sets. Moreover,
every program has a unique minimum Herbrand model which is the greatest lower bound of all Herbrand
models of the program and the least xed-point of an immediate consequence operator. We also propose an
SLD-resolution proof system which is proven sound and complete with respect to the minimum Herbrand
model semantics. In other words, we provide a purely extensional theoretical framework for higher-order
logic programming which generalizes the familiar theory of classical ( rst-order) logic programming.52 pp.Digital Library of the Operational Programme "Education and Lifelong Learning" abstract types
Texthttp://arxiv.org/abs/1106.3457552631application/pdfhttp://repository.edulll.gr/edulll/bitstream/10795/3623/2/3623_1.13_%ce%94%ce%97%ce%9c_10_8_13.pdfURIhttp://hdl.handle.net/10795/3623LOMv1.0creator2016-06-13T10:17:17ZLOMv1.0validator2016-06-13T10:17:17ZLOMv1.0grenonoCopyright EYD-EPEDBM (Operational Programme "Education and Lifelong Learning")