20 search results - page 2 / 4 » QBF Reasoning on Real-World Instances |
JSAT
2006
13 years 5 months ago
2006
This paper reports about the 2005 comparative evaluation of solvers for quantified Boolean formulas (QBFs), the third in a series of non-competitive events established with the ai...
SAT
2004
Springer
13 years 10 months ago
2004
Springer
This paper reports about the 2004 comparative evaluation of solvers for quantified Boolean formulas (QBFs), the second in a series of non-competitive events established with the a...
LICS
2006
IEEE
13 years 11 months ago
2006
IEEE
Treewidth measures the ”tree-likeness” of structures. Many NP-complete problems, e.g., propositional satisfiability, are tractable on bounded-treewidth structures. In this wo...
WISE
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. Approximation has been identified as a potential way of reducing the complexity of logical reasoning. Here we explore approximation for speeding up instance retrieval in...
KSEM
2010
Springer
13 years 3 months ago
2010
Springer
In this paper, we consider the problem of query answering over large multimedia ontologies. Traditional reasoning systems may have problems to deal with large amounts of expressive...