1144 search results - page 98 / 229 » Logic programming for combinatorial problems |
120
Voted
JAR
2002
15 years 2 months ago
2002
Satisfiability algorithms for propositional logic have improved enormously in recently years. This improvement increases the attractiveness of satisfiability methods for first-orde...
149
click to vote
CP
2007
Springer
15 years 8 months ago
2007
Springer
While many real-world combinatorial problems can be advantageously modeled and solved using Constraint Programming, scalability remains a major issue in practice. Constraint models...
122
Voted
ECAI
1992
Springer
15 years 6 months ago
1992
Springer
ABSTRACT. This paper investigates the problem of finding subclasses of nonmonotonic reasoning which can be implemented efficiently. The ability to "define" propositions u...
134
click to vote
AMAI
2000
Springer
15 years 2 months ago
2000
Springer
This is a prospective on the research in the intersection of mathematics and artificial intelligence that I see as having been the most important over the past 10 years and that I...
107
Voted
CD
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. The secure deployment of components is widely recognized as a crucial problem in component-based software engineering. While major effort is concentrated on preventing ma...