Uwe Egly

According to our database, Uwe Egly authored at least 85 papers between 1991 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2022

Implementations for Shor's algorithm for the DLP.

Alexander Mandl, Uwe Egly

Proceedings of the 52. Jahrestagung der Gesellschaft für Informatik, INFORMATIK 2022, Informatik in den Naturwissenschaften, 26., 2022

2021

Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations.

Roderick Bloem, Nicolas Braud-Santoni, Vedad Hadzic, Uwe Egly, Florian Lonsing, Martina Seidl

Formal Methods Syst. Des., 2021

2020

SAT and Interactions (Dagstuhl Seminar 20061).

Olaf Beyersdorff, Uwe Egly, Meena Mahajan, Cláudia Nalon

Dagstuhl Reports, 2020

2019

QRATPre+: Effective QBF Preprocessing via Strong Redundancy Properties.

Florian Lonsing, Uwe Egly

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2019, 2019

2018

Expansion-Based QBF Solving Without Recursion.

Roderick Bloem, Nicolas Braud-Santoni, Vedad Hadzic, Uwe Egly, Florian Lonsing, Martina Seidl

Proceedings of the 2018 Formal Methods in Computer Aided Design, 2018

Evaluating QBF Solvers: Quantifier Alternations Matter.

Florian Lonsing, Uwe Egly

Proceedings of the Principles and Practice of Constraint Programming, 2018

QRAT+: Generalizing QRAT by a More Powerful QBF Redundancy Property.

Florian Lonsing, Uwe Egly

Proceedings of the Automated Reasoning - 9th International Joint Conference, 2018

2017

Conformant planning as a case study of incremental QBF solving.

Uwe Egly, Martin Kronegger, Florian Lonsing, Andreas Pfandler

Ann. Math. Artif. Intell., 2017

DepQBF 6.0: A Search-Based QBF Solver Beyond Traditional QCDCL.

Florian Lonsing, Uwe Egly

Proceedings of the Automated Deduction - CADE 26, 2017

2016

SAT and Interactions (Dagstuhl Seminar 16381).

Olaf Beyersdorff, Nadia Creignou, Uwe Egly, Heribert Vollmer

Dagstuhl Reports, 2016

Satisfiability-Based Methods for Reactive Synthesis from Safety Specifications.

Roderick Bloem, Uwe Egly, Patrick Klampfl, Robert Könighofer, Florian Lonsing, Martina Seidl

CoRR, 2016

Q-Resolution with Generalized Axioms.

Florian Lonsing, Uwe Egly, Martina Seidl

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016

On Stronger Calculi for QBFs.

Uwe Egly

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016

2015

Exact location of the phase transition for random (1, 2)-QSAT.

Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol

RAIRO Theor. Informatics Appl., 2015

Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API.

Florian Lonsing, Uwe Egly

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2015, 2015

Enhancing Search-Based QBF Solving by Dynamic Blocked Clause Elimination.

Florian Lonsing, Fahiem Bacchus, Armin Biere, Uwe Egly, Martina Seidl

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2015

Automated Benchmarking of Incremental SAT and QBF Solvers.

Uwe Egly, Florian Lonsing, Johannes Oetsch

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2015

2014

Complexity Classifications for Logic-Based Argumentation.

Nadia Creignou, Uwe Egly, Johannes Schmidt

ACM Trans. Comput. Log., 2014

Incremental QBF Solving by DepQBF.

Florian Lonsing, Uwe Egly

Proceedings of the Mathematical Software - ICMS 2014, 2014

SAT-based methods for circuit synthesis.

Roderick Bloem, Uwe Egly, Patrick Klampfl, Robert Könighofer, Florian Lonsing

Proceedings of the Formal Methods in Computer-Aided Design, 2014

Incremental QBF Solving.

Florian Lonsing, Uwe Egly

Proceedings of the Principles and Practice of Constraint Programming, 2014

2013

Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation.

Florian Lonsing, Uwe Egly, Allen Van Gelder

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2013, 2013

Long-Distance Resolution: Proof Generation and Strategy Extraction in Search-Based QBF Solving.

Uwe Egly, Florian Lonsing, Magdalena Widl

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2013

2012

A Framework for the Specification of Random SAT and QSAT Formulas.

Nadia Creignou, Uwe Egly, Martina Seidl

Proceedings of the Tests and Proofs - 6th International Conference, 2012

Towards Scenario-Based Testing of UML Diagrams.

Petra Brosch, Uwe Egly, Sebastian Gabmeyer, Gerti Kappel, Martina Seidl, Hans Tompits, Magdalena Widl, Manuel Wimmer

Proceedings of the Tests and Proofs - 6th International Conference, 2012

Guided Merging of Sequence Diagrams.

Magdalena Widl, Armin Biere, Petra Brosch, Uwe Egly, Marijn Heule, Gerti Kappel, Martina Seidl, Hans Tompits

Proceedings of the Software Language Engineering, 5th International Conference, 2012

On Sequent Systems and Resolution for QBFs.

