1144 search results - page 45 / 229 » Logic programming for combinatorial problems |
COR
2006
13 years 7 months ago
2006
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...
ISMB
1994
13 years 9 months ago
1994
Thispaperdescribesthe applicationof the Inductive Logic Programming0LP) program GOLEMto the discoveryof constraintsin the packingof beta-sheets in alpha/betaproteins. Theseconstra...
ASP
2005
Springer
14 years 1 months ago
2005
Springer
This paper studies compositional semantics of nonmonotonic logic programs. We suppose the answer set semantics of extended disjunctive programs and consider the following problem. ...
JMLR
2006
13 years 7 months ago
2006
We present a simple and scalable algorithm for maximum-margin estimation of structured output models, including an important class of Markov networks and combinatorial models. We ...
CSUR
2000
13 years 7 months ago
2000
: Constraint satisfaction programming (CSP) is a powerful paradigm for solving complex combinatorial problems, which has gained a lot of attention recently. Putting the power of co...