| Title | Author(s) [non member] | Editor(s) [non member] | Year | Type |
|---|
| Transition Invariants
In: Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, LICS 2004, 32-41 | Podelski, Andreas
Rybalchenko, Andrey | | 2004 | Proceedings Article |
| Transition Predicate Abstraction and Fair Termination
In: ACM Transactions on Programming Languages and Systems [29], 30 | Podelski, Andreas
Rybalchenko, Andrey |  | 2007 | Journal Article |
| Transition predicate abstraction and fair termination
In: Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2005, 124-139 | Podelski, Andreas
Rybalchenko, Andrey | [Palsberg, Jens]
[Abadi, Martín] | 2005 | Proceedings Article |
| Translating Graded Modalities into Predicate Logic
In: Proof Theory of Modal Logic, 253-291 | Ohlbach, Hans Jürgen
Schmidt, Renate A.
Hustadt, Ullrich | [Wansing, H.] | 1996 | Part of a Book |
| Translation Methods for Non-Classical Logics: An Overview
In: Bulletin of the Interest Group in Propositional and Predicate Logics (IGPL) [1], 69-90 | Ohlbach, Hans Jürgen | | 1993 | Journal Article |
| Translation of Resolution Proofs into Short First-Order Proofs without Choice Axioms
In: Automated deduction, CADE-19 : 19th International Conference on Automated Deduction, 365-379 | de Nivelle, Hans | [Baader, Franz] | 2003 | Proceedings Article |
| Translation of Resolution Proofs into Short First-Order Proofs without Choice Axioms
In: Information and Computation [199], 24-54 | de Nivelle, Hans | | 2005 | Journal Article |
| Two Kinds of Conflicts between Desires (and how to resolve them)
In: Proceedings of the AAAI Symposium on Game and Decision Theoretic Agents, 54-59 | [Lang, Jérôme]
van der Torre, Leendert W. N.
Weydert, Emil | Parsons, Simon
Gmytrasiewicz, Piotr | 2001 | Proceedings Article |
| Two Proof Systems for Peirce Algebras
In: Relational and Kleene-Algebraic Methods in Computer Science: 7th International Seminar on Relational Methods in Computer Science and 2nd International Workshop on Applications of Kleene Algebra, 238-251 | Schmidt, Renate A.
Orłowska, Ewa
[Hustadt, Ullrich] | [Berghammer, Rudolf]
[Möller, Bernhard]
[Struth, Georg] | 2004 | Proceedings Article |
 | Über die Stabilität parameterisierter algebraischer Spezifikationen
Universität Dortmund | Baumeister, Hubert | | 1990 | Thesis - Masters thesis |
| Unification-free Execution of Well-moded Prolog Programs
In: Proc. of International Static Analysis Symposium, 243-260 | Krishna Rao, M. R. K.
Shyamasundar, R. K. | Mycroft, Alan | 1995 | Proceedings Article |
| Unification in Extensions of Shallow Equational Theories
In: Proceedings of the 9th International Conference on Rewriting Techniques and Applications (RTA-98), 76-90 | [Jacquemard, Florent]
Meyer, Christoph
Weidenbach, Christoph | [Nipkow, Tobias] | 1998 | Proceedings Article |
| Unification in Order-Sorted Logic with Term Declarations
In: Proceedings of the 4th Conference on Logic Programming and Automated Reasoning (LPAR-93), 301-308 | Socher-Ambrosius, Rolf | Voronkov, Andrei | 1993 | Proceedings Article |
| Unification in Pseudo-Linear Sort Theories is Decidable
In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), 343-357 | Weidenbach, Christoph | [McRobbie, M. A.]
[Slaney, J. K.] | 1996 | Proceedings Article |
| Unification in Sort Theories
In: Proceedings of the 10th International Workshop on Unification, UNIF'96, 16-25 | Weidenbach, Christoph | [Schulz, Klaus U.]
[Kepser, Stephan] | 1996 | Proceedings Article |
| Unification in Sort Theories and its Applications
In: Annals of Mathematics and Artificial Intelligence [18], 261-293 | Weidenbach, Christoph | | 1996 | Journal Article |
| Unification Using Dynamic Sorts
Universität des Saarlandes | Graf, Peter | | 1992 | Thesis - Masters thesis |
| Unifying Initial and Loose Semantics of Parameterized Specifications in an Arbitrary Institution
In: Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT '91), 103-120 | Baumeister, Hubert | Abramsky, S.
Maibaum, T. S. E. | 1991 | Proceedings Article |
| Universal variables in disconnection tableaux
In: Automated reasoning with analytical tableaux and related methods : International Conference, TABLEAUX 2003, 117-133 | [Letz, Reinhold]
Stenz, Gernot | [Cialdea Mayer, Marta]
[Pirri, Fiora] | 2003 | Proceedings Article |
| Untersuchung nicht-monotoner Logiken - Fallstudie zur Automatisierung
Universität des Saarlandes | Schlobach, Stefan | | 1996 | Thesis - Masters thesis |
| Use of replace rules in theorem proving
In: Methods of Logic in Computer Science [1], 217-240 | [Lee, Shie-Jue]
Plaisted, David A. | | 1994 | Journal Article |
| Using BPEL processes defined by Event-driven Process Chains
In: 5. GI-Workshop "EPK 2006 - Geschäftsprozessmanagement mit Ereignisgesteuerten Prozessketten", 121-135 | [Simon, Carlo]
Freiheit, Jörn
[Olbrich, Sebastian] | [Nüttgens, Markus]
[Rump, Frank J.]
[Mendling, Jan] | 2006 | Proceedings Article |
| Using Strong Cutting Planes in Constraint Logic Programming (Extended Abstract)
In: Operations Research '93, 18th Symposium on Operations Research, 47-49 | Bockmayr, Alexander | Bachem, A.
et al. | 1994 | Proceedings Article |
| Utilitarian Desires
In: Autonomous Agents and Multi-Agent Systems [5], 329-363 | [Lang, Jérôme]
[van der Torre, Leendert W. N.]
Weydert, Emil | | 2002 | Journal Article |
| Utilizing Problem Structure in Planning: A Local Search Approach | Hoffmann, Jörg | | 2003 | Book |
| Verification-Integrated Falsification of Non-Deterministic Hybrid Systems
In: 2nd IFAC Conference on Analysis and Design of Hybrid Systems, ? | Ratschan, Stefan
[Smaus, Jan-Georg] | [Cassandras, Christos]
[Giua, Alessandro]
[Seatzu, Carla]
[Zaytoon, Janan] | 2006 | Proceedings Article |
| Verification of an Off-Line Checker for Priority Queues
In: Third IEEE International Conference on Software Engineering and Formal Methods (SEFM 2005), 210-219 | de Nivelle, Hans
Piskac, Ruzica | Aichernig, Bernhard K.
Beckert, Bernhard | 2005 | Proceedings Article |
| Verification of Cryptographic Protocols: Tagging Enforces Termination
In: Foundations of software science and computation structures : 6th International Conference, FOSSACS 2003, 136-152 | Blanchet, Bruno
Podelski, Andreas | [Gordon, Andrew D.] | 2003 | Proceedings Article |
| Verification of Cryptographic Protocols: Tagging Enforces Termination
In: Theoretical Computer Science [333], 67-90 | Blanchet, Bruno
Podelski, Andreas | | 2005 | Journal Article |
| Well-Behaved Inference Rules for First-Order Theorem Proving
In: Journal of Automated Reasoning [21], 381-400 | Wu, Jinzhao
[Liu, Zhuojun] | | 1998 | Journal Article |
