846 search results - page 1 / 170 » Rewrite-Based Decision Procedures |
CADE
2006
Springer
14 years 8 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 ...
ENTCS
2007
13 years 8 months 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...
ENTCS
2007
13 years 8 months ago
2007
ENTCS
2007
13 years 8 months ago
2007
In this paper we propose a formalization of access control policies based on term rewriting. The state of the system to which policies are enforced is represented as an algebraic ...
ASE
2005
13 years 8 months ago
2005
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...