648 search results - page 15 / 130 » Using Criticalities as a Heuristic for Answer Set Programmin... |
104
click to vote
LPNMR
2007
Springer
15 years 7 months ago
2007
Springer
We describe a new grounder system for logic programs under answer set semantics, called GrinGo. Our approach combines and extends techniques from the two primary grounding approach...
145
click to vote
JAPLL
2007
15 years 1 months ago
2007
We extend answer set programming (ASP) with, possibly infinite, open domains. Since this leads to undecidable reasoning, we restrict the syntax of programs, while carefully guard...
111
Voted
ICLP
2010
Springer
15 years 5 months ago
2010
Springer
Answer set programs with time predicates are useful to model systems whose properties depend on time, like for example gene regulatory networks. A state of such a system at time po...
110
click to vote
ICLP
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. In recent work, a general framework for specifying program correspondences under the answer-set semantics has been defined. The framework allows to define different not...
134
click to vote
AMAI
2006
Springer
15 years 1 months ago
2006
Springer
In this work, we introduce a new framework able to deal with a reasoning that is at the same time non monotonic and uncertain. In order to take into account a certainty level assoc...