CADE
2003
Springer
14 years 12 months ago
2003
Springer
The DPLL procedure is the basis of some of the most successful propositional satisfiability solvers to date. Although originally devised as a proofprocedure for first-order logic, ...
CADE
2004
Springer
14 years 12 months ago
2004
Springer
LRR [3] is a rewriting system developed at the Computer Science Department of University of Houston. LRR has two subsystems: Smaran (for tabled rewriting), and TGR (for untabled re...
CADE
2004
Springer
14 years 12 months ago
2004
Springer
CADE
2004
Springer
14 years 12 months ago
2004
Springer
CADE
2004
Springer
14 years 12 months ago
2004
Springer
ended abstract motivates and presents techniques for identifying variable independence in free variable calculi for classical logic without equality. Two variables are called indep...
CADE
2004
Springer
14 years 12 months ago
2004
Springer
CADE
2004
Springer
14 years 12 months ago
2004
Springer
This paper is concerned with the integration of recursive data structures with Presburger arithmetic. The integrated theory includes a length function on data structures, thus prov...
CADE
2004
Springer
14 years 12 months ago
2004
Springer
This paper presents the Dr.Doodle system, an interactive theorem prover that uses diagrammatic representations. The assumption underlying this project is that, for some domains (pr...
CADE
2004
Springer
14 years 12 months ago
2004
Springer
The CADE ATP System Competition (CASC) is an annual evaluation of fully automatic, first-order Automated Theorem Proving systems. CASC-18 was the seventh competition in the CASC se...
CADE
2004
Springer
14 years 12 months ago
2004
Springer
Abstract. Automated tools for finding attacks on flawed security protocols often struggle to deal with protocols for group key agreement. Systems designed for fixed 2 or 3 party pr...