3119 search results - page 379 / 624 » General Default Logic |
320
click to vote
ICFP
2009
ACM
16 years 7 months ago
2009
ACM
GADTs have proven to be an invaluable language extension, a.o. for ensuring data invariants and program correctness. Unfortunately, they pose a tough problem for type inference: w...
168
click to vote
CADE
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. We give a method for modular generation of ground interpolants in modern SMT solvers supporting multiple theories. Our method uses a novel algorithm to modify the proof t...
188
click to vote
CADE
2009
Springer
16 years 7 months ago
2009
Springer
We present a new calculus for first-order theorem proving with equality, ME+Sup, which generalizes both the Superposition calculus and the Model Evolution calculus (with equality)...
141
click to vote
CADE
2007
Springer
16 years 7 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...
161
click to vote
CADE
2006
Springer
16 years 7 months ago
2006
Springer
This paper presents new classes of tree automata combining automata with equality test and automata modulo equational theories. We believe that these classes have a good potential ...