4617 search results - page 544 / 924 » Automation of Diagrammatic Reasoning |
200
click to vote
CADE
2008
Springer
16 years 8 months ago
2008
Springer
Abstract. In this paper we describe a new tool for performing KnuthBendix completion with automatic termination tools. It is based on two ingredients: (1) the inference system for ...
210
click to vote
CADE
2008
Springer
16 years 8 months ago
2008
Springer
We present a novel proof of Toyama's famous modularity of confluence result for term rewriting systems. Apart from being short and intuitive, the proof is modular itself in th...
171
click to vote
CADE
2008
Springer
16 years 8 months ago
2008
Springer
Abstract. We present randoCoP, a theorem prover for classical firstorder logic, which integrates randomized search techniques into the connection prover leanCoP 2.0. By randomly re...
182
click to vote
CADE
2008
Springer
16 years 8 months ago
2008
Springer
We describe a framework with which first order theorem provers can be used for checking formal proofs. The main aim of the framework is to take as much advantage as possible from t...
271
click to vote
CADE
2008
Springer
16 years 8 months ago
2008
Springer
Many safety- and security-critical systems are real-time systems and, as a result, tools and techniques for verifying real-time systems are extremely important. Simulation and test...