default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDUwe Egly
Person information
- affiliation: TU Wien, Vienna, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[c61]Alexander Mandl, Uwe Egly:
Implementations for Shor's algorithm for the DLP. GI-Jahrestagung 2022: 1133-1143- 2021
- [j18]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): 157-177 (2021) - 2020
- [i19]Olaf Beyersdorff, Uwe Egly, Meena Mahajan, Cláudia Nalon:
SAT and Interactions (Dagstuhl Seminar 20061). Dagstuhl Reports 10(2): 1-18 (2020)
2010 – 2019
- 2019
- [c60]Florian Lonsing, Uwe Egly:
QRATPre+: Effective QBF Preprocessing via Strong Redundancy Properties. SAT 2019: 203-210 - [i18]Florian Lonsing, Uwe Egly:
QRATPre+: Effective QBF Preprocessing via Strong Redundancy Properties. CoRR abs/1904.12927 (2019) - 2018
- [c59]Florian Lonsing, Uwe Egly:
QRAT+: Generalizing QRAT by a More Powerful QBF Redundancy Property. IJCAR 2018: 161-177 - [c58]Florian Lonsing, Uwe Egly:
Evaluating QBF Solvers: Quantifier Alternations Matter. CP 2018: 276-294 - [c57]Roderick Bloem, Nicolas Braud-Santoni, Vedad Hadzic, Uwe Egly, Florian Lonsing, Martina Seidl:
Expansion-Based QBF Solving Without Recursion. FMCAD 2018: 1-10 - [i17]Florian Lonsing, Uwe Egly:
QRAT+: Generalizing QRAT by a More Powerful QBF Redundancy Property. CoRR abs/1804.02908 (2018) - [i16]Roderick Bloem, Nicolas Braud-Santoni, Vedad Hadzic, Uwe Egly, Florian Lonsing, Martina Seidl:
Expansion-Based QBF Solving Without Recursion. CoRR abs/1807.08964 (2018) - 2017
- [j17]Uwe Egly, Martin Kronegger, Florian Lonsing, Andreas Pfandler:
Conformant planning as a case study of incremental QBF solving. Ann. Math. Artif. Intell. 80(1): 21-45 (2017) - [c56]Florian Lonsing, Uwe Egly:
DepQBF 6.0: A Search-Based QBF Solver Beyond Traditional QCDCL. CADE 2017: 371-384 - [i15]Florian Lonsing, Uwe Egly:
Evaluating QBF Solvers: Quantifier Alternations Matter. CoRR abs/1701.06612 (2017) - [i14]Florian Lonsing, Uwe Egly:
DepQBF 6.0: A Search-Based QBF Solver Beyond Traditional QCDCL. CoRR abs/1702.08256 (2017) - 2016
- [c55]Uwe Egly:
On Stronger Calculi for QBFs. SAT 2016: 419-434 - [c54]Florian Lonsing, Uwe Egly, Martina Seidl:
Q-Resolution with Generalized Axioms. SAT 2016: 435-452 - [i13]Florian Lonsing, Uwe Egly, Martina Seidl:
Q-Resolution with Generalized Axioms. CoRR abs/1604.05994 (2016) - [i12]Roderick Bloem, Uwe Egly, Patrick Klampfl, Robert Könighofer, Florian Lonsing, Martina Seidl:
Satisfiability-Based Methods for Reactive Synthesis from Safety Specifications. CoRR abs/1604.06204 (2016) - [i11]Uwe Egly:
On Stronger Calculi for QBFs. CoRR abs/1604.06483 (2016) - [i10]Olaf Beyersdorff, Nadia Creignou, Uwe Egly, Heribert Vollmer:
SAT and Interactions (Dagstuhl Seminar 16381). Dagstuhl Reports 6(9): 74-93 (2016) - 2015
- [j16]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): 23-45 (2015) - [c53]Uwe Egly, Florian Lonsing, Johannes Oetsch:
Automated Benchmarking of Incremental SAT and QBF Solvers. LPAR 2015: 178-186 - [c52]Florian Lonsing, Fahiem Bacchus, Armin Biere, Uwe Egly, Martina Seidl:
Enhancing Search-Based QBF Solving by Dynamic Blocked Clause Elimination. LPAR 2015: 418-433 - [c51]Florian Lonsing, Uwe Egly:
Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API. SAT 2015: 191-198 - [i9]Florian Lonsing, Uwe Egly:
Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API. CoRR abs/1502.02484 (2015) - [i8]Uwe Egly, Florian Lonsing, Johannes Oetsch:
Automated Benchmarking of Incremental SAT and QBF Solvers. CoRR abs/1506.08563 (2015) - 2014
- [j15]Nadia Creignou, Uwe Egly, Johannes Schmidt:
Complexity Classifications for Logic-Based Argumentation. ACM Trans. Comput. Log. 15(3): 19:1-19:20 (2014) - [c50]Uwe Egly, Martin Kronegger, Florian Lonsing, Andreas Pfandler:
Conformant Planning as a Case Study of Incremental QBF Solving. AISC 2014: 120-131 - [c49]Florian Lonsing, Uwe Egly:
Incremental QBF Solving. CP 2014: 514-530 - [c48]Roderick Bloem, Uwe Egly, Patrick Klampfl, Robert Könighofer, Florian Lonsing:
SAT-based methods for circuit synthesis. FMCAD 2014: 31-34 - [c47]Florian Lonsing, Uwe Egly:
Incremental QBF Solving by DepQBF. ICMS 2014: 307-314 - [e2]Carsten Sinz, Uwe Egly:
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. Lecture Notes in Computer Science 8561, Springer 2014, ISBN 978-3-319-09283-6 [contents] - [i7]Florian Lonsing, Uwe Egly:
Incremental QBF Solving. CoRR abs/1402.2410 (2014) - [i6]Uwe Egly, Martin Kronegger, Florian Lonsing, Andreas Pfandler:
Conformant Planning as a Case Study of Incremental QBF Solving. CoRR abs/1405.7253 (2014) - [i5]Roderick Bloem, Uwe Egly, Patrick Klampfl, Robert Könighofer, Florian Lonsing:
SAT-Based Methods for Circuit Synthesis. CoRR abs/1408.2333 (2014) - 2013
- [c46]Uwe Egly, Florian Lonsing, Magdalena Widl:
Long-Distance Resolution: Proof Generation and Strategy Extraction in Search-Based QBF Solving. LPAR 2013: 291-308 - [c45]Florian Lonsing, Uwe Egly, Allen Van Gelder:
Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation. SAT 2013: 100-115 - [i4]Nadia Creignou, Uwe Egly, Johannes Schmidt:
Complexity Classifications for logic-based Argumentation. CoRR abs/1304.5388 (2013) - 2012
- [c44]Nadia Creignou, Uwe Egly, Johannes Schmidt:
Complexity of logic-based argumentation in Schaefer's framework. COMMA 2012: 237-248 - [c43]Uwe Egly:
On Sequent Systems and Resolution for QBFs. SAT 2012: 100-113 - [c42]Magdalena Widl, Armin Biere, Petra Brosch, Uwe Egly, Marijn Heule, Gerti Kappel, Martina Seidl, Hans Tompits:
Guided Merging of Sequence Diagrams. SLE 2012: 164-183 - [c41]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: 149-155 - [c40]Nadia Creignou, Uwe Egly, Martina Seidl:
A Framework for the Specification of Random SAT and QSAT Formulas. TAP@TOOLS 2012: 163-168 - 2011
- [c39]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: 246-256 - [i3]Nadia Creignou, Hervé Daudé, Uwe Egly:
Phase Transition for Random Quantified XOR-Formulas. CoRR abs/1110.2739 (2011) - 2010
- [j14]Uwe Egly, Sarah Alice Gaggl, Stefan Woltran:
Answer-set programming encodings for argumentation frameworks. Argument Comput. 1(2): 147-177 (2010) - [j13]Uwe Egly, Leopold Haller:
A SAT Solver for Circuits Based on the Tableau Method. Künstliche Intell. 24(1): 15-23 (2010) - [c38]Tanja Vicovac, Alexander Reiterer, Uwe Egly, Thomas Eiter, Dirk Rieke-Zapp:
Knowledge-Based Geo-risk Assessment for an Intelligent Measurement System. IFIP AI 2010: 215-224
2000 – 2009
- 2009
- [j12]Uwe Egly, Martina Seidl, Stefan Woltran:
A solver for QBFs in negation normal form. Constraints An Int. J. 14(1): 38-79 (2009) - [c37]Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol:
(1, 2)-QSAT: A Good Candidate for Understanding Phase Transitions Mechanisms. SAT 2009: 363-376 - [i2]Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol:
The threshold for random (1,2)-QSAT. CoRR abs/0907.0937 (2009) - 2008
- [j11]Alexander Reiterer, Uwe Egly, Thomas Eiter, Heribert Kahmen:
A knowledge-based videotheodolite measurement system for object representation/monitoring. Adv. Eng. Softw. 39(10): 821-827 (2008) - [c36]Uwe Egly, Sarah Alice Gaggl, Stefan Woltran:
ASPARTIX: Implementing Argumentation Frameworks Using Answer-Set Programming. ICLP 2008: 734-738 - [c35]Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol:
New Results on the Phase Transition for Random Quantified Boolean Formulas. SAT 2008: 34-47 - 2007
- [j10]Nadia Creignou, Hervé Daudé, Uwe Egly:
Phase Transition for Random Quantified XOR-Formulas. J. Artif. Intell. Res. 29: 1-18 (2007) - 2006
- [c34]Uwe Egly, Stefan Woltran:
Reasoning in Argumentation Frameworks Using Quantified Boolean Formulas. COMMA 2006: 133-144 - [c33]Uwe Egly, Martina Seidl, Stefan Woltran:
A Solver for QBFs in Nonprenex Form. ECAI 2006: 477-481 - 2005
- [j9]Uwe Egly, Reinhard Pichler, Stefan Woltran:
On deciding subsumption problems. Ann. Math. Artif. Intell. 43(1): 255-294 (2005) - 2003
- [j8]Uwe Egly, Hans Tompits:
On Different Proof-Search Strategies for Orthologic. Stud Logica 73(1): 131-152 (2003) - [c32]Uwe Egly, Martina Seidl, Hans Tompits, Stefan Woltran, Michael Zolda:
Comparing Different Prenexing Strategies for Quantified Boolean Formulas. SAT 2003: 214-228 - 2002
- [c31]Uwe Egly:
Embedding Lax Logic into Intuitionistic Logic. CADE 2002: 78-93 - [e1]Uwe Egly, Christian G. Fermüller:
Automated Reasoning with Analytic Tableaux and Related Methods, International Conference, TABLEAUX 2002, Copenhagen, Denmark, July 30 - August 1, 2002, Proceedings. Lecture Notes in Computer Science 2381, Springer 2002, ISBN 3-540-43929-3 [contents] - 2001
- [j7]Uwe Egly:
On Different Intuitionistic Calculi and Embeddings from Int to S4. Stud Logica 69(2): 249-277 (2001) - [j6]Uwe Egly, Hans Tompits:
Proof-complexity results for nonmonotonic reasoning. ACM Trans. Comput. Log. 2(3): 340-387 (2001) - [c30]Uwe Egly, Thomas Eiter, Volker Klotz, Hans Tompits, Stefan Woltran:
Computing Stable Models with Quantified Boolean Formulas: Some Experimental Results. Answer Set Programming 2001 - [c29]Uwe Egly, Stephan Schmitt:
Deriving Modular Programs from Short Proofs. IJCAR 2001: 561-577 - [p1]Matthias Baaz, Uwe Egly, Alexander Leitsch:
Normal Form Transformations. Handbook of Automated Reasoning 2001: 273-333 - 2000
- [j5]Uwe Egly, Thomas Rath:
Practically Useful Variants of Definitional Translations to Normal Form. Inf. Comput. 162(1-2): 255-264 (2000) - [c28]Uwe Egly, Thomas Eiter, Hans Tompits, Stefan Woltran:
Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas. AAAI/IAAI 2000: 417-422 - [c27]Uwe Egly, Hans Tompits:
Some Strengths of Nonmonotonic Reasoning. Intellectics and Computational Logic 2000: 125-141 - [c26]Uwe Egly:
Properties of Embeddings from Int to S4. TABLEAUX 2000: 205-219 - [c25]Uwe Egly, Thomas Eiter, Volker Klotz, Hans Tompits, Stefan Woltran:
Experimental Evaluation of the Disjunctive Logic Programming Module of the System QUIP. WLP 2000: 113-122 - [c24]Uwe Egly, Thomas Eiter, Hans Tompits, Stefan Woltran:
Implementing Default Reasoning Using Quantified Boolean Formulae. WLP 2000: 223-228 - [i1]Uwe Egly, Thomas Eiter, Hans Tompits, Stefan Woltran:
QUIP - A Tool for Computing Nonmonotonic Reasoning Tasks. CoRR cs.AI/0003037 (2000)
1990 – 1999
- 1999
- [j4]Uwe Egly, Stephan Schmitt:
On Intuitionistic Proof Transformations, their Complexity, and Application to Constructive Program Synthesis. Fundam. Informaticae 39(1-2): 59-83 (1999) - [c23]Uwe Egly, Michael Fink, Axel Polleres, Hans Tompits:
A Web-based Tutoring Tool for Calculating Default Logic Extensions. WebNet 1999: 1251-1252 - 1998
- [j3]Uwe Egly:
An Answer to an Open Problem of Urquhart. Theor. Comput. Sci. 198(1-2): 201-209 (1998) - [c22]Uwe Egly, Stephan Schmitt:
Intuitionistic Proof Transformations and Their Application to Constructive Program Synthesis. AISC 1998: 132-144 - [c21]Uwe Egly:
Quantifers and the System KE: Some Surprising Results. CSL 1998: 90-104 - [c20]Uwe Egly, Gernot Koller:
JQuest: ein javabasiertes Designtool für elektronische Fragebogen im Internet. Interaktion im Web 1998: 33-43 - [c19]Uwe Egly, Hans Tompits:
On Proof Complexity of Circumscription. TABLEAUX 1998: 141-155 - [c18]Uwe Egly, Stephan Schmitt:
Intuitionistic Proof Transformations: Complexity and Applications. Proof Search in Type-Theoretic Languages@CADE 1998: 1-12 - 1997
- [j2]Uwe Egly:
On Definitional Transformations to Normal Form for Institionistic Logic. Fundam. Informaticae 29(1-2): 165-201 (1997) - [c17]Uwe Egly:
Some Pitfalls of LK-to-LJ Translations and How to Avoid Them. CADE 1997: 116-130 - [c16]Uwe Egly, Hans Tompits:
Non-elementary Speed-Ups in Default Reasoning. ECSQARU-FAPR 1997: 237-251 - [c15]Uwe Egly, Karin Genther:
Structuring of Computer-Generated Proofs by Cut Introduction. Kurt Gödel Colloquium 1997: 140-152 - [c14]Uwe Egly, Hans Tompits:
Is Non-Monotonic Reasoning Always Harder? LPNMR 1997: 60-75 - [c13]Matthias Baaz, Uwe Egly, Christian G. Fermüller:
Lean Induction Principles for Tableaux. TABLEAUX 1997: 62-75 - [c12]Uwe Egly:
Non-elementary Speed-ups in Proof Length by Different Variants of Classical Analytic Calculi. TABLEAUX 1997: 158-172 - [c11]Uwe Egly, Hans Tompits:
A Sequent Calculus for Intuitionistic Default Logic. WLP 1997 - 1996
- [j1]Uwe Egly:
On Different Structure-Preserving Translations to Normal Form. J. Symb. Comput. 22(2): 121-142 (1996) - [c10]Uwe Egly, Thomas Rath:
On the Practical Value of Different Definitional Translations to Normal Form. CADE 1996: 403-417 - 1995
- [c9]Uwe Egly:
Super-Polynomial Speed-Ups in Proof Length by New Tautologies. EPIA 1995: 29-40 - [c8]Wolfgang Bibel, Stefan Brüning, Uwe Egly, Daniel S. Korn, Thomas Rath:
Issues in Theorem Proving Based on the Connection Method. TABLEAUX 1995: 1-16 - 1994
- [b1]Uwe Egly:
On methods of function introduction and related concepts. Darmstadt University of Technology, Germany, 1994, pp. I-XIV, 1-167 - [c7]Wolfgang Bibel, Stefan Brüning, Uwe Egly, Thomas Rath:
KoMeT. CADE 1994: 783-787 - [c6]Uwe Egly:
On the Value of Antiprenexing. LPAR 1994: 69-83 - 1993
- [c5]Uwe Egly:
On Different Concepts of Function Introduction. Kurt Gödel Colloquium 1993: 172-183 - [c4]Uwe Egly:
A First Order Resolution Calculus with Symmetries. LPAR 1993: 110-121 - 1992
- [c3]Uwe Egly:
A Simple Proof for the Pigeonhole Formulae. ECAI 1992: 70-71 - [c2]Uwe Egly:
Shortening Proofs by Quantifier Introduction. LPAR 1992: 148-159 - 1991
- [c1]Uwe Egly:
A Generalized Factorization Rule Based on the Introduction of Skolem Terms. ÖGAI 1991: 116-125
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
