557 search results - page 23 / 112 » Useful Transformations in Answer set programming |
EPIA
2005
Springer
14 years 1 months ago
2005
Springer
The paper studies reductions of propositional theories in equilibrium logic to logic programs under answer set semantics. Specifically we are concerned with the question of how to...
ICLP
1994
Springer
13 years 12 months ago
1994
Springer
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...
SAS
2007
Springer
14 years 2 months ago
2007
Springer
Denotational static analysis of Java bytecode has a nice and clean compositional definition and an efficient implementation with binary decision diagrams. But it models only the f...
LPNMR
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We present a framework for updating logic programs under the answer-set semantics that builds on existing work on preferences in logic programming. The approach is simple...
ECAI
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Concepts in Answer Set Programming (ASP) are normally defined in terms of atoms. We show that the treatment of atoms and bodies (of rules) as equitable computational obje...