Q4625701 (Q4625701): Difference between revisions

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