Sciweavers

Share
FUIN
2010
137views more  FUIN 2010»
9 years 7 months ago
Extending and Implementing RASP
In previous work we have proposed an extension to ASP (Answer Set Programming), called RASP, standing for ASP with Resources. RASP supports declarative reasoning on production and...
Stefania Costantini, Andrea Formisano, Davide Pett...
KR
2010
Springer
9 years 8 months ago
On the Progression Semantics and Boundedness of Answer Set Programs
In this paper, we propose a progression semantics for firstorder answer set programs. Based on this new semantics, we are able to define the notion of boundedness for answer set p...
Yan Zhang, Yi Zhou
LOGCOM
2010
128views more  LOGCOM 2010»
9 years 8 months ago
Answer Set Programming with Resources
In this paper, we propose an extension of Answer Set Programming (ASP) to support declarative reasoning on consumption and production of resources. We call the proposed extension ...
Stefania Costantini, Andrea Formisano
JELIA
2010
Springer
9 years 8 months ago
Coala: A Compiler from Action Languages to ASP
Action languages allow for compactly describing dynamic domains. They are usually implemented by compilation, e.g., to Answer Set Programming. To this end, we developed a tool, cal...
Martin Gebser, Torsten Grote, Torsten Schaub
CORR
2010
Springer
133views Education» more  CORR 2010»
9 years 9 months ago
Reformulation of Global Constraints in Answer Set Programming
We show that global constraints on finite domains like alldifferent can be reformulated into answer set programs on which we achieve arc, bound or range consistency. These reform...
Christian Drescher, Toby Walsh
CORR
2002
Springer
187views Education» more  CORR 2002»
9 years 10 months ago
Answer Sets for Consistent Query Answering in Inconsistent Databases
A relational database is inconsistent if it does not satisfy a given set of integrity constraints. Nevertheless, it is likely that most of the data in it is consistent with the co...
Marcelo Arenas, Leopoldo E. Bertossi, Jan Chomicki
AICOM
2006
129views more  AICOM 2006»
9 years 10 months ago
A backjumping technique for Disjunctive Logic Programming
In this work we present a backjumping technique for Disjunctive Logic Programming (DLP) under the Answer Set Semantics. It builds upon related techniques that had originally been p...
Francesco Ricca, Wolfgang Faber, Nicola Leone
CORR
2008
Springer
110views Education» more  CORR 2008»
9 years 10 months ago
Justifications for Logic Programs under Answer Set Semantics
The paper introduces the notion of off-line justification for Answer Set Programming (ASP). Justifications provide a graph-based explanation of the truth value of an atom w.r.t. a ...
Enrico Pontelli, Tran Cao Son, Omar El-Khatib
AAAI
2010
9 years 10 months ago
First-Order Indefinability of Answer Set Programs on Finite Structures
An answer set program with variables is first-order definable on finite structures if the set of its finite answer sets can be captured by a first-order sentence, otherwise this p...
Yin Chen, Yan Zhang, Yi Zhou
AAAI
2006
9 years 11 months ago
Fast SAT-based Answer Set Solver
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS ar...
Zhijun Lin, Yuanlin Zhang, Hector Hernandez
books