Sciweavers

4513 search results - page 18 / 903
» Logic programming with satisfiability
Sort
View
CORR
2004
Springer
123views Education» more  CORR 2004»
13 years 10 months ago
Light types for polynomial time computation in lambda-calculus
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
Patrick Baillot, Kazushige Terui
IPL
2008
111views more  IPL 2008»
13 years 11 months ago
Adding cardinality constraints to integer programs with applications to maximum satisfiability
Max-SAT-CC is the following optimization problem: Given a formula in CNF and a bound k, find an assignment with at most k variables being set to true that maximizes the number of ...
Markus Bläser, Thomas Heynen, Bodo Manthey
CSUR
2006
52views more  CSUR 2006»
13 years 11 months ago
Propositional Satisfiability and Constraint Programming: A comparative survey
Lucas Bordeaux, Youssef Hamadi, Lintao Zhang