14 search results - page 2 / 3 » On the Combination of Congruence Closure and Completion |
JCC
2006
13 years 5 months ago
2006
: This article describes a method for solving the geometric closure problem for simplified models of nucleic acid structures by using the constant bond lengths approximation. The r...
FOSSACS
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We introduce an extension of Hoare logic for call-by-value higherorder functions with ML-like local reference generation. Local references may be generated dynamically an...
SIGMOD
2009
ACM
14 years 5 months ago
2009
ACM
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
CADE
2009
Springer
14 years 6 months ago
2009
Springer
The dependency pair framework is a powerful technique for proving termination of rewrite systems. One of the most frequently used methods within the dependency pair framework is t...
LPNMR
1990
Springer
13 years 9 months ago
1990
Springer
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...