LPNMR
1997
Springer
14 years 3 months ago
1997
Springer
This paper introduces power default reasoning (PDR), a framework for nonmonotonic reasoning based on the domain-theoretic idea of modeling default rules with partial-information i...
LPNMR
1997
Springer
14 years 3 months ago
1997
Springer
Turi [20] introduced the important notion of a constrained atom: an atom with associated equality and disequality constraints on its arguments. A set of constrained atoms is a cons...
LPKR
1997
Springer
14 years 3 months ago
1997
Springer
In this paper, we use autoepistemic reasoning semantics to classify various semantics for disjunctive logic programs with default negation. We have observed that two different typ...
LPKR
1997
Springer
14 years 3 months ago
1997
Springer
Abstract. We study the relationship between argumentation (abduction) and disjunctive logic programming. Based on the paradigm of argumentation, an abductive semantic framework for...
LPKR
1997
Springer
14 years 3 months ago
1997
Springer
Abstract. Recently the field of theory update has seen some improvement, in what concerns model updating, by allowing updates to be specified by so-called revision programs. The ...
LPKR
1997
Springer
14 years 3 months ago
1997
Springer
We present the system LAP (Learning Abductive Programs) that is able to learn abductive logic programs from examples and from a background abductive theory. A new type of induction...
LPKR
1997
Springer
14 years 3 months ago
1997
Springer
Abstract. This paper presents an extension of disjunctive datalog (Datalog∨ ) by nested rules. Nested rules are (disjunctive) rules where elements of the head may be also rules. ...
LPKR
1997
Springer
14 years 3 months ago
1997
Springer
The purpose of this paper is to investigate the methodology of reasoning with prioritized defaults in the language of logic programs under the answer set semantics. We present a do...
LPKR
1997
Springer
14 years 3 months ago
1997
Springer
In this overview we show how Knowledge Representation (KR) can be done with the help of generalized logic programs. We start by introducing the core of PROLOG, which is based on de...
LOPSTR
1997
Springer
14 years 3 months ago
1997
Springer
Schema-based program transformation [8] has been proposed as an effective technique for the optimisation of logic programs. Schemata are applied to a logic program, mapping ineffi...