An Intuitionistic Approach to Logic Programming
- A natural extension of SLD-resolution is introduced as a goal directed proof procedure for the full first order implicational fragment of intuitionistic logic. Its intuitionistic semantic fits a procedural interpretation of logic programming. By allowing arbitrary nested implications it can be used for implementing modularity in logic programs. With adequate negation axioms it gives an alternative to negation as failure and leads to a proof procedure for full first order predicate logic.
Download full text files
Additional Services
| Author: | Rodrigo Readi-Nasser |
|---|---|
| URN: | urn:nbn:de:hbz:386-kluedo-49983 |
| Serie (Series number): | Interner Bericht des Fachbereich Informatik (296) |
| Document Type: | Report |
| Language of publication: | English |
| Publication Date: | 2017/10/30 |
| Year of Publication: | 1998 |
| Publishing Institute: | Technische Universität Kaiserslautern |
| Date of the Publication (Server): | 2017/10/30 |
| Number of page: | 11 |
| Faculties / Organisational entities: | Kaiserslautern - Fachbereich Informatik |
| DDC-Cassification: | 0 Allgemeines, Informatik, Informationswissenschaft / 004 Informatik |
| Licence (German): |  Creative Commons 4.0 - Namensnennung, nicht kommerziell, keine Bearbeitung (CC BY-NC-ND 4.0) |