233 search results - page 3 / 47 » Efficient Combination of Decision Procedures for MUS Computa... |
AIML
1998
13 years 7 months ago
1998
Abstract. This paper presents a resolution decision procedure for transitive propositional modal logics. The procedure combines the relational translation method with an ordered ch...
TIME
2007
IEEE
14 years 16 days ago
2007
IEEE
We present a symbolic algorithm for deciding safety (reachability) of timed systems modelled as Timed Automata (TA), under the notion of robustness w.r.t. infinitesimal clock-drif...
CTRS
1990
13 years 10 months ago
1990
Completion procedures, originated from the seminal work of Knuth and Bendix, are wellknown as procedures for generating confluent rewrite systems, i.e. decision procedures for al ...
DAC
2003
ACM
14 years 7 months ago
2003
ACM
SAT-based decision procedures for quantifier-free fragments of firstorder logic have proved to be useful in formal verification. These decision procedures are either based on enco...
IANDC
2006
13 years 6 months ago
2006
Many approaches to deciding the satisfiability of quantifier free formulae with respect to a background theory T -- also known as Satisfiability Modulo Theory, or SMT