The following pages link to Uwe Egly (Q229734):
Displayed 50 items.
- On different structure-preserving translations to normal form (Q674761) (← links)
- A solver for QBFs in negation normal form (Q1020501) (← links)
- An answer to an open problem of Urquhart (Q1129262) (← links)
- On deciding subsumption problems (Q1777407) (← links)
- \({\textsf{QRAT}}^{+}\): generalizing QRAT by a more powerful QBF redundancy property (Q1799077) (← links)
- Practically useful variants of definitional translations to normal form (Q1854384) (← links)
- On different proof-search strategies for orthologic (Q1868244) (← links)
- Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations (Q2058378) (← links)
- QRATPre+: effective QBF preprocessing via strong redundancy properties (Q2181932) (← links)
- Conformant planning as a case study of incremental QBF solving (Q2398267) (← links)
- DepQBF 6.0: a search-based QBF solver beyond traditional QCDCL (Q2405263) (← links)
- (Q2721197) (← links)
- (Q2751356) (← links)
- On Stronger Calculi for QBFs (Q2818031) (← links)
- Q-Resolution with Generalized Axioms (Q2818032) (← links)
- On Sequent Systems and Resolution for QBFs (Q2843326) (← links)
- Long-Distance Resolution: Proof Generation and Strategy Extraction in Search-Based QBF Solving (Q2870136) (← links)
- Incremental QBF Solving by DepQBF (Q2879140) (← links)
- Complexity Classifications for Logic-Based Argumentation (Q2946726) (← links)
- (Q3100233) (← links)
- (Q3126165) (← links)
- Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API (Q3453224) (← links)
- Automated Benchmarking of Incremental SAT and QBF Solvers (Q3460052) (← links)
- Enhancing Search-Based QBF Solving by Dynamic Blocked Clause Elimination (Q3460072) (← links)
- New Results on the Phase Transition for Random Quantified Boolean Formulas (Q3502691) (← links)
- Proof-complexity results for nonmonotonic reasoning (Q3549127) (← links)
- (Q3624065) (← links)
- (Q3838809) (← links)
- (Q4217953) (← links)
- (Q4223027) (← links)
- (Q4255508) (← links)
- (Q4263791) (← links)
- (Q4282509) (← links)
- (Q4282603) (← links)
- (Q4364511) (← links)
- (Q4524779) (← links)
- (Q4524785) (← links)
- (Q4530461) (← links)
- (Q4539641) (← links)
- Lean induction principles for tableaux (Q4610315) (← links)
- Non-elementary speed-ups in proof length by different variants of classical analytic calculi (Q4610324) (← links)
- On the practical value of different definitional translations to normal form (Q4647537) (← links)
- (Q4809044) (← links)
- (Q4934141) (← links)
- KoMeT (Q5210812) (← links)
- Some pitfalls of LK-to-LJ translations and how to avoid them (Q5234695) (← links)
- Exact location of the phase transition for random (1,2)-QSAT (Q5245725) (← links)
- Theory and Applications of Satisfiability Testing (Q5325863) (← links)
- Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation (Q5326456) (← links)
- On different intuitionistic calculi and embeddings from Int to S4 (Q5955616) (← links)