159 search results - page 11 / 32 » On the Complexity of SAT |
LPAR
2010
Springer
14 years 7 months ago
2010
Springer
Unification in Description Logics has been proposed as a novel inference service that can, for example, be used to detect redundancies in ontologies. In a recent paper, we have sho...
JSAT
2008
14 years 9 months ago
2008
We show how to exploit the 32/64 bit architecture of modern computers to accelerate some of the algorithms used in satisfiability solving by modifying assignments to variables in ...
86
Voted
DCC
2008
IEEE
15 years 9 months ago
2008
IEEE
A system of algebraic equations over a finite field is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an unde...
SAT
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we consider the class of boolean formulas in Conjunctive Normal Form (CNF) where for each variable all but at most d occurrences are either positive or negative. This...
PPDP
2009
Springer
15 years 4 months ago
2009
Springer
This paper describes the encoding of a telecommunications feature subscription configuration problem to propositional logic and its solution using a state-of-the-art Boolean sati...