1144 search results - page 154 / 229 » Logic programming for combinatorial problems |
DAGSTUHL
2006
15 years 3 months ago
2006
This paper applies a mix of aspect-oriented programming (AOP) and logic meta-programming (LMP) to tackle some concerns of/in legacy environments. We present four different problem...
108
Voted
CP
2007
Springer
15 years 8 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...
111
click to vote
ICLP
1991
Springer
15 years 6 months ago
1991
Springer
Well Founded Semantics is adequate to capture nonmonotonic reasoning if we interpret the Well Founded model of a program P as a (possibly incomplete) view of the world. Thus the W...
133
click to vote
IJCAI
1997
15 years 3 months ago
1997
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
94
Voted
FOSSACS
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Logics that can reason about sets and their cardinality bounds are useful in program analysis, program verification, databases, and knowledge bases. This paper presents ...