Q4625701 (Q4625701): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q235698
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Richard Mayr / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SPIN / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LTL2BA / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Antichains / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: TaPAS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: libVATA / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space Complexity in Propositional Calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Simulation Meets Antichains / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Unification of QBF Resolution-Based Calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2954985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5270089 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Are Short Proofs Narrow? QBF Resolution Is <i>Not</i> So Simple / rank
 
Normal rank
Property / cites work
 
Property / cites work: Understanding cutting planes for QBFs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Game Characterisation of Tree-like Q-resolution Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of tree-like resolution size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random CNF's are hard for the polynomial calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unified QBF certification and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: SAT-Based Synthesis Methods for Safety Specs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Testing and Debugging of SAT and QBF Solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3620436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multipebble Simulations for Alternating Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Understanding Gentzen and Frege Systems for QBF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards NP-P via proof complexity and search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short proofs are narrow—resolution made simple / rank
 
Normal rank
Property / cites work
 
Property / cites work: QBF Resolution Systems and Their Proof Complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antichain Algorithms for Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of cutting-plane proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact location of the phase transition for random (1,2)-QSAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228469 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3457218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Büchi Complementation and Size-Change Termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Büchi Universality Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5306365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative efficiency of propositional proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new upper bound for 3-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4804928 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random 2-SAT: Results and problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Stronger Calculi for QBFs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conformant planning as a case study of incremental QBF solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long-Distance Resolution: Proof Generation and Strategy Extraction in Search-Based QBF Solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contributions to the Theory of Practical Quantified Boolean Formula Solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4994951 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold for unsatisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: What are Strategies in Delay Games? Borel Determinacy for Games with Lookahead / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expansion-based QBF solving versus Q-resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: The size-change principle for program termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: TaPAS: The Talence Presburger Arithmetic Suite / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability Results on the Existence of Lookahead Delegators for NFA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q-Resolution with Generalized Axioms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluating and certifying QBFs: A comparison of state-of-the-art tools / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952609 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long Distance Q-Resolution with Dependency Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Simulation of a NFA with k–Symbol Lookahead / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the size of bounded depth circuits over a complete basis with logical addition / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complementation problem for Büchi automata with applications to temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault Localization and Correction with QBF / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Propositional Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: GOAL Extended: Towards a Research Tool for Omega Automata and Temporal Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Büchi Store: An Open Repository of Büchi Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antichains: A New Algorithm for Checking Universality of Finite Automata / rank
 
Normal rank

Latest revision as of 08:44, 18 July 2024

scientific article; zbMATH DE number 7029311
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7029311

    Statements

    0 references
    0 references
    25 February 2019
    0 references
    automata reducjtion
    0 references
    inclusion testing
    0 references
    simulation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers