2585 search results - page 424 / 517 » Automating Coherent Logic |
145
click to vote
CADE
2007
Springer
16 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...
131
click to vote
CADE
2007
Springer
16 years 5 months ago
2007
Springer
Much research concerning Satisfiability Modulo Theories is devoted to the design of efficient SMT-solvers that integrate a SATsolver with T -satisfiability procedures. The rewrite-...
120
click to vote
CADE
2007
Springer
16 years 5 months ago
2007
Springer
We present a method for proving rigid first order theorems by encoding them as propositional satisfiability problems. We encode the existence of a first order connection tableau an...
150
click to vote
CADE
2007
Springer
16 years 5 months ago
2007
Springer
Continuous probability distributions are widely used to mathematically describe random phenomena in engineering and physical sciences. In this paper, we present a methodology that ...
142
click to vote
CADE
2007
Springer
16 years 5 months ago
2007
Springer
This paper combines predictive labeling with dependency pairs and reports on its implementation. Our starting point is the method of proving termination of rewrite systems using se...