Uwe Egly - RankMe

102 papers A 21B 18C 2Misc 3Journal 37Unranked 19

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