60 search results - page 5 / 12 » Answer Set Programming with Constraints Using Lazy Grounding |
124
click to vote
AI
2004
Springer
14 years 11 months ago
2004
Springer
We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by addin...
114
click to vote
PADL
2005
Springer
15 years 5 months ago
2005
Springer
We describe the reconstruction of a phylogeny for a set of taxa, with a character-based cladistics approach, in a declarative knowledge representation formalism, and show how to us...
AAAI
2008
15 years 2 months ago
2008
The paper presents a calculus based on resolution for credulous reasoning in Answer Set Programming. The new approach allows a top-down and goal directed resolution, in the same s...
AAAI
2008
15 years 2 months ago
2008
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...
90
Voted
ICLP
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We provide a general and modular framework for describing inferences in Answer Set Programming (ASP) that aims at an easy incorporation of additional language constructs....