113 search results - page 9 / 23 » Reduction Strategies for Left-Linear Term Rewriting Systems |
99
Voted
ENTCS
2007
15 years 9 days ago
2007
The rewrite-based approach to satisfiability modulo theories consists of using generic theorem-proving strategies for first-order logic with equality. If one can prove that an i...
98
Voted
RTA
1995
Springer
15 years 3 months ago
1995
Springer
We use computational systems to express a completion with constraints procedure that gives priority to simplifications. Computational systems are rewrite theories enriched by stra...
106
click to vote
LPAR
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. We present a novel way for reasoning about (possibly ir)rational quantifier-free non-linear arithmetic by a reduction to SAT/SMT. The approach is incomplete and dedicated...
CORR
2010
Springer
15 years 13 days ago
2010
Springer
This paper presents a complex systems overview of a power grid network under cascading conditions. The cascading effect has been simulated on three different networks, the IEEE 300...
102
Voted
IFIP
2004
Springer
15 years 5 months ago
2004
Springer
A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtai...