Uwe Egly

Publication Activity (10 Years)

Years Active: 1991-2022
Publications (10 Years): 20

Top Venues

CoRR

SAT

LPAR

FMCAD

Darmstadt University of Technology, Germany (PHD)

Education History

Darmstadt University of Technology, Germany

PHD

Publications

Alexander Mandl, Uwe Egly
Implementations for Shor's algorithm for the DLP. GI-Jahrestagung (2022)
Roderick Bloem, Nicolas Braud-Santoni, Vedad Hadzic, Uwe Egly, Florian Lonsing, Martina Seidl
Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations. Formal Methods Syst. Des. 57 (2) (2021)
Olaf Beyersdorff, Uwe Egly, Meena Mahajan, Cláudia Nalon
SAT and Interactions (Dagstuhl Seminar 20061). Dagstuhl Reports 10 (2) (2020)
Florian Lonsing, Uwe Egly
QRATPre+: Effective QBF Preprocessing via Strong Redundancy Properties. CoRR (2019)
Florian Lonsing, Uwe Egly
QRATPre+: Effective QBF Preprocessing via Strong Redundancy Properties. SAT (2019)
Florian Lonsing, Uwe Egly
QRAT+: Generalizing QRAT by a More Powerful QBF Redundancy Property. CoRR (2018)
Florian Lonsing, Uwe Egly
Evaluating QBF Solvers: Quantifier Alternations Matter. CP (2018)
Roderick Bloem, Nicolas Braud-Santoni, Vedad Hadzic, Uwe Egly, Florian Lonsing, Martina Seidl
Expansion-Based QBF Solving Without Recursion. FMCAD (2018)
Florian Lonsing, Uwe Egly
QRAT+: Generalizing QRAT by a More Powerful QBF Redundancy Property. IJCAR (2018)
Roderick Bloem, Nicolas Braud-Santoni, Vedad Hadzic, Uwe Egly, Florian Lonsing, Martina Seidl
Expansion-Based QBF Solving Without Recursion. CoRR (2018)
Florian Lonsing, Uwe Egly
DepQBF 6.0: A Search-Based QBF Solver Beyond Traditional QCDCL. CoRR (2017)
Uwe Egly, Martin Kronegger, Florian Lonsing, Andreas Pfandler
Conformant planning as a case study of incremental QBF solving. Ann. Math. Artif. Intell. 80 (1) (2017)
Florian Lonsing, Uwe Egly
DepQBF 6.0: A Search-Based QBF Solver Beyond Traditional QCDCL. CADE (2017)
Florian Lonsing, Uwe Egly
Evaluating QBF Solvers: Quantifier Alternations Matter. CoRR (2017)
Uwe Egly
On Stronger Calculi for QBFs. CoRR (2016)
Olaf Beyersdorff, Nadia Creignou, Uwe Egly, Heribert Vollmer
SAT and Interactions (Dagstuhl Seminar 16381). Dagstuhl Reports 6 (9) (2016)
Roderick Bloem, Uwe Egly, Patrick Klampfl, Robert Könighofer, Florian Lonsing, Martina Seidl
Satisfiability-Based Methods for Reactive Synthesis from Safety Specifications. CoRR (2016)
Uwe Egly
On Stronger Calculi for QBFs. SAT (2016)
Florian Lonsing, Uwe Egly, Martina Seidl
Q-Resolution with Generalized Axioms. SAT (2016)
Florian Lonsing, Uwe Egly, Martina Seidl
Q-Resolution with Generalized Axioms. CoRR (2016)
Florian Lonsing, Fahiem Bacchus, Armin Biere, Uwe Egly, Martina Seidl
Enhancing Search-Based QBF Solving by Dynamic Blocked Clause Elimination. LPAR (2015)
Uwe Egly, Florian Lonsing, Johannes Oetsch
Automated Benchmarking of Incremental SAT and QBF Solvers. LPAR (2015)
Florian Lonsing, Uwe Egly
Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API. SAT (2015)
Florian Lonsing, Uwe Egly
Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API. CoRR (2015)
Uwe Egly, Florian Lonsing, Johannes Oetsch
Automated Benchmarking of Incremental SAT and QBF Solvers. CoRR (2015)
Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol
Exact location of the phase transition for random (1, 2)-QSAT. RAIRO Theor. Informatics Appl. 49 (1) (2015)
Florian Lonsing, Uwe Egly
Incremental QBF Solving. CP (2014)
Uwe Egly, Martin Kronegger, Florian Lonsing, Andreas Pfandler
Conformant Planning as a Case Study of Incremental QBF Solving. CoRR (2014)
Florian Lonsing, Uwe Egly
Incremental QBF Solving by DepQBF. ICMS (2014)
Nadia Creignou, Uwe Egly, Johannes Schmidt
Complexity Classifications for Logic-Based Argumentation. ACM Trans. Comput. Log. 15 (3) (2014)
Uwe Egly, Martin Kronegger, Florian Lonsing, Andreas Pfandler
Conformant Planning as a Case Study of Incremental QBF Solving. AISC (2014)
Roderick Bloem, Uwe Egly, Patrick Klampfl, Robert Könighofer, Florian Lonsing
SAT-Based Methods for Circuit Synthesis. CoRR (2014)
Roderick Bloem, Uwe Egly, Patrick Klampfl, Robert Könighofer, Florian Lonsing
SAT-based methods for circuit synthesis. FMCAD (2014)
Florian Lonsing, Uwe Egly
Incremental QBF Solving. CoRR (2014)
Nadia Creignou, Uwe Egly, Johannes Schmidt
Complexity Classifications for logic-based Argumentation CoRR (2013)
Uwe Egly, Florian Lonsing, Magdalena Widl
Long-Distance Resolution: Proof Generation and Strategy Extraction in Search-Based QBF Solving. LPAR (2013)
Florian Lonsing, Uwe Egly, Allen Van Gelder
Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation. SAT (2013)
Nadia Creignou, Uwe Egly, Johannes Schmidt
Complexity of logic-based argumentation in Schaefer's framework. COMMA (2012)
Uwe Egly
On Sequent Systems and Resolution for QBFs. SAT (2012)
Petra Brosch, Uwe Egly, Sebastian Gabmeyer, Gerti Kappel, Martina Seidl, Hans Tompits, Magdalena Widl, Manuel Wimmer
Towards Scenario-Based Testing of UML Diagrams. TAP@TOOLS (2012)
Magdalena Widl, Armin Biere, Petra Brosch, Uwe Egly, Marijn Heule, Gerti Kappel, Martina Seidl, Hans Tompits
Guided Merging of Sequence Diagrams. SLE (2012)
Nadia Creignou, Uwe Egly, Martina Seidl
A Framework for the Specification of Random SAT and QSAT Formulas. TAP@TOOLS (2012)
Petra Brosch, Uwe Egly, Sebastian Gabmeyer, Gerti Kappel, Martina Seidl, Hans Tompits, Magdalena Widl, Manuel Wimmer
Towards Semantics-Aware Merge Support in Optimistic Model Versioning. MoDELS (Workshops) (2011)
Nadia Creignou, Hervé Daudé, Uwe Egly
Phase Transition for Random Quantified XOR-Formulas CoRR (2011)
Uwe Egly, Leopold Haller
A SAT Solver for Circuits Based on the Tableau Method. Künstliche Intell. 24 (1) (2010)
Uwe Egly, Sarah Alice Gaggl, Stefan Woltran
Answer-set programming encodings for argumentation frameworks. Argument Comput. 1 (2) (2010)
T. Vicovac, Alexander Reiterer, Uwe Egly, Thomas Eiter, D. Rieke-Zapp
Knowledge-Based Geo-risk Assessment for an Intelligent Measurement System. IFIP AI (2010)
Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol
(1, 2)-QSAT: A Good Candidate for Understanding Phase Transitions Mechanisms. SAT (2009)
Uwe Egly, Martina Seidl, Stefan Woltran
A solver for QBFs in negation normal form. Constraints An Int. J. 14 (1) (2009)
Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol
The threshold for random (1,2)-QSAT CoRR (2009)
Alexander Reiterer, Uwe Egly, Thomas Eiter, Heribert Kahmen
A knowledge-based videotheodolite measurement system for object representation/monitoring. Adv. Eng. Softw. 39 (10) (2008)
Uwe Egly, Sarah Alice Gaggl, Stefan Woltran
ASPARTIX: Implementing Argumentation Frameworks Using Answer-Set Programming. ICLP (2008)
Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol
New Results on the Phase Transition for Random Quantified Boolean Formulas. SAT (2008)
Nadia Creignou, Hervé Daudé, Uwe Egly
Phase Transition for Random Quantified XOR-Formulas. J. Artif. Intell. Res. 29 (2007)
Uwe Egly, Stefan Woltran
Reasoning in Argumentation Frameworks Using Quantified Boolean Formulas. COMMA (2006)
Uwe Egly, Martina Seidl, Stefan Woltran
A Solver for QBFs in Nonprenex Form. ECAI (2006)
Uwe Egly, Reinhard Pichler, Stefan Woltran
On deciding subsumption problems. Ann. Math. Artif. Intell. 43 (1) (2005)
Uwe Egly, Martina Seidl, Hans Tompits, Stefan Woltran, Michael Zolda
Comparing Different Prenexing Strategies for Quantified Boolean Formulas. SAT (2003)
Uwe Egly, Hans Tompits
On Different Proof-Search Strategies for Orthologic. Stud Logica 73 (1) (2003)
Uwe Egly
Embedding Lax Logic into Intuitionistic Logic. CADE (2002)
Uwe Egly, Stephan Schmitt
Deriving Modular Programs from Short Proofs. IJCAR (2001)
Uwe Egly
On Different Intuitionistic Calculi and Embeddings from Int to S4. Stud Logica 69 (2) (2001)
Uwe Egly, Thomas Eiter, Volker Klotz, Hans Tompits, Stefan Woltran
Computing Stable Models with Quantified Boolean Formulas: Some Experimental Results. Answer Set Programming (2001)
Uwe Egly, Hans Tompits
Proof-complexity results for nonmonotonic reasoning. ACM Trans. Comput. Log. 2 (3) (2001)
Uwe Egly, Thomas Eiter, Hans Tompits, Stefan Woltran
Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas. AAAI/IAAI (2000)
Uwe Egly, Thomas Eiter, Hans Tompits, Stefan Woltran
QUIP - A Tool for Computing Nonmonotonic Reasoning Tasks CoRR (2000)
Uwe Egly, Thomas Eiter, Volker Klotz, Hans Tompits, Stefan Woltran
Experimental Evaluation of the Disjunctive Logic Programming Module of the System QUIP. WLP (2000)
Uwe Egly
Properties of Embeddings from Int to S4. TABLEAUX (2000)
Uwe Egly, Thomas Eiter, Hans Tompits, Stefan Woltran
Implementing Default Reasoning Using Quantified Boolean Formulae. WLP (2000)
Uwe Egly, Hans Tompits
Some Strengths of Nonmonotonic Reasoning. Intellectics and Computational Logic (2000)
Uwe Egly, Thomas Rath
Practically Useful Variants of Definitional Translations to Normal Form. Inf. Comput. 162 (1-2) (2000)
Uwe Egly, Stephan Schmitt
On Intuitionistic Proof Transformations, their Complexity, and Application to Constructive Program Synthesis. Fundam. Informaticae 39 (1-2) (1999)
Uwe Egly, Michael Fink, Axel Polleres, Hans Tompits
A Web-based Tutoring Tool for Calculating Default Logic Extensions. WebNet (1999)
Uwe Egly
An Answer to an Open Problem of Urquhart. Theor. Comput. Sci. 198 (1-2) (1998)
Uwe Egly, Stephan Schmitt
Intuitionistic Proof Transformations: Complexity and Applications. Electron. Notes Theor. Comput. Sci. 17 (1998)
Uwe Egly, Stephan Schmitt
Intuitionistic Proof Transformations and Their Application to Constructive Program Synthesis. AISC (1998)
Uwe Egly, Hans Tompits
On Proof Complexity of Circumscription. TABLEAUX (1998)
Uwe Egly
Quantifers and the System KE: Some Surprising Results. CSL (1998)
Uwe Egly, Gernot Koller
JQuest: ein javabasiertes Designtool für elektronische Fragebogen im Internet. Interaktion im Web (1998)
Uwe Egly
Some Pitfalls of LK-to-LJ Translations and How to Avoid Them. CADE (1997)
Matthias Baaz, Uwe Egly, Christian G. Fermüller
Lean Induction Principles for Tableaux. TABLEAUX (1997)
Uwe Egly, Hans Tompits
Non-elementary Speed-Ups in Default Reasoning. ECSQARU-FAPR (1997)
Uwe Egly
Non-elementary Speed-ups in Proof Length by Different Variants of Classical Analytic Calculi. TABLEAUX (1997)
Uwe Egly, Hans Tompits
A Sequent Calculus for Intuitionistic Default Logic. WLP (1997)
Uwe Egly
On Definitional Transformations to Normal Form for Institionistic Logic. Fundam. Informaticae 29 (1-2) (1997)
Uwe Egly, Hans Tompits
Is Non-Monotonic Reasoning Always Harder? LPNMR (1997)
Uwe Egly, Karin Genther
Structuring of Computer-Generated Proofs by Cut Introduction. Kurt Gödel Colloquium (1997)
Uwe Egly, Thomas Rath
On the Practical Value of Different Definitional Translations to Normal Form. CADE (1996)
Uwe Egly
On Different Structure-Preserving Translations to Normal Form. J. Symb. Comput. 22 (2) (1996)
Wolfgang Bibel, Stefan Brüning, Uwe Egly, Daniel S. Korn, Thomas Rath
Issues in Theorem Proving Based on the Connection Method. TABLEAUX (1995)
Uwe Egly
Super-Polynomial Speed-Ups in Proof Length by New Tautologies. EPIA (1995)
Uwe Egly
On the Value of Antiprenexing. LPAR (1994)
Wolfgang Bibel, Stefan Brüning, Uwe Egly, Thomas Rath
KoMeT. CADE (1994)
Uwe Egly
A First Order Resolution Calculus with Symmetries. LPAR (1993)
Uwe Egly
On Different Concepts of Function Introduction. Kurt Gödel Colloquium (1993)
Uwe Egly
Shortening Proofs by Quantifier Introduction. LPAR (1992)
Uwe Egly
A Simple Proof for the Pigeonhole Formulae. ECAI (1992)
Uwe Egly
A Generalized Factorization Rule Based on the Introduction of Skolem Terms. ÖGAI (1991)

Uwe Egly.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Uwe Egly