31 search results - page 4 / 7 » An Integrated Approach for Combining BDD and SAT Provers |
AMAI
2005
Springer
13 years 10 months ago
2005
Springer
Mediator systems integrate distributed, heterogeneous and autonomous data sources, but their e ective use requires the solution of hard query optimization problems. This is usuall...
CADE
2011
Springer
12 years 11 months ago
2011
Springer
Deduction modulo is a generic framework to describe proofs in a theory better than using raw axioms. This is done by presenting the theory through rules rewriting terms and proposi...
CADE
2002
Springer
14 years 11 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
CADE
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. The LogAnswer system is an application of automated reasoning to the field of open domain question-answering, the retrieval of answers to natural language questions regar...
LPAR
2004
Springer
14 years 4 months ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated termination proofs of term rewrite systems. Up to now, it was regarded as one of several possible ...