Extended Well-Founded Semantics for Paraconsistent Logic Programs

Chiaki Sakama

Proceedings of the International Conference on Fifth Generation Computer Systems (FGCS'92), pp. 592-599, Ohmsha, 1992.

Abstract

This paper presents a declarative semantics of logic programs which possibly contain inconsistent information. We introduce a multi-valued interpretation of logic programs and present the extended well-founded semantics for paraconsistent logic programs. In this setting, a meaningful information is still available in the presence of an inconsistent information in a program and any fact which is affected by an inconsistent information is distinguished from the others. The well-founded semantics is also extended to disjunctive paraconsistent logic programs.


Full Paper (gzipped postscript 73K)