189 search results - page 4 / 38 » Similarity-Guided Clause Generalization |
65
Voted
STACS
2010
Springer
15 years 4 months ago
2010
Springer
We call a CNF formula linear if any two clauses have at most one variable in common. We show that there exist unsatisfiable linear k-CNF formulas with at most 4k2 4k clauses, and ...
ESOP
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We present a generic algorithm for solving Horn clauses through iterative specialisation. The algorithm is generic in the sense that it can be instantiated with any decid...
NMR
2004
Springer
15 years 2 months ago
2004
Springer
Current literature offers a number of different approaches to what could generally be called “probabilistic logic programming”. These are usually based on Horn clauses. Here, ...
ESOP
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. It is well-known that context-independent control flow analysis can be performed in cubic time for functional and object-oriented languages. Yet recent applications of c...
AMAI
2002
Springer
14 years 9 months ago
2002
Springer
The technique of watching two literals per clause to determine when a clause becomes a unit clause was introduced recently in the Chaff satisfiability program. That program does n...