dblp.uni-trier.dewww.uni-trier.de

Uwe Egly Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
53EENadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol: (1, 2)-QSAT: A Good Candidate for Understanding Phase Transitions Mechanisms. SAT 2009: 363-376
52EENadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol: The threshold for random (1,2)-QSAT CoRR abs/0907.0937: (2009)
51EEUwe Egly, Martina Seidl, Stefan Woltran: A solver for QBFs in negation normal form. Constraints 14(1): 38-79 (2009)
2008
50EEUwe Egly, Sarah Alice Gaggl, Stefan Woltran: ASPARTIX: Implementing Argumentation Frameworks Using Answer-Set Programming. ICLP 2008: 734-738
49EENadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol: New Results on the Phase Transition for Random Quantified Boolean Formulas. SAT 2008: 34-47
48EEAlexander 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
47EENadia Creignou, Hervé Daudé, Uwe Egly: Phase Transition for Random Quantified XOR-Formulas. J. Artif. Intell. Res. (JAIR) 29: 1-18 (2007)
2006
46EEUwe Egly, Stefan Woltran: Reasoning in Argumentation Frameworks Using Quantified Boolean Formulas. COMMA 2006: 133-144
45 Uwe Egly, Martina Seidl, Stefan Woltran: A Solver for QBFs in Nonprenex Form. ECAI 2006: 477-481
2005
44EEUwe Egly, Reinhard Pichler, Stefan Woltran: On deciding subsumption problems. Ann. Math. Artif. Intell. 43(1): 255-294 (2005)
2003
43EEUwe Egly, Martina Seidl, Hans Tompits, Stefan Woltran, Michael Zolda: Comparing Different Prenexing Strategies for Quantified Boolean Formulas. SAT 2003: 214-228
42 Uwe Egly, Hans Tompits: On Different Proof-Search Strategies for Orthologic. Studia Logica 73(1): 131-152 (2003)
2002
41 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
40EEUwe Egly: Embedding Lax Logic into Intuitionistic Logic. CADE 2002: 78-93
2001
39EEUwe Egly, Thomas Eiter, Volker Klotz, Hans Tompits, Stefan Woltran: Computing Stable Models with Quantified Boolean Formulas: Some Experimental Results. Answer Set Programming 2001
38EEUwe Egly, Stephan Schmitt: Deriving Modular Programs from Short Proofs. IJCAR 2001: 561-577
37 Matthias Baaz, Uwe Egly, Alexander Leitsch: Normal Form Transformations. Handbook of Automated Reasoning 2001: 273-333
36EEUwe Egly, Hans Tompits: Proof-complexity results for nonmonotonic reasoning. ACM Trans. Comput. Log. 2(3): 340-387 (2001)
35 Uwe Egly: On Different Intuitionistic Calculi and Embeddings from Int to S4. Studia Logica 69(2): 249-277 (2001)
2000
34 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
33 Uwe Egly, Thomas Eiter, Hans Tompits, Stefan Woltran: Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas. AAAI/IAAI 2000: 417-422
32 Uwe Egly, Hans Tompits: Some Strengths of Nonmonotonic Reasoning. Intellectics and Computational Logic 2000: 125-141
31 Uwe Egly: Properties of Embeddings from Int to S4. TABLEAUX 2000: 205-219
30 Uwe Egly, Thomas Eiter, Hans Tompits, Stefan Woltran: Implementing Default Reasoning Using Quantified Boolean Formulae. WLP 2000: 223-228
29EEUwe Egly, Thomas Eiter, Hans Tompits, Stefan Woltran: QUIP - A Tool for Computing Nonmonotonic Reasoning Tasks CoRR cs.AI/0003037: (2000)
28 Uwe Egly, Thomas Rath: Practically Useful Variants of Definitional Translations to Normal Form. Inf. Comput. 162(1-2): 255-264 (2000)
1999
27 Uwe Egly, Michael Fink, Axel Polleres, Hans Tompits: A Web-based Tutoring Tool for Calculating Default Logic Extensions. WebNet 1999: 1251-1252
26 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
25EEUwe Egly, Stephan Schmitt: Intuitionistic Proof Transformations and Their Application to Constructive Program Synthesis. AISC 1998: 132-144
24EEUwe Egly: Quantifers and the System KE: Some Surprising Results. CSL 1998: 90-104
23 Uwe Egly, Gernot Koller: JQuest: ein javabasiertes Designtool für elektronische Fragebogen im Internet. Interaktion im Web 1998: 33-43
22EEUwe Egly, Hans Tompits: On Proof Complexity of Circumscription. TABLEAUX 1998: 141-155
21EEUwe Egly, Stephan Schmitt: Intuitionistic Proof Transformations: Complexity and Applications. Electr. Notes Theor. Comput. Sci. 17: (1998)
20EEUwe Egly: An Answer to an Open Problem of Urquhart. Theor. Comput. Sci. 198(1-2): 201-209 (1998)
1997
19EEUwe Egly: Some Pitfalls of LK-to-LJ Translations and How to Avoid Them. CADE 1997: 116-130
18 Uwe Egly, Hans Tompits: Non-elementary Speed-Ups in Default Reasoning. ECSQARU-FAPR 1997: 237-251
17 Uwe Egly, Karin Genther: Structuring of Computer-Generated Proofs by Cut Introduction. Kurt Gödel Colloquium 1997: 140-152
16 Uwe Egly, Hans Tompits: Is Non-Monotonic Reasoning Always Harder? LPNMR 1997: 60-75
15 Uwe Egly: Non-elementary Speed-ups in Proof Length by Different Variants of Classical Analytic Calculi. TABLEAUX 1997: 158-172
14 Matthias Baaz, Uwe Egly, Christian G. Fermüller: Lean Induction Principles for Tableaux. TABLEAUX 1997: 62-75
13 Uwe Egly, Hans Tompits: A Sequent Calculus for Intuitionistic Default Logic. WLP 1997: 0-
12 Uwe Egly: On Definitional Transformations to Normal Form for Institionistic Logic. Fundam. Inform. 29(1-2): 165-201 (1997)
1996
11EEUwe Egly, Thomas Rath: On the Practical Value of Different Definitional Translations to Normal Form. CADE 1996: 403-417
10 Uwe Egly: On Different Structure-Preserving Translations to Normal Form. J. Symb. Comput. 22(2): 121-142 (1996)
1995
9 Uwe Egly: Super-Polynomial Speed-Ups in Proof Length by New Tautologies. EPIA 1995: 29-40
8 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
7EEWolfgang Bibel, Stefan Brüning, Uwe Egly, Thomas Rath: KoMeT. CADE 1994: 783-787
6EEUwe 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
4EEUwe 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
2EEUwe 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

Coauthor Index

1Matthias Baaz [14] [37]
2Wolfgang Bibel [7] [8]
3Stefan Brüning [7] [8]
4Nadia Creignou [47] [49] [52] [53]
5Hervé Daudé [47] [49] [52] [53]
6Thomas Eiter [29] [30] [33] [34] [39] [48]
7Christian G. Fermüller [14] [41]
8Michael Fink [27]
9Sarah Alice Gaggl [50]
10Karin Genther [17]
11Heribert Kahmen [48]
12Volker Klotz [34] [39]
13Gernot Koller [23]
14Daniel S. Korn [8]
15Alexander Leitsch [37]
16Reinhard Pichler [44]
17Axel Polleres [27]
18Thomas Rath [7] [8] [11] [28]
19Alexander Reiterer [48]
20Raphaël Rossignol [49] [52] [53]
21Stephan Schmitt [21] [25] [26] [38]
22Martina Seidl [43] [45] [51]
23Hans Tompits [13] [16] [18] [22] [27] [29] [30] [32] [33] [34] [36] [39] [42] [43]
24Stefan Woltran [29] [30] [33] [34] [39] [43] [44] [45] [46] [50] [51]
25Michael Zolda [43]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)