16 search results - page 2 / 4 » On the Boolean Connectivity Problem for Horn Relations |
SAT
2007
Springer
14 years 2 days ago
2007
Springer
In this paper a new circuit sat based encoding of boolean formula is proposed. It makes an original use of the concept of restrictive models introduced by Boufkhad to polynomially ...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
We study the one-way number-on-the-forehead (NOF) communication complexity of the k-layer pointer jumping problem with n vertices per layer. This classic problem, which has connec...
LPAR
2001
Springer
13 years 10 months ago
2001
Springer
Several logic-based languages, such as Prolog II and its successors, SICStus Prolog and Oz, offer a computation domain including rational trees. Infinite rational trees allow fo...
ICCS
2007
Springer
14 years 3 days ago
2007
Springer
Abstract. Previous work of the authors has studied a notion of implication between sets of sequences based on the conceptual structure of a Galois lattice, and also a way of repres...
CADE
2009
Springer
14 years 23 days ago
2009
Springer
predicate abstraction Shuvendu K. Lahiri and Shaz Qadeer Microsoft Research In this paper, we investigate the asymptotic complexity of various predicate abstraction problems relati...