1144 search results - page 61 / 229 » Logic programming for combinatorial problems |
133
click to vote
CP
2009
Springer
15 years 9 months ago
2009
Springer
The problem of finding a collection of solutions to a combinatorial problem that is optimal in terms of an inter-solution objective function exists in many application settings. F...
122
click to vote
LPNMR
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We consider the problem of whether a given preferred answer set program can be reduced to a propositional formula. Research on this topic is of both theoretical and pract...
139
click to vote
ENTCS
2002
15 years 2 months ago
2002
We present a declarative debugger for lazy functional logic programs with polymorphic type discipline. Whenever a computed answer is considered wrong by the user (error symptom), ...
114
click to vote
NHM
2010
14 years 9 months ago
2010
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
120
click to vote
RC
2002
15 years 1 months ago
2002
Existing interval constraint logic programming languages, such as BNR Prolog, work under the framework of interval narrowing and are deficient in solving systems of linear constrai...