CADE
2007
Springer
14 years 5 months ago
2007
Springer
CADE
2007
Springer
14 years 5 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...
CADE
2007
Springer
14 years 5 months ago
2007
Springer
CADE
2007
Springer
14 years 5 months ago
2007
Springer
CADE
2007
Springer
14 years 5 months ago
2007
Springer
CADE
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. Automata-based decision procedures commonly achieve optimal complexity bounds. However, in practice, they are often outperformed by sub-optimal (but more local-search bas...
CADE
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. This paper presents the foundations for using automated deduction technology in static program analysis. The central principle is the use of logical lattices ? a class of...
CADE
2007
Springer
14 years 5 months ago
2007
Springer
This paper describes the design, implementation, and testing of a system for selecting necessary axioms from a large set also containing superfluous axioms, to obtain a proof of a...
CADE
2007
Springer
14 years 5 months ago
2007
Springer
We present an encoding that is able to specify LTL bounded model checking problems within the Bernays-Sch?onfinkel fragment of first-order logic. This fragment, which also correspo...
CADE
2007
Springer
14 years 5 months ago
2007
Springer
We present a novel reasoning calculus for Description Logics (DLs)--knowledge representation formalisms with applications in areas such as the Semantic Web. In order to reduce the ...