4978 search results - page 899 / 996 » Logical models of argument |
149
click to vote
CADE
2008
Springer
16 years 4 months ago
2008
Springer
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
153
click to vote
CADE
2007
Springer
16 years 4 months ago
2007
Springer
Safety and security guarantees for individual applications in general depend on assumptions on the given context provided by distributed instances of operating systems, hardware pl...
128
click to vote
CADE
2006
Springer
16 years 4 months ago
2006
Springer
Linear arithmetic decision procedures form an important part of theorem provers for program verification. In most verification benchmarks, the linear arithmetic constraints are dom...
137
click to vote
CADE
2006
Springer
16 years 4 months ago
2006
Springer
Abstract. We extend our previous study of the automatic construction of isomorphic classification theorems for algebraic domains by considering the isotopy equivalence relation. Is...
135
click to vote
CADE
2001
Springer
16 years 4 months ago
2001
Springer
Context trees are a popular and effective tool for tasks such as compression, sequential prediction, and language modeling. We present an algebraic perspective of context trees for...