Sciweavers

1144 search results - page 11 / 229
» Logic programming for combinatorial problems
Sort
View
DAGSTUHL
2008
13 years 9 months ago
Dualities for Constraint Satisfaction Problems
In a nutshell, a duality for a constraint satisfaction problem equates the existence of one homomorphism to the non-existence of other homomorphisms. In this survey paper, we give ...
Andrei A. Bulatov, Andrei A. Krokhin, Benoit Laros...
SAC
2009
ACM
14 years 2 months ago
The sum-of-increments constraint in the consecutive-ones matrix decomposition problem
The combinatorial problem of decomposing an integer matrix into a small positive linear combination of binary matrices that have the consecutive-ones property arises in cancer rad...
Sebastian Brand
ECP
1997
Springer
130views Robotics» more  ECP 1997»
13 years 11 months ago
Encoding Planning Problems in Nonmonotonic Logic Programs
We present a framework for encoding planning problems in logic programs with negation as failure, having computational e ciency as our major consideration. In order to accomplish o...
Yannis Dimopoulos, Bernhard Nebel, Jana Koehler
ILP
2005
Springer
14 years 1 months ago
Learning Teleoreactive Logic Programs from Problem Solving
In this paper, we focus on the problem of learning reactive skills for use by physical agents. We propose a new representation for such procedures, teleoreactive logic programs, al...
Dongkyu Choi, Pat Langley
ICWL
2007
Springer
14 years 1 months ago
Using Constraint-Based Modelling to Describe the Solution Space of Ill-defined Problems in Logic Programming
Intelligent Tutoring Systems have made great strides in recent years. Many of these gains have been achieved for welldefined problems. However, solving ill-defined problems is imp...
Nguyen-Thinh Le, Wolfgang Menzel