1749 search results - page 87 / 350 » Logic, Optimization, and Constraint Programming |
151
click to vote
CONSTRAINTS
2008
15 years 3 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
135
click to vote
ILP
2005
Springer
15 years 8 months ago
2005
Springer
Recursive loops in a logic program present a challenging problem to the PLP framework. On the one hand, they loop forever so that the PLP backward-chaining inferences would never s...
109
Voted
ICLP
2007
Springer
15 years 9 months ago
2007
Springer
We propose a novel technique that maps decision problems in WS1S (weak monadic second-order logic with n successors) to the problem of query evaluation of Complex-value Datalog que...
147
click to vote
CORR
2010
Springer
15 years 17 days ago
2010
Springer
The paradigm of Tabled Logic Programming (TLP) is now supported by a number of Prolog systems, including XSB, YAP Prolog, B-Prolog, Mercury, ALS, and Ciao. The reasons for this ar...
135
click to vote
SAS
2001
Springer
15 years 7 months ago
2001
Springer
We present the implementation of cTI, a system for universal left-termination inference of logic programs, which heavily relies on static analysis techniques. Termination inference...