Answer set programming (ASP) is a form of declarative programming oriented towards
difficult search problems. As an outgrowth of research on the use of nonmonotonic …

Foundations of Logic Programming Page 1 Foundations of Logic Programming Vladimir
Lifschitz Department of Computer Sciences University of Texas Austin, TX 78712 Abstract …

The present monograph is a slightly revised version of my Habilitations schrift Proof-
theoretic Aspects of Intensional and Non-Classical Logics, successfully defended at Leipzig …

Dealing with contradiction Page 1 8. Dealing with contradiction As we've seen before, WFSX
is not defined for every program, ie some programs are contradictory and are given no …

In natural language, and in some knowledge representation systems, such as extended
logic programs, there are two kinds of negation: a weak negation expressing non-truth, and …

Our contribution to this volume consists in giving a logic programmer's view on handling
program inconsistency. The semantics we cover will touch several aspects of implementing …

In this paper we will study the properties of the least extension n (Λ) of a given intermediate
logic Λ by a strong negation. It is shown that the mapping from Λ to n (Λ) is a homomorphism …

The evolution of logic programming semantics has included the introduction of a new explicit
form of negation, beside the older implicit (or default) negation typical of logic programming …

Databases do not usually allow for the representation of explicit negative information. We
show that the concept of strong negation, already known from partial logic and constructive …

In this paper we study a new franiework for normal and extended logic pro-gramming, called
logic programming without negation as failure (LPwNF), which uses explicit negation hut …