A classification and survey of preference handling approaches in nonmonotonic reasoning

J Delgrande, T Schaub, H Tompits… - Computational …, 2004 - Wiley Online Library
In recent years, there has been a large amount of disparate work concerning the
representation and reasoning with qualitative preferential information by means of …

On properties of update sequences based on causal rejection

T Eiter, M Fink, G Sabbatini, H Tompits - Theory and Practice of Logic …, 2002 - cambridge.org
In this paper, we consider an approach to update nonmonotonic knowledge bases
represented as extended logic programs under the answer set semantics. In this approach …

Semantic forgetting in answer set programming

T Eiter, K Wang - Artificial Intelligence, 2008 - Elsevier
The notion of forgetting, also known as variable elimination, has been investigated
extensively in the context of classical logic, but less so in (nonmonotonic) logic programming …

An abductive framework for computing knowledge base updates

C Sakama, K Inoue - Theory and Practice of Logic Programming, 2003 - cambridge.org
This paper introduces an abductive framework for updating knowledge bases represented
by extended disjunctive programs. We first provide a simple transformation from abductive …

Disjunctive logic programs with inheritance

F Buccafurri, W Faber, N Leone - Theory and Practice of Logic …, 2002 - cambridge.org
The paper proposes a new knowledge representation language, called DLP<, which
extends disjunctive logic programming (with strong negation) by inheritance. The addition of …

LUPS—A language for updating logic programs

JJ Alferes, LM Pereira, H Przymusinska… - Artificial Intelligence, 2002 - Elsevier
Most of the work conducted so far in the field of logic programming has focused on
representing static knowledge, ie, knowledge that does not evolve with time. To overcome …

A semantic framework for preference handling in answer set programming

T Schaub, K Wang - Theory and Practice of Logic Programming, 2003 - cambridge.org
We provide a semantic framework for preference handling in answer set programming. To
this end, we introduce preference preserving consequence operators. The resulting fixpoint …

Multi-dimensional dynamic knowledge representation

JA Leite, JJ Alferes, LM Pereira - … 2001 Vienna, Austria, September 17–19 …, 2001 - Springer
Abstract According to Dynamic Logic Programming (DLP), knowledge may be given by a
sequence of theories (encoded as logic programs) representing different states of …

[PDF][PDF] A framework for declarative update specifications in logic programs

T Eiter, M Fink, G Sabbatini, H Tompits - IJCAI, 2001 - haendel.kr.tuwien.ac.at
Recently, several approaches for updating knowledge bases represented as logic programs
have been proposed. In this paper, we present a generic framework for declarative …

Preferred answer sets for ordered logic programs

D Van Nieuwenborgh, D Vermeir - Theory and Practice of Logic …, 2006 - cambridge.org
We extend answer set semantics to deal with inconsistent programs (containing classical
negation), by finding a “best” answer set. Within the context of inconsistent programs, it is …