Uwe Egly

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

Complexity of logic-based argumentation in Schaefer's framework.

Nadia Creignou, Uwe Egly, Johannes Schmidt

Proceedings of the Computational Models of Argument, 2012

2011

Towards Semantics-Aware Merge Support in Optimistic Model Versioning.

Petra Brosch, Uwe Egly, Sebastian Gabmeyer, Gerti Kappel, Martina Seidl, Hans Tompits, Magdalena Widl, Manuel Wimmer

Proceedings of the Models in Software Engineering, 2011

2010

A SAT Solver for Circuits Based on the Tableau Method.

Uwe Egly, Leopold Haller

Künstliche Intell., 2010

Answer-set programming encodings for argumentation frameworks.

Uwe Egly, Sarah Alice Gaggl, Stefan Woltran

Argument Comput., 2010

Knowledge-Based Geo-risk Assessment for an Intelligent Measurement System.

Tanja Vicovac, Alexander Reiterer, Uwe Egly, Thomas Eiter, Dirk Rieke-Zapp

Proceedings of the Artificial Intelligence in Theory and Practice III, 2010

2009

The threshold for random (1,2)-QSAT

Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol

CoRR, 2009

A solver for QBFs in negation normal form.

Uwe Egly, Martina Seidl, Stefan Woltran

Constraints An Int. J., 2009

(1, 2)-QSAT: A Good Candidate for Understanding Phase Transitions Mechanisms.

Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol

Proceedings of the Theory and Applications of Satisfiability Testing, 2009

2008

A knowledge-based videotheodolite measurement system for object representation/monitoring.

Alexander Reiterer, Uwe Egly, Thomas Eiter, Heribert Kahmen

Adv. Eng. Softw., 2008

New Results on the Phase Transition for Random Quantified Boolean Formulas.

Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol

Proceedings of the Theory and Applications of Satisfiability Testing, 2008

ASPARTIX: Implementing Argumentation Frameworks Using Answer-Set Programming.

Uwe Egly, Sarah Alice Gaggl, Stefan Woltran

Proceedings of the Logic Programming, 24th International Conference, 2008

2007

Phase Transition for Random Quantified XOR-Formulas.

Nadia Creignou, Hervé Daudé, Uwe Egly

J. Artif. Intell. Res., 2007

2006

A Solver for QBFs in Nonprenex Form.

Uwe Egly, Martina Seidl, Stefan Woltran

Proceedings of the ECAI 2006, 17th European Conference on Artificial Intelligence, August 29, 2006

Reasoning in Argumentation Frameworks Using Quantified Boolean Formulas.

Uwe Egly, Stefan Woltran

Proceedings of the Computational Models of Argument: Proceedings of COMMA 2006, 2006

2005

On deciding subsumption problems.

Uwe Egly, Reinhard Pichler, Stefan Woltran

Ann. Math. Artif. Intell., 2005

2003

On Different Proof-Search Strategies for Orthologic.

Uwe Egly, Hans Tompits

Stud Logica, 2003

Comparing Different Prenexing Strategies for Quantified Boolean Formulas.

Uwe Egly, Martina Seidl, Hans Tompits, Stefan Woltran, Michael Zolda

Proceedings of the Theory and Applications of Satisfiability Testing, 2003

2002

Embedding Lax Logic into Intuitionistic Logic.

Uwe Egly

Proceedings of the Automated Deduction, 2002

2001

Proof-complexity results for nonmonotonic reasoning.

Uwe Egly, Hans Tompits

ACM Trans. Comput. Log., 2001

On Different Intuitionistic Calculi and Embeddings from Int to S4.

Uwe Egly

Stud Logica, 2001

Deriving Modular Programs from Short Proofs.

Uwe Egly, Stephan Schmitt

Proceedings of the Automated Reasoning, First International Joint Conference, 2001

Computing Stable Models with Quantified Boolean Formulas: Some Experimental Results.

Uwe Egly, Thomas Eiter, Volker Klotz, Hans Tompits, Stefan Woltran

Proceedings of the Answer Set Programming, 2001

Normal Form Transformations.

Matthias Baaz, Uwe Egly, Alexander Leitsch

Proceedings of the Handbook of Automated Reasoning (in 2 volumes), 2001

2000

Practically Useful Variants of Definitional Translations to Normal Form.

Uwe Egly, Thomas Rath

Inf. Comput., 2000

QUIP - A Tool for Computing Nonmonotonic Reasoning Tasks

Uwe Egly, Thomas Eiter, Hans Tompits, Stefan Woltran

CoRR, 2000

Implementing Default Reasoning Using Quantified Boolean Formulae.

Uwe Egly, Thomas Eiter, Hans Tompits, Stefan Woltran

Proceedings of the 14. Workshop Logische Programmierung, 2000

Experimental Evaluation of the Disjunctive Logic Programming Module of the System QUIP.

Uwe Egly, Thomas Eiter, Volker Klotz, Hans Tompits, Stefan Woltran

