151 search results - page 30 / 31 » Propagation in CSP and SAT |
ICTAI
2009
IEEE
14 years 2 months ago
2009
IEEE
In this paper an original dynamic partition of formulae in Conjunctive Normal Form (CNF) is presented. It is based on the autarky concept first introduced by Monien and Speckenme...
ICTAI
2007
IEEE
14 years 1 months ago
2007
IEEE
Lookahead is a well-known constraint propagation technique for DPLL-based SAT and answer set solvers. Despite its space pruning power, it can also slow down the search, due to its...
AAAI
2006
13 years 9 months ago
2006
Reasoning with both probabilistic and deterministic dependencies is important for many real-world problems, and in particular for the emerging field of statistical relational lear...
JAR
2011
13 years 2 months ago
2011
We consider optimization problems of the form (S, cost), where S is a clause set over Boolean variables x1 . . . xn, with an arbitrary cost function cost: Bn → R, and the aim is ...
BMCBI
2008
13 years 7 months ago
2008
Background: Graphs and networks are common analysis representations for biological systems. Many traditional graph algorithms such as k-clique, k-coloring, and subgraph matching h...