The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Uwe Egly: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Uwe Egly, Thomas Eiter, Hans Tompits, Stefan Woltran
    Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 2000, pp:417-422 [Conf]
  2. Uwe Egly, Stephan Schmitt
    Intuitionistic Proof Transformations and Their Application to Constructive Program Synthesis. [Citation Graph (0, 0)][DBLP]
    AISC, 1998, pp:132-144 [Conf]
  3. Uwe Egly, Thomas Eiter, Volker Klotz, Hans Tompits, Stefan Woltran
    Computing Stable Models with Quantified Boolean Formulas: Some Experimental Results. [Citation Graph (0, 0)][DBLP]
    Answer Set Programming, 2001, pp:- [Conf]
  4. Uwe Egly, Hans Tompits
    Some Strengths of Nonmonotonic Reasoning. [Citation Graph (0, 0)][DBLP]
    Intellectics and Computational Logic, 2000, pp:125-141 [Conf]
  5. Wolfgang Bibel, Stefan Brüning, Uwe Egly, Thomas Rath
    KoMeT. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:783-787 [Conf]
  6. Uwe Egly
    Some Pitfalls of LK-to-LJ Translations and How to Avoid Them. [Citation Graph (0, 0)][DBLP]
    CADE, 1997, pp:116-130 [Conf]
  7. Uwe Egly
    Embedding Lax Logic into Intuitionistic Logic. [Citation Graph (0, 0)][DBLP]
    CADE, 2002, pp:78-93 [Conf]
  8. Uwe Egly, Thomas Rath
    On the Practical Value of Different Definitional Translations to Normal Form. [Citation Graph (0, 0)][DBLP]
    CADE, 1996, pp:403-417 [Conf]
  9. Uwe Egly, Stephan Schmitt
    Deriving Modular Programs from Short Proofs. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:561-577 [Conf]
  10. Uwe Egly
    Quantifers and the System KE: Some Surprising Results. [Citation Graph (0, 0)][DBLP]
    CSL, 1998, pp:90-104 [Conf]
  11. Uwe Egly
    A Simple Proof for the Pigeonhole Formulae. [Citation Graph (0, 0)][DBLP]
    ECAI, 1992, pp:70-71 [Conf]
  12. Uwe Egly, Martina Seidl, Stefan Woltran
    A Solver for QBFs in Nonprenex Form. [Citation Graph (0, 0)][DBLP]
    ECAI, 2006, pp:477-481 [Conf]
  13. Uwe Egly, Hans Tompits
    Non-elementary Speed-Ups in Default Reasoning. [Citation Graph (0, 0)][DBLP]
    ECSQARU-FAPR, 1997, pp:237-251 [Conf]
  14. Uwe Egly
    Super-Polynomial Speed-Ups in Proof Length by New Tautologies. [Citation Graph (0, 0)][DBLP]
    EPIA, 1995, pp:29-40 [Conf]
  15. Uwe Egly, Gernot Koller
    JQuest: ein javabasiertes Designtool für elektronische Fragebogen im Internet. [Citation Graph (0, 0)][DBLP]
    Interaktion im Web, 1998, pp:33-43 [Conf]
  16. Uwe Egly
    On Different Concepts of Function Introduction. [Citation Graph (0, 0)][DBLP]
    Kurt Gödel Colloquium, 1993, pp:172-183 [Conf]
  17. Uwe Egly, Karin Genther
    Structuring of Computer-Generated Proofs by Cut Introduction. [Citation Graph (0, 0)][DBLP]
    Kurt Gödel Colloquium, 1997, pp:140-152 [Conf]
  18. Uwe Egly
    Shortening Proofs by Quantifier Introduction. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:148-159 [Conf]
  19. Uwe Egly
    A First Order Resolution Calculus with Symmetries. [Citation Graph (0, 0)][DBLP]
    LPAR, 1993, pp:110-121 [Conf]
  20. Uwe Egly
    On the Value of Antiprenexing. [Citation Graph (0, 0)][DBLP]
    LPAR, 1994, pp:69-83 [Conf]
  21. Uwe Egly, Hans Tompits
    Is Non-Monotonic Reasoning Always Harder? [Citation Graph (0, 0)][DBLP]
    LPNMR, 1997, pp:60-75 [Conf]
  22. Uwe Egly
    A Generalized Factorization Rule Based on the Introduction of Skolem Terms. [Citation Graph (0, 0)][DBLP]
    ÖGAI, 1991, pp:116-125 [Conf]
  23. Uwe Egly, Martina Seidl, Hans Tompits, Stefan Woltran, Michael Zolda
    Comparing Different Prenexing Strategies for Quantified Boolean Formulas. [Citation Graph (0, 0)][DBLP]
    SAT, 2003, pp:214-228 [Conf]
  24. Uwe Egly
    Properties of Embeddings from Int to S4. [Citation Graph (0, 0)][DBLP]
    TABLEAUX, 2000, pp:205-219 [Conf]
  25. Uwe Egly
    Non-elementary Speed-ups in Proof Length by Different Variants of Classical Analytic Calculi. [Citation Graph (0, 0)][DBLP]
    TABLEAUX, 1997, pp:158-172 [Conf]
  26. Matthias Baaz, Uwe Egly, Christian G. Fermüller
    Lean Induction Principles for Tableaux. [Citation Graph (0, 0)][DBLP]
    TABLEAUX, 1997, pp:62-75 [Conf]
  27. Uwe Egly, Hans Tompits
    On Proof Complexity of Circumscription. [Citation Graph (0, 0)][DBLP]
    TABLEAUX, 1998, pp:141-155 [Conf]
  28. Wolfgang Bibel, Stefan Brüning, Uwe Egly, Daniel S. Korn, Thomas Rath
    Issues in Theorem Proving Based on the Connection Method. [Citation Graph (0, 0)][DBLP]
    TABLEAUX, 1995, pp:1-16 [Conf]
  29. Uwe Egly, Michael Fink, Axel Polleres, Hans Tompits
    A Web-based Tutoring Tool for Calculating Default Logic Extensions. [Citation Graph (0, 0)][DBLP]
    WebNet, 1999, pp:1251-1252 [Conf]
  30. Uwe Egly, Thomas Eiter, Volker Klotz, Hans Tompits, Stefan Woltran
    Experimental Evaluation of the Disjunctive Logic Programming Module of the System QUIP. [Citation Graph (0, 0)][DBLP]
    15. WLP, 2000, pp:113-122 [Conf]
  31. Uwe Egly, Thomas Eiter, Hans Tompits, Stefan Woltran
    Implementing Default Reasoning Using Quantified Boolean Formulae. [Citation Graph (0, 0)][DBLP]
    WLP, 2000, pp:223-228 [Conf]
  32. Uwe Egly, Hans Tompits
    A Sequent Calculus for Intuitionistic Default Logic. [Citation Graph (0, 0)][DBLP]
    WLP, 1997, pp:0-0 [Conf]
  33. Uwe Egly, Reinhard Pichler, Stefan Woltran
    On deciding subsumption problems. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2005, v:43, n:1, pp:255-294 [Journal]
  34. Uwe Egly, Thomas Eiter, Hans Tompits, Stefan Woltran
    QUIP - A Tool for Computing Nonmonotonic Reasoning Tasks [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  35. Uwe Egly, Stephan Schmitt
    Intuitionistic Proof Transformations: Complexity and Applications. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1998, v:17, n:, pp:- [Journal]
  36. Uwe Egly
    On Definitional Transformations to Normal Form for Institionistic Logic. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1997, v:29, n:1-2, pp:165-201 [Journal]
  37. Uwe Egly, Stephan Schmitt
    On Intuitionistic Proof Transformations, their Complexity, and Application to Constructive Program Synthesis. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1999, v:39, n:1-2, pp:59-83 [Journal]
  38. Uwe Egly, Thomas Rath
    Practically Useful Variants of Definitional Translations to Normal Form. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2000, v:162, n:1-2, pp:255-264 [Journal]
  39. Uwe Egly
    On Different Structure-Preserving Translations to Normal Form. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1996, v:22, n:2, pp:121-142 [Journal]
  40. Uwe Egly
    On Different Intuitionistic Calculi and Embeddings from Int to S4. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 2001, v:69, n:2, pp:249-277 [Journal]
  41. Uwe Egly, Hans Tompits
    On Different Proof-Search Strategies for Orthologic. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 2003, v:73, n:1, pp:131-152 [Journal]
  42. Uwe Egly
    An Answer to an Open Problem of Urquhart. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:198, n:1-2, pp:201-209 [Journal]
  43. Uwe Egly, Hans Tompits
    Proof-complexity results for nonmonotonic reasoning. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2001, v:2, n:3, pp:340-387 [Journal]
  44. Nadia Creignou, Hervé Daudé, Uwe Egly
    Phase Transition for Random Quantified XOR-Formulas. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 2007, v:29, n:, pp:1-18 [Journal]

  45. ASPARTIX: Implementing Argumentation Frameworks Using Answer-Set Programming. [Citation Graph (, )][DBLP]


  46. New Results on the Phase Transition for Random Quantified Boolean Formulas. [Citation Graph (, )][DBLP]


  47. (1, 2)-QSAT: A Good Candidate for Understanding Phase Transitions Mechanisms. [Citation Graph (, )][DBLP]


  48. Reasoning in Argumentation Frameworks Using Quantified Boolean Formulas. [Citation Graph (, )][DBLP]


  49. A solver for QBFs in negation normal form. [Citation Graph (, )][DBLP]


  50. The threshold for random (1,2)-QSAT [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002