Proceedings of the WLP 2000, 2000

Properties of Embeddings from Int to S4.

Uwe Egly

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2000

Some Strengths of Nonmonotonic Reasoning.

Uwe Egly, Hans Tompits

Proceedings of the Intellectics and Computational Logic (to Wolfgang Bibel on the occasion of his 60th birthday), 2000

Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas.

Uwe Egly, Thomas Eiter, Hans Tompits, Stefan Woltran

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30, 2000

1999

On Intuitionistic Proof Transformations, their Complexity, and Application to Constructive Program Synthesis.

Uwe Egly, Stephan Schmitt

Fundam. Informaticae, 1999

A Web-based Tutoring Tool for Calculating Default Logic Extensions.

Uwe Egly, Michael Fink, Axel Polleres, Hans Tompits

Proceedings of WebNet 99, 1999

1998

An Answer to an Open Problem of Urquhart.

Uwe Egly

Theor. Comput. Sci., 1998

Intuitionistic Proof Transformations: Complexity and Applications.

Uwe Egly, Stephan Schmitt

Proceedings of the Workshop on Proof Search in Type-Theoretic Languages (in conjunction with CADE-15 Conference), 1998

On Proof Complexity of Circumscription.

Uwe Egly, Hans Tompits

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 1998

JQuest: ein javabasiertes Designtool für elektronische Fragebogen im Internet.

Uwe Egly, Gernot Koller

Proceedings of the Interaktion im Web, 1998

Quantifers and the System KE: Some Surprising Results.

Uwe Egly

Proceedings of the Computer Science Logic, 12th International Workshop, 1998

Intuitionistic Proof Transformations and Their Application to Constructive Program Synthesis.

Uwe Egly, Stephan Schmitt

Proceedings of the Artificial Intelligence and Symbolic Computation, 1998

1997

On Definitional Transformations to Normal Form for Institionistic Logic.

Uwe Egly

Fundam. Informaticae, 1997

A Sequent Calculus for Intuitionistic Default Logic.

Uwe Egly, Hans Tompits

Proceedings of the Twelfth Workshop Logic Programming, 1997

Non-elementary Speed-ups in Proof Length by Different Variants of Classical Analytic Calculi.

Uwe Egly

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 1997

Lean Induction Principles for Tableaux.

Matthias Baaz, Uwe Egly, Christian G. Fermüller

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 1997

Is Non-Monotonic Reasoning Always Harder?

Uwe Egly, Hans Tompits

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 1997

Structuring of Computer-Generated Proofs by Cut Introduction.

Uwe Egly, Karin Genther

Proceedings of the Computational Logic and Proof Theory, 5th Kurt Gödel Colloquium, 1997

Non-elementary Speed-Ups in Default Reasoning.

Uwe Egly, Hans Tompits

Proceedings of the Qualitative and Quantitative Practical Reasoning, 1997

Some Pitfalls of LK-to-LJ Translations and How to Avoid Them.

Uwe Egly

Proceedings of the Automated Deduction, 1997

1996

On Different Structure-Preserving Translations to Normal Form.

Uwe Egly

J. Symb. Comput., 1996

On the Practical Value of Different Definitional Translations to Normal Form.

Uwe Egly, Thomas Rath

Proceedings of the Automated Deduction - CADE-13, 13th International Conference on Automated Deduction, New Brunswick, NJ, USA, July 30, 1996

1995

Issues in Theorem Proving Based on the Connection Method.

Wolfgang Bibel, Stefan Brüning, Uwe Egly, Daniel S. Korn, Thomas Rath

Proceedings of the Theorem Proving with Analytic Tableaux and Related Methods, 1995

Super-Polynomial Speed-Ups in Proof Length by New Tautologies.

Uwe Egly

Proceedings of the Progress in Artificial Intelligence, 1995

1994

On the Value of Antiprenexing.

Uwe Egly

Proceedings of the Logic Programming and Automated Reasoning, 5th International Conference, 1994

KoMeT.

Wolfgang Bibel, Stefan Brüning, Uwe Egly, Thomas Rath

Proceedings of the Automated Deduction - CADE-12, 12th International Conference on Automated Deduction, Nancy, France, June 26, 1994

On methods of function introduction and related concepts.

Uwe Egly

PhD thesis, 1994

1993

A First Order Resolution Calculus with Symmetries.

Uwe Egly

Proceedings of the Logic Programming and Automated Reasoning,4th International Conference, 1993

On Different Concepts of Function Introduction.

Uwe Egly

Proceedings of the Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, 1993

1992

Shortening Proofs by Quantifier Introduction.

Uwe Egly

Proceedings of the Logic Programming and Automated Reasoning, 1992

A Simple Proof for the Pigeonhole Formulae.

Uwe Egly

Proceedings of the 10th European Conference on Artificial Intelligence, 1992

1991

A Generalized Factorization Rule Based on the Introduction of Skolem Terms.

Uwe Egly

Proceedings of the Proc. 7th Austrian Conference on Artificial Intelligence, 1991