BibTeX
@MISC{Kupferman05safralessdecision,
author = {Orna Kupferman and Moshe Y. Vardi},
title = {Safraless Decision Procedures},
year = {2005}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
The automata-theoretic approach is one of the most fundamental approaches to developing decision procedures in mathematical logics. To decide whether a formula in a logic with the tree-model property is satisfiable, one constructs an automaton that accepts all (or enough) tree models of the formula and then checks that the language of this automaton is nonempty. The standard approach translates formulas into alternating parity tree automata, which are then translated, via Safra's determinization construction, into nondeterministic parity automata. This approach is not amenable to implementation because of the difficulty of implementing Safra's construction and the nonemptiness test for nondeterministic parity tree automata. In this
Keyphrases
safraless decision procedure decision procedure standard approach automata-theoretic approach nondeterministic parity automaton nondeterministic parity tree automaton nonemptiness test tree-model property determinization construction parity tree automaton fundamental approach mathematical logic
