Combining Explicit Negation and Negation by Failure Via Belnap's Logic
نویسندگان
چکیده
This paper deals with logic programs containing two kinds of negation: negation as failure and explicit negation. This allows two diierent forms of reasoning in the presence of incomplete information. Such programs have been introduced by Gelfond and Lifschitz and called extended programs. We provide them with a logical semantics in the style of Kunen, based on Belnap's four-valued logic, and an answer sets' semantics that is shown to be equivalent to that of Gelfond and Lifschitz. The proofs rely on a translation into normal programs, and on a variant of Fit-ting's extension of logic programming to bilattices.
منابع مشابه
Combining Explicit Negation and Negation by Failure via Belnap's Logic Combining Explicit Negation and Negation by Failure via Belnap's Logic
This paper deals with logic programs containing two kinds of negation: negation as failure and explicit negation, allowing two diierent forms of uncertainty reasoning in the presence of incomplete information. Such programs have been introduced by Gelfond and Lifschitz and called extended programs. We provide them with a logical semantics in the style of Kunen, based on Belnap's four-valued log...
متن کاملBelnap's Epistemic States and Negation-as-Failure
Generalizing Belnap's system of epistemic states [Bel77] we obtain the system of disjunctive factbases which is the paradigm for all other kinds of disjunctive knowledge bases. Disjunctive factbases capture the nonmonotonic reasoning based on paraminimal models. In the schema of a disjunctive factbase, certain predicates of the resp. domain are declared to be exact, i.e. two-valued, and in turn...
متن کاملWell Founded Semantics for Logic Programs with Explicit Negation
The aim of this paper is to provide a semantics for general logic programs (with negation by default) extended with explicit negation, subsuming well founded semantics 22]. The Well Founded semantics for extended logic programs (WFSX) is expressible by a default theory semantics we have devised 11]. This relationship improves the cross{fertilization between logic programs and default theories, ...
متن کاملSupporting Open and Closed World Reasoning on the Web
In this paper general mechanisms and syntactic restrictions are explored in order to specify and merge rule bases in the Semantic Web. Rule bases are expressed by extended logic programs having two forms of negation, namely strong (or explicit) and weak (also known as default negation or negation-as-failure). The proposed mechanisms are defined by very simple modular program transformations, an...
متن کاملOpen and Closed World Reasoning in the Semantic Web
In this paper general mechanisms and syntactic restrictions are explored in order to specify and merge rule bases in the Semantic Web. Rule bases are expressed by extended logic programs having two forms of negation, namely strong (or explicit) and weak (also known as default negation or “negation as failure”). The proposed mechanisms are defined by very simple modular program transformations, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 171 شماره
صفحات -
تاریخ انتشار 1997