Completeness and Termination of SLDNF-Resolution and Determination of a Selection function using Mode
- We consider a mode of an n-ary predicate symbol with respect to a logic program, which meets the aim of logic programming and captures the spirit of unification as arguments passing mechanism. We prove that the SLDNF-resolution which resolves a non-ground negative literal is complete for an interesting class of logic programs using this mode. To obviously do such a proof we do consider terms modulo variable renaming and map a logic program with a goal to an allowed logic program with an allowed goal, since it is well-known that the SLDNF-resolution is complete for the class of allowed logic programs with allowed goals [Kunen89]. The termination of the SLDNF-resolution is studied using a sophisticated selection function which only chooses those literals and clauses that are applicable in the sense that using such literals and clauses the SLDNF-resolution would not be infinite, if a finite SLDNF-resolution does exist.
| Author: | Ebénézer Ntienjem |
|---|---|
| URN: | urn:nbn:de:bvb:384-opus4-2257 |
| Frontdoor URL | https://opus.bibliothek.uni-augsburg.de/opus4/274 |
| Series (Serial Number): | Reports / Technische Berichte der Fakultät für Angewandte Informatik der Universität Augsburg (1997-06) |
| Type: | Report |
| Language: | English |
| Date of Publication (online): | 2006/06/23 |
| Year of first Publication: | 1997 |
| Publishing Institution: | Universität Augsburg |
| Release Date: | 2006/06/23 |
| Tag: | Logic Programming; Mode; Model Theory; Proof Theory; Resolution; Semantics |
| 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 |
| Licence (German): |  Deutsches Urheberrecht |
