846 search results - page 126 / 170 » Rewrite-Based Decision Procedures |
185
click to vote
CADE
2005
Springer
16 years 5 months ago
2005
Springer
Two kinds of orderings are widely used in term rewriting and theorem proving, namely recursive path ordering (RPO) and Knuth-Bendix ordering (KBO). They provide powerful tools to p...
157
click to vote
CADE
2004
Springer
16 years 5 months ago
2004
Springer
Abstract. Classifying finite algebraic structures has been a major motivation behind much research in pure mathematics. Automated techniques have aided in this process, but this ha...
135
click to vote
PODS
2007
ACM
16 years 5 months ago
2007
ACM
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
146
click to vote
VMCAI
2010
Springer
16 years 2 months ago
2010
Springer
Tracking subset relations between the contents containers on the heap is fundamental to modeling the semantics of many common programing idioms such as applying a function to a sub...
148
click to vote
ICCAD
2006
IEEE
16 years 2 months ago
2006
IEEE
Abstract— Design variability due to within-die and die-todie process variations has the potential to significantly reduce the maximum operating frequency and the effective yield...