Sciweavers

Share
JAIR
2007
108views more  JAIR 2007»
9 years 6 months ago
Discovering Classes of Strongly Equivalent Logic Programs
We report on a successful experiment of computeraided theorem discovery in the area of logic programming with answer set semantics. Specifically, with the help of computers, we d...
Fangzhen Lin, Yin Chen
JAIR
2008
104views more  JAIR 2008»
9 years 6 months ago
Sound and Complete Inference Rules for SE-Consequence
The notion of strong equivalence on logic programs with answer set semantics gives rise to a consequence relation on logic program rules, called SE-consequence. We present a sound...
Ka-Shu Wong
LANMR
2004
9 years 8 months ago
Component-Based Answer Set Programming
In previous work we have discussed the importance of identifying the cycles that occur in a logic program under the answer set semantics, and the connections between cycles, that w...
Stefania Costantini
FOIKS
2006
Springer
9 years 10 months ago
Guarded Open Answer Set Programming with Generalized Literals
Abstract. We extend the open answer set semantics for programs with generalized literals. Such extended programs (EPs) have interesting properties, e.g. the ability to express infi...
Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir
ECAI
2006
Springer
9 years 10 months ago
Approximating Extended Answer Sets
Abstract. We present an approximation theory for the extended answer set semantics, using the concept of an approximation constraint. Intuitively, an approximation constraint, whil...
Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir
AUSAI
2006
Springer
9 years 10 months ago
LPForget: A System of Forgetting in Answer Set Programming
Abstract. A novel declarative approach of forgetting in answer set programming (ASP) has been proposed recently. In this paper we report a system prototype of forgetting in ASP, ca...
Fu-Leung Cheng, Thomas Eiter, Nathan Robinson, Abd...
EUROCAST
2007
Springer
133views Hardware» more  EUROCAST 2007»
9 years 10 months ago
Temporal Equilibrium Logic: A First Approach
In this paper we introduce an extension of Equilibrium Logic (a logical characterisation of the Answer Set Semantics for logic programs) consisting in the inclusion of modal tempor...
Pedro Cabalar, Gilberto Pérez Vega
ICLP
1994
Springer
9 years 11 months ago
Splitting a Logic Program
In many cases, a logic program can be divided into two parts, so that one of them, the \bottom" part, does not refer to the predicates de ned in the \top" part. The \bot...
Vladimir Lifschitz, Hudson Turner
LPNMR
1999
Springer
9 years 11 months ago
Representing Transition Systems by Logic Programs
This paper continues the line of research on representing actions, on the automation of commonsense reasoning and on planning that deals with causal theories and with action langua...
Vladimir Lifschitz, Hudson Turner
AGP
2003
IEEE
10 years 3 days ago
Solving Hard Disjunctive Logic Programs Faster (Sometimes)
Disjunctive Logic Programming (DLP) under the consistent answer set semantics is an advanced formalism for knowledge representation and reasoning. It is, under widely believed assu...
Gerald Pfeifer
books