579 search results - page 78 / 116 » Combined reasoning by automated cooperation |
CSL
2005
Springer
14 years 2 months ago
2005
Springer
Since Val Tannen's pioneering work on the combination of simply-typed λ-calculus and rst-order rewriting [11], many authors have contributed to this subject by extending it ...
ICLP
2011
Springer
13 years 7 days ago
2011
Springer
Transaction Logic is an extension of classical logic that gracefully integrates both declarative and procedural knowledge and has proved itself as a powerful formalism for many ad...
CADE
2004
Springer
14 years 9 months ago
2004
Springer
contexts such as construction of abstractions, speed may be favored over completeness, so that undecidable theories (e.g., nonlinear integer arithmetic) and those whose decision pr...
CADE
2006
Springer
14 years 9 months ago
2006
Springer
Abstract. In the context of combinations of theories with disjoint signatures, we classify the component theories according to the decidability of constraint satisability problems ...
CADE
2006
Springer
14 years 9 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...