Completeness Result of SLDNF-resolution for a relevant Class of Logic Programs
- The proof theory of logic programming has been given by the SLDNF-resolution which has been proven complete for the class of arbitrary logic programs when assuming fair selection and non-floundering [Drabent96,Staerk97]. To test the non-floundering condition is as hard as to resolve the problem itself. To overcome this assumption we first of all extend the universe to one that contains variables modulo renaming and define the bottom up SLDNF-resolution so that the elimination of this assumption is obvious. We then prove that the so defined SLDNF-resolution is sound and complete for a larger class of logic programs which does obviously contain the classes mentioned above.
| Author: | Ebénézer Ntienjem |
|---|---|
| URN: | urn:nbn:de:bvb:384-opus4-2232 |
| Frontdoor URL | https://opus.bibliothek.uni-augsburg.de/opus4/272 |
| Series (Serial Number): | Reports / Technische Berichte der Fakultät für Angewandte Informatik der Universität Augsburg (1997-04) |
| Type: | Report |
| Language: | English |
| Year of first Publication: | 1997 |
| Publishing Institution: | Universität Augsburg |
| Release Date: | 2006/06/23 |
| Tag: | Logic Programming; Proof Theory; Model Theory; Semantics; Resolution |
| GND-Keyword: | Beweistheorie; logische Programmierung |
| Institutes: | Fakultät für Angewandte Informatik |
| Fakultät für Angewandte Informatik / Institut für Informatik | |
| Dewey Decimal Classification: | 0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik |
