194 search results - page 13 / 39 » Tabular Constraint-Satisfaction Problems and Answer Set Prog... |
108
click to vote
KR
2010
Springer
15 years 4 months ago
2010
Springer
Cardinality constraints or, more generally, weight constraints are well recognized as an important extension of answer-set programming. Clearly, all common algorithmic tasks relat...
142
click to vote
JELIA
2010
Springer
14 years 10 months ago
2010
Springer
In this paper, we show that Reiter’s default logic in the propositional case can be translated into answer set programming by identifying the internal relationships among formula...
179
click to vote
ASP
2005
Springer
15 years 5 months ago
2005
Springer
Preferences are useful when the space of feasible solutions of a given problem is dense but not all these solutions are equivalent w.r.t. some additional requirements. In this case...
LPNMR
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. In answer-set programming (ASP), the main focus usually is on computing answer sets which correspond to solutions to the problem represented by a logic program. Simple re...
100
click to vote
ICLP
2010
Springer
15 years 3 months ago
2010
Springer
Answer set programming is a form of declarative programming that has proven very successful in succinctly formulating and solving complex problems. Although mechanisms for represen...