Solving parity games by a reduction to SAT (Q414902): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of mean payoff games on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On model checking for the \(\mu\)-calculus and its fragments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes on finite asynchronous automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754084 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Nonterminating Stochastic Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A subexponential randomized algorithm for the simple stochastic game problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4540974 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tableau-based model checking in the propositional mu-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic model checking: \(10^{20}\) states and beyond / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast and simple nested fixpoints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic subexponential algorithm for solving parity games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded model checking using satisfiability solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification of Timed Automata via Satisfiability Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving parity games by a reduction to SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending and implementing the stable model semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2848673 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Encodings of Bounded LTL Model Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Model Checking for Weak Alternating Büchi Automata / rank
 
Normal rank

Latest revision as of 05:16, 5 July 2024

scientific article
Language Label Description Also known as
English
Solving parity games by a reduction to SAT
scientific article

    Statements

    Solving parity games by a reduction to SAT (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 May 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    parity games
    0 references
    propositional satisfiability
    0 references
    difference logic
    0 references
    0 references