3776 search results - page 549 / 756 » Partition-Based Logical Reasoning |
CADE
2008
Springer
14 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 ...
CADE
2008
Springer
14 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...
CADE
2008
Springer
14 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...
CADE
2008
Springer
14 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...
CADE
2007
Springer
14 years 8 months ago
2007
Springer
Abstract. In most theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equ...