149 search results - page 13 / 30 » Encoding Planning Problems in Nonmonotonic Logic Programs |
112
click to vote
SARA
2009
Springer
15 years 9 months ago
2009
Springer
Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction Problems (CSPs). However, formulating effective cons...
103
Voted
AIPS
2008
15 years 4 months ago
2008
When controlling an autonomous system, it is inefficient or sometimes impossible for the human operator to specify detailed commands. Instead, the field of AI autonomy has develop...
144
click to vote
ASP
2003
Springer
15 years 7 months ago
2003
Springer
Disjunctive Logic Programming (DLP) is an advanced formalism for Knowledge Representation and Reasoning (KRR). DLP is very expressive in a precise mathematical sense: it allows to ...
130
click to vote
IOR
2007
15 years 2 months ago
2007
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
140
click to vote
CPAIOR
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Logic-based Benders decomposition can combine mixed integer programming and constraint programming to solve planning and scheduling problems much faster than either metho...