National and Kapodistrian University of Athens
Prοοf procedure for extensional higher-order logic programming
Abstract
dc:descriptionWe consider an extensional higher-order logic programming language which possesses the minimum Herbrand model property. We propose an SLD-resolution proof procedure and we demonstrate that it is sound and complete with respect to this semantics. In this way, we extend the familiar proof theory of first-order logic programming to apply to the more general higher-order case. We then enhance our source language with constructive negation and extend the aforementioned proof procedure to support this new feature. We demonstrate the soundness of the resulting proof procedure and describe an actual implementation of a language that embodies the above ideas.
Degree
thesis:*- Grantor dc:publisher
- National and Kapodistrian University of Athens
- Year dc:date
- 2014
Author and committee
dc:creator, dc:contributor.*- Authors dc:creator
-
- Charalambidis, Angelos
- Χαραλαμπίδης, Άγγελος
Subjects
dc:subject × 14- Λογικός προγραμματισμός
- Λογική υψηλής τάξης
- Αποδεικτική διαδικασία
- Άρνηση ως αποτυχία
- Κατασκευαστική άρνηση
- Logic programming
- Higher-order logic
- Proof Procedure
- Negation as failure
- Constructive negation
- Φυσικές Επιστήμες
- Επιστήμη Ηλεκτρονικών Υπολογιστών και Πληροφορική
- Natural Sciences
- Computer and Information Sciences
Rights
- Language dc:language
- eng
Identifiers
dc:identifier.*- Identifier
- 10.12681/eadd/38099