منابع مشابه
Rewrite-Based Decision Procedures
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 inference system generates finitely many clauses from the presentation T of a theory and a finite set of ground unit clauses, then any fair strategy based on that system can be used as a T -satisfiability procedure. In th...
متن کاملDecidability and Undecidability Results for Nelson-Oppen and Rewrite-Based Decision Procedures
In the context of combinations of theories with disjoint signatures, we classify the component theories according to the decidability of constraint satisfiability problems in arbitrary and in infinite models, respectively. We exhibit a theory T1 such that satisfiability is decidable, but satisfiability in infinite models is undecidable. It follows that satisfiability in T1 ∪ T2 is undecidable, ...
متن کاملRewrite-Based Satisfiability Procedures for Recursive Data Structures
If a rewrite-based inference system is guaranteed to terminate on the axioms of a theory T and any set of ground literals, then any theorem-proving strategy based on that inference system is a rewrite-based decision procedure for T -satisfiability. In this paper, we consider the class of theories defining recursive data structures, that might appear out of reach for this approach, because they ...
متن کاملBDD-Based Decision Procedures for K
Guoqiang Pan1?, Ulrike Sattler2, Moshe Y. Vardi1? 1 Department of Computer Science, Rice University, Houston, TX gqpan,[email protected] 2 Institut für Theoretische Informatik, TU Dresden, Germany [email protected] Abstract. We describe BDD-based decision procedures for K. Our approach is inspired by the automata-theoretic approach, but we avoid explicit automata construction. Our a...
متن کاملTableau-based Decision Procedures for Hybrid Logic
Hybrid logics are a principled generalization of both modal logics and description logics. It is well-known that various hybrid logics without binders are decidable, but decision procedures are usually not based on tableau systems, a kind of formal proof procedure that lends itself towards computer implementation. In this paper we give four different tableaubased decision procedures for a very ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2007
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2006.11.042