Sciweavers

565 search results - page 28 / 113
» Extending Answer Sets for Logic Programming Agents
Sort
View
JELIA
2004
Springer
14 years 1 months ago
On the Relation Between ID-Logic and Answer Set Programming
This paper is an analysis of two knowledge representation extensions of logic programming, namely Answer Set Programming and ID-Logic. Our aim is to compare both logics on the leve...
Maarten Mariën, David Gilis, Marc Denecker
AAAI
2008
13 years 10 months ago
A Reductive Semantics for Counting and Choice in Answer Set Programming
In a recent paper, Ferraris, Lee and Lifschitz conjectured that the concept of a stable model of a first-order formula can be used to treat some answer set programming expressions...
Joohyung Lee, Vladimir Lifschitz, Ravi Palla
ASP
2003
Springer
14 years 1 months ago
Properties of maximal cliques of a pair-wise compatibility graph for three nonmonotonic reasoning system
In this paper we define the notion of a compatibility relation so as to have a common framework for three nonmonotonic reasoning systems: normal logic programming, extended logic ...
Robert E. Mercer, Vincent Risch
AAAI
1994
13 years 9 months ago
Soundness and Completeness of a Logic Programming Approach to Default Logic
We present a method of representing some classes of default theories as normal logic programs. The main point is that the standard semantics (i.e. SLDNF-resolution) computes answe...
Grigoris Antoniou, Elmar Langetepe
RWEB
2009
Springer
14 years 2 months ago
Answer Set Programming: A Primer
Abstract. Answer Set Programming (ASP) is a declarative problem solving paradigm, rooted in Logic Programming and Nonmonotonic Reasoning, which has been gaining increasing attentio...
Thomas Eiter, Giovambattista Ianni, Thomas Krennwa...