Publisher Summary The past few years have seen enormous progress in the performance of
Boolean satisfiability (SAT) solvers. Despite the worst-case exponential run time of all known …

Handbook of Knowledge Representation describes the essential foundations of Knowledge
Representation, which lies at the core of Artificial Intelligence (AI). The book provides an up …

This article puts forward the application of Counterexample Guided Abstraction Refinement
(CEGAR) in solving the well-known PSPACE-complete problem of quantified Boolean …

Many automatic testing, analysis, and verification techniques for programs can be effectively
reduced to a constraint generation phase followed by a constraint-solving phase. This …

The development of computing machines found great success in the last decades. But the
ongoing miniaturization of integrated circuits will reach its limits in the near future. Shrinking …

Robustness and correctness are essential criteria for SAT and QBF solvers. We develop
automated testing and debugging techniques designed and optimized for SAT and QBF …

We develop a formal framework for comparing different versions of ontologies, and apply it
to ontologies formulated in terms of DL-Lite, a family of 'lightweight'description logics …

The famous archetypical NP-complete problem of Boolean satisfiability (SAT) and its
PSPACE-complete generalization of quantified Boolean satisfiability (QSAT) have become …

In this paper we study the problem of engineering a robust solver for quantified Boolean
formulas (QBFs), ie, a tool that can efficiently solve formulas across different problem …

Quantified Boolean formula (QBF) evaluation has a broad range of applications in computer
science and is gaining increasing attention. Recent progress has shown that for a certain …