844 search results - page 69 / 169 » Safraless Decision Procedures |
CAV
1999
Springer
14 years 1 months ago
1999
Springer
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
AIML
2008
13 years 10 months ago
2008
In this paper we prove that Japaridze's Polymodal Logic is PSPACE-decidable. To show this, we describe a decision procedure for satisfiability on hereditarily ordered frames t...
AIML
2008
13 years 10 months ago
2008
In this paper we define a many-valued semantics for hybrid logic and we give a sound and complete tableau system which is prooftheoretically well-behaved, in particular, it gives r...
ICFP
2010
ACM
13 years 9 months ago
2010
ACM
Modern proof assistants such as Coq and Isabelle provide high degrees of expressiveness and assurance because they support formal reasoning in higher-order logic and supply explic...
IANDC
2006
13 years 8 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