1144 search results - page 67 / 229 » Logic programming for combinatorial problems |
132
Voted
APIN
2000
15 years 2 months ago
2000
Defeasible logic is a system of reasoning in which rules have exceptions, and when rules conflict, the one that applies most specifically to the situation wins out. This paper repo...
128
Voted
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
Cooperative coevolution has proven to be a promising technique for solving complex combinatorial optimization problems. In this paper, we present four different strategies which i...
129
click to vote
ISMVL
2000
IEEE
15 years 6 months ago
2000
IEEE
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
116
click to vote
PPDP
2010
Springer
15 years 7 days ago
2010
Springer
Transaction Logic is a logic for representing declarative and procedural knowledge in logic programming, databases, and AI. It has been successful in areas as diverse as workflows...
101
click to vote
ISAAC
1992
Springer
15 years 6 months ago
1992
Springer
In the multilevel generalized assignment problem (MGAP) agents can perform tasks at more than one efficiency level. Important manufacturing problems, such as lot sizing, can be ea...