CADE
2002
Springer
14 years 12 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
2002
Springer
14 years 12 months ago
2002
Springer
Modularity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 46 Michael Abbott, Neil Ghani, and Christoph L?uth Union of Equational Theo...
CADE
2002
Springer
14 years 12 months ago
2002
Springer
Abstract. Description Logics are a family of class based knowledge representation formalisms characterised by the use of various constructors to build complex classes from simpler ...
CADE
2002
Springer
14 years 12 months ago
2002
Springer
We show that a conjunctive normal form (CNF) formula F is unsatisfiable iff there is a set of points of the Boolean space that is stable with respect to F. So testing the satisfiab...
CADE
2002
Springer
14 years 12 months ago
2002
Springer
CADE
2002
Springer
14 years 12 months ago
2002
Springer
In this paper we define a new clausal class, called BU, which can be decided by hyperresolution with splitting. We also consider the model generation problem for BU and show that h...
CADE
2002
Springer
14 years 12 months ago
2002
Springer
Decision procedures for combinations of theories are at the core of many modern theorem provers such as ACL2, Ehdm, PVS, SIMPLIFY, the Stanford Pascal Verifier, STeP, SVC, and Z/Ev...
CADE
2002
Springer
14 years 12 months ago
2002
Springer
CADE
2002
Springer
14 years 12 months ago
2002
Springer
Abstract. Finite model search for first-order logic theories is complementary to theorem proving. Systems like Falcon, SEM and FMSET use the known LNH (Least Number Heuristic) heur...
CADE
2002
Springer
14 years 12 months ago
2002
Springer
