182 search results - page 9 / 37 » Reformulation of Global Constraints in Answer Set Programmin... |
230
Voted
ICLP
2009
Springer
16 years 4 months ago
2009
Springer
This paper considers a semantic approach for merging logic programs under answer set semantics. Given logic programs P1, . . . , Pn, the goal is to provide characterisations of the...
148
Voted
SIAMJO
2000
15 years 3 months ago
2000
Mathematical programs with nonlinear complementarity constraints are reformulated using better-posed but nonsmooth constraints. We introduce a class of functions, parameterized by...
179
Voted
AGP
2003
IEEE
15 years 9 months ago
2003
IEEE
The paper discusses some innovative aspects related to the integration of a framework based on Answer Set Programming in an Information Retrieval Agent, namely, the Global Search A...
128
Voted
AAAI
2008
15 years 6 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...
120
Voted
AAAI
2008
15 years 6 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...