15754 search results - page 2758 / 3151 » Programs are Knowledge Bases |
187
click to vote
CP
2007
Springer
16 years 1 months ago
2007
Springer
It is known that Constraint Satisfaction Problems (CSP) can be converted into Boolean Satisfiability problems (SAT); however how to encode a CSP into a SAT problem such that a SAT...
188
click to vote
CP
2007
Springer
16 years 1 months ago
2007
Springer
: This report introduces a geometrical constraint kernel for handling the location in space and time of polymorphic k-dimensional objects subject to various geometrical and time co...
145
click to vote
CP
2007
Springer
16 years 1 months ago
2007
Springer
In this paper we present new techniques for improving backtracking based Quantified Constraint Satisfaction Problem (QCSP) solvers. QCSP is a generalization of CSP in which variab...
186
click to vote
CSL
2007
Springer
16 years 1 months ago
2007
Springer
Normal form bisimulation is a powerful theory of program equivalence, originally developed to characterize L´evy-Longo tree equivalence and Boehm tree equivalence. It has been ada...
219
click to vote
DEXA
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Sequence alignment is an important task for molecular biologists. Because alignment basically deals with approximate string matching on large biological sequence collecti...