Document Type
Report
Date
5-1990
Keywords
Logic programming
Language
English
Disciplines
Computer Sciences
Description/Abstract
In [6], we introduced a means of allowing logic programs to contain negations in both the head and the body of a clause. Such programs were called generally Horn programs (GHPs, for short). The model-theoretic semantics of GHPs were defined in terms of four-valued Belnap lattices [5]. For a class of programs called well-behaved programs, an SLD-resolution like proof procedure was introduced. This procedure was proven (under certain restrictions) to be sound (for existential queries) and complete (for ground queries). In this paper, we remove the restriction that programs be well-behaved and extend our soundness and completeness results to apply to arbitrary existential queries and to arbitrary GHPs. This is the strongest possible completeness result for GHPs. The results reported here apply to the design of very large knowledge bases and in processing queries to knowledge bases that possibly contain erroneous information.
Recommended Citation
Blair, Howard A. and Subrahmanian, V. S., "Strong Completeness Results for Paraconsistent Logic Programming" (1990). Electrical Engineering and Computer Science - Technical Reports. 51.
https://surface.syr.edu/eecs_techreports/51
Source
local
Additional Information
School of Computer and Information Science, Syracuse University, SU-CIS-90-12