Sciweavers

9 search results - page 2 / 2
» Haplotype Inference with Boolean Constraint Solving: An Over...
Sort
View
JSAT
2006
134views more  JSAT 2006»
13 years 5 months ago
Pueblo: A Hybrid Pseudo-Boolean SAT Solver
This paper introduces a new hybrid method for efficiently integrating Pseudo-Boolean (PB) constraints into generic SAT solvers in order to solve PB satisfiability and optimization...
Hossein M. Sheini, Karem A. Sakallah
CP
2010
Springer
13 years 4 months ago
Local Consistency and SAT-Solvers
In this paper we show that the power of using k-consistency techniques in a constraint problem is precisely captured by using a particular inference rule, which we call positive-hy...
Justyna Petke, Peter Jeavons
FOCS
1998
IEEE
13 years 10 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello
ICWS
2008
IEEE
13 years 7 months ago
A Theory of Role Composition
We study the access control integration problem for web services. Organizations frequently use many services, each with its own access control policies, that must interoperate whi...
Jeffrey Fischer, Rupak Majumdar