536 search results - page 25 / 108 » A Translational Approach to Constraint Answer Set Solving |
117
click to vote
ESA
2006
Springer
15 years 5 months ago
2006
Springer
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happ...
109
Voted
FM
2009
Springer
15 years 8 months ago
2009
Springer
We present a novel approach to optimize scope-bounded checking programs using a relational constraint solver. Given a program and its correctness specification, the traditional app...
118
click to vote
AIPS
2011
14 years 5 months ago
2011
Conformant planning can be formulated as a path-finding problem in belief space where the two main challenges are the heuristics to guide the search, and the representation and u...
130
click to vote
LPNMR
2001
Springer
15 years 6 months ago
2001
Springer
Abstract This paper describes a generic compiler, called plp, for translating ordered logic programs into standard logic programs under the answer set semantics. In an ordered logi...
102
click to vote
CCCG
1996
15 years 3 months ago
1996
We present a heuristic approach to the geometric motion planning problem with the aim to quickly solve intuitively simple problems. It is based on a divide-and-conquer path search...