 | 2012 |
|---|
| 59 |       | Petra Brosch,
Uwe Egly,
Sebastian Gabmeyer,
Gerti Kappel,
Martina Seidl,
Hans Tompits,
Magdalena Widl,
Manuel Wimmer:
Towards Scenario-Based Testing of UML Diagrams.
TAP 2012: 149-155 |
| 58 | | Nadia Creignou,
Uwe Egly,
Martina Seidl:
A Framework for the Specification of Random SAT and QSAT Formulas.
TAP 2012: 163-168 |
| 2011 |
|---|
| 57 | | 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 |
| 56 | | Nadia Creignou,
Hervé Daudé,
Uwe Egly:
Phase Transition for Random Quantified XOR-Formulas
CoRR abs/1110.2739: (2011) |
| 2010 |
|---|
| 55 | | Uwe Egly,
Leopold Haller:
A SAT Solver for Circuits Based on the Tableau Method.
KI 24(1): 15-23 (2010) |
| 2009 |
|---|
| 54 | | Nadia Creignou,
Hervé Daudé,
Uwe Egly,
Raphaël Rossignol:
(1, 2)-QSAT: A Good Candidate for Understanding Phase Transitions Mechanisms.
SAT 2009: 363-376 |
| 53 | | Nadia Creignou,
Hervé Daudé,
Uwe Egly,
Raphaël Rossignol:
The threshold for random (1,2)-QSAT
CoRR abs/0907.0937: (2009) |
| 52 | | Uwe Egly,
Martina Seidl,
Stefan Woltran:
A solver for QBFs in negation normal form.
Constraints 14(1): 38-79 (2009) |
| 2008 |
|---|
| 51 | | Uwe Egly,
Sarah Alice Gaggl,
Stefan Woltran:
ASPARTIX: Implementing Argumentation Frameworks Using Answer-Set Programming.
ICLP 2008: 734-738 |
| 50 | | Nadia Creignou,
Hervé Daudé,
Uwe Egly,
Raphaël Rossignol:
New Results on the Phase Transition for Random Quantified Boolean Formulas.
SAT 2008: 34-47 |
| 49 | | Alexander Reiterer,
Uwe Egly,
Thomas Eiter,
Heribert Kahmen:
A knowledge-based videotheodolite measurement system for object representation/monitoring.
Advances in Engineering Software 39(10): 821-827 (2008) |
| 2007 |
|---|
| 48 | | Nadia Creignou,
Hervé Daudé,
Uwe Egly:
Phase Transition for Random Quantified XOR-Formulas.
J. Artif. Intell. Res. (JAIR) 29: 1-18 (2007) |
| 2006 |
|---|
| 47 | | Uwe Egly,
Stefan Woltran:
Reasoning in Argumentation Frameworks Using Quantified Boolean Formulas.
COMMA 2006: 133-144 |
| 46 |  | Uwe Egly,
Martina Seidl,
Stefan Woltran:
A Solver for QBFs in Nonprenex Form.
ECAI 2006: 477-481 |
| 2005 |
|---|
| 45 | | Uwe Egly,
Reinhard Pichler,
Stefan Woltran:
On deciding subsumption problems.
Ann. Math. Artif. Intell. 43(1): 255-294 (2005) |
| 2003 |
|---|
| 44 | | Uwe Egly,
Martina Seidl,
Hans Tompits,
Stefan Woltran,
Michael Zolda:
Comparing Different Prenexing Strategies for Quantified Boolean Formulas.
SAT 2003: 214-228 |
| 43 | | Uwe Egly,
Hans Tompits:
On Different Proof-Search Strategies for Orthologic.
Studia Logica 73(1): 131-152 (2003) |
| 2002 |
|---|
| 42 | | 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
Springer 2002 |
| 41 | | Uwe Egly:
Embedding Lax Logic into Intuitionistic Logic.
CADE 2002: 78-93 |
| 2001 |
|---|
| 40 | | Uwe Egly,
Thomas Eiter,
Volker Klotz,
Hans Tompits,
Stefan Woltran:
Computing Stable Models with Quantified Boolean Formulas: Some Experimental Results.
Answer Set Programming 2001 |
| 39 | | Uwe Egly,
Stephan Schmitt:
Deriving Modular Programs from Short Proofs.
IJCAR 2001: 561-577 |
| 38 | | Matthias Baaz,
Uwe Egly,
Alexander Leitsch:
Normal Form Transformations.
Handbook of Automated Reasoning 2001: 273-333 |
| 37 | | Uwe Egly,
Hans Tompits:
Proof-complexity results for nonmonotonic reasoning.
ACM Trans. Comput. Log. 2(3): 340-387 (2001) |
| 36 | | Uwe Egly:
On Different Intuitionistic Calculi and Embeddings from Int to S4.
Studia Logica 69(2): 249-277 (2001) |
| 2000 |
|---|
| 35 | | Uwe Egly,
Thomas Eiter,
Volker Klotz,
Hans Tompits,
Stefan Woltran:
Experimental Evaluation of the Disjunctive Logic Programming Module of the System QUIP.
15. WLP 2000: 113-122 |
| 34 | | Uwe Egly,
Thomas Eiter,
Hans Tompits,
Stefan Woltran:
Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas.
AAAI/IAAI 2000: 417-422 |
| 33 | | Uwe Egly,
Hans Tompits:
Some Strengths of Nonmonotonic Reasoning.
Intellectics and Computational Logic 2000: 125-141 |
| 32 | | Uwe Egly:
Properties of Embeddings from Int to S4.
TABLEAUX 2000: 205-219 |
| 31 | | Uwe Egly,
Thomas Eiter,
Hans Tompits,
Stefan Woltran:
Implementing Default Reasoning Using Quantified Boolean Formulae.
WLP 2000: 223-228 |
| 30 | | Uwe Egly,
Thomas Eiter,
Hans Tompits,
Stefan Woltran:
QUIP - A Tool for Computing Nonmonotonic Reasoning Tasks
CoRR cs.AI/0003037: (2000) |
| 29 | | Uwe Egly,
Thomas Rath:
Practically Useful Variants of Definitional Translations to Normal Form.
Inf. Comput. 162(1-2): 255-264 (2000) |
| 1999 |
|---|
| 28 | | Uwe Egly,
Michael Fink,
Axel Polleres,
Hans Tompits:
A Web-based Tutoring Tool for Calculating Default Logic Extensions.
WebNet 1999: 1251-1252 |
| 27 | | Uwe Egly,
Stephan Schmitt:
On Intuitionistic Proof Transformations, their Complexity, and Application to Constructive Program Synthesis.
Fundam. Inform. 39(1-2): 59-83 (1999) |
| 1998 |
|---|
| 26 | | Uwe Egly,
Stephan Schmitt:
Intuitionistic Proof Transformations and Their Application to Constructive Program Synthesis.
AISC 1998: 132-144 |
| 25 | | Uwe Egly:
Quantifers and the System KE: Some Surprising Results.
CSL 1998: 90-104 |
| 24 | | Uwe Egly,
Gernot Koller:
JQuest: ein javabasiertes Designtool für elektronische Fragebogen im Internet.
Interaktion im Web 1998: 33-43 |
| 23 | | Uwe Egly,
Hans Tompits:
On Proof Complexity of Circumscription.
TABLEAUX 1998: 141-155 |
| 22 | | Uwe Egly,
Stephan Schmitt:
Intuitionistic Proof Transformations: Complexity and Applications.
Electr. Notes Theor. Comput. Sci. 17: 1-12 (1998) |
| 21 | | Uwe Egly:
An Answer to an Open Problem of Urquhart.
Theor. Comput. Sci. 198(1-2): 201-209 (1998) |
| 1997 |
|---|
| 20 | | Uwe Egly:
Some Pitfalls of LK-to-LJ Translations and How to Avoid Them.
CADE 1997: 116-130 |
| 19 | | Uwe Egly,
Hans Tompits:
Non-elementary Speed-Ups in Default Reasoning.
ECSQARU-FAPR 1997: 237-251 |
| 18 | | Uwe Egly,
Karin Genther:
Structuring of Computer-Generated Proofs by Cut Introduction.
Kurt Gödel Colloquium 1997: 140-152 |
| 17 | | Uwe Egly,
Hans Tompits:
Is Non-Monotonic Reasoning Always Harder?
LPNMR 1997: 60-75 |
| 16 | | Uwe Egly:
Non-elementary Speed-ups in Proof Length by Different Variants of Classical Analytic Calculi.
TABLEAUX 1997: 158-172 |
| 15 | | Matthias Baaz,
Uwe Egly,
Christian G. Fermüller:
Lean Induction Principles for Tableaux.
TABLEAUX 1997: 62-75 |
| 14 | | Uwe Egly,
Hans Tompits:
A Sequent Calculus for Intuitionistic Default Logic.
WLP 1997: 0- |
| 13 | | Uwe Egly:
On Definitional Transformations to Normal Form for Institionistic Logic.
Fundam. Inform. 29(1-2): 165-201 (1997) |
| 1996 |
|---|
| 12 | | Uwe Egly,
Thomas Rath:
On the Practical Value of Different Definitional Translations to Normal Form.
CADE 1996: 403-417 |
| 11 | | Uwe Egly:
On Different Structure-Preserving Translations to Normal Form.
J. Symb. Comput. 22(2): 121-142 (1996) |
| 1995 |
|---|
| 10 | | Uwe Egly:
Super-Polynomial Speed-Ups in Proof Length by New Tautologies.
EPIA 1995: 29-40 |
| 9 | | 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 |
| 8 | | Uwe Egly:
On methods of function introduction and related concepts.
TH Darmstadt 1995: I-XIV, 1-167 |
| 1994 |
|---|
| 7 | | Wolfgang Bibel,
Stefan Brüning,
Uwe Egly,
Thomas Rath:
KoMeT.
CADE 1994: 783-787 |
| 6 | | Uwe Egly:
On the Value of Antiprenexing.
LPAR 1994: 69-83 |
| 1993 |
|---|
| 5 | | Uwe Egly:
On Different Concepts of Function Introduction.
Kurt Gödel Colloquium 1993: 172-183 |
| 4 | | Uwe Egly:
A First Order Resolution Calculus with Symmetries.
LPAR 1993: 110-121 |
| 1992 |
|---|
| 3 | | Uwe Egly:
A Simple Proof for the Pigeonhole Formulae.
ECAI 1992: 70-71 |
| 2 | | Uwe Egly:
Shortening Proofs by Quantifier Introduction.
LPAR 1992: 148-159 |
| 1991 |
|---|
| 1 | | Uwe Egly:
A Generalized Factorization Rule Based on the Introduction of Skolem Terms.
ÖGAI 1991: 116-125 |
Data released under the ODC-BY 1.0 license — See also our legal information page