# | Y | | Author/Editor | | Title | |
1 |
| 2013 |
| |
2 |
| |
16 |
| 2007 |
| |
43 |
| |
41 |
| 2005 |
| |
37 |
| |
36 |
| 2003 |
| |
1 |
|
| |
2 |
|
| Part of a Book |
| |
21 |
|
| |
| | | Blanchet, Bruno
Podelski, Andreas | | Verification of Cryptographic Protocols: Tagging Enforces Termination
In: Foundations of software science and computation structures : 6th International Conference, FOSSACS 2003, 136-152 | |
| | | de Nivelle, Hans | | Implementing the clausal normal form transformation with proof generation
In: Fourth Workshop on the Implementation of Logics, 69-83 | |
| | | de Nivelle, Hans | | 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
Demri, Stéphane | | Deciding Modal Logics through Relational Translations into GF2
In: Proceedings of the 3rd Methods for Modalities Workshop, 15-30 | |
| | | Gaillourdet, Jean-Marie
Hillenbrand, Thomas
Löchner, Bernd
Spies, Hendrik | | The New WALDMEISTER Loop at Work
In: Automated deduction, CADE-19 : 19th International Conference on Automated Deduction, 317-321 | |
| | | Ganzinger, Harald
Hillenbrand, Thomas
Waldmann, Uwe | | Superposition modulo a Shostak Theory
In: Automated Deduction, CADE-19 : 19th International Conference on Automated Deduction, 182-196 | |
| | | Ganzinger, Harald
Korovin, Konstantin | | New Directions in Instantiation-Based Theorem Proving
In: 18th Annual IEEE Symposium on Logic in Computer Science (LICS-03), 55-64 | |
| | | Ganzinger, Harald
Stuber, Jürgen | | Superposition with Equivalence Reasoning and Delayed Clause Normal Form Transformation
In: Automated Deduction, CADE-19 : 19th International Conference on Automated Deduction, 335-349 | |
| | | Hoffmann, Jörg
Geffner, Hector | | Branching Matters: Alternative Branching in Graphplan
In: 13th International Conference on Automated Planning and Scheduling (ICAPS-13), 22-31 | |
| | | Jaeger, Manfred | | A Representation Theorem and Applications
In: Symbolic and Quantitative Approaches to Reasoning with Uncertainty :
7th European Conference, ECSQARU 2003, 50-61 | |
| | | Jaeger, Manfred | | Probabilistic Classifiers and the Concepts they Recognize
In: Proceedings of the Twentieth International Conference on Machine Learning (ICML-03), 266-273 | |
| | | Kazakov, Yevgeny
de Nivelle, Hans | | Subsumption of Concepts in $FL_0$ for (Cyclic) Terminologies with Respect to Descriptive Semantics is PSPACE-complete
In: 2003 International Workshop on Description Logics (DL-03), 56-64 | |
| | | Korovin, Konstantin
Voronkov, Andrei | | AC-compatible Knuth-Bendix Order
In: Automated deduction, CADE-19 : 19th International Conference on Automated Deduction, 47-59 | |
| | | Korovin, Konstantin
Voronkov, Andrei | | Orienting Equalities with the Knuth-Bendix Order
In: 18th Annual IEEE Symposium on Logic in Computer Science (LICS-03), 75-84 | |
| | | Letz, Reinhold
Stenz, Gernot | | Universal variables in disconnection tableaux
In: Automated reasoning with analytical tableaux and related methods : International Conference, TABLEAUX 2003, 117-133 | |
| | | Maier, Patrick | | Compositional Circular Assume-Guarantee Rules Cannot Be Sound and Complete
In: Foundations of software science and computation structures : 6th International Conference, FOSSACS 2003, 343-357 | |
| | | Podelski, Andreas | | Software Model Checking with Abstraction Refinement
In: Verification, model checking, and abstract interpretation : 4th International Conference, VMCAI 2003, 1-13 | |
| | | Ratschan, Stefan | | Solving Existentially Quantified Constraints with One Equality and Arbitrarily Many Inequalities
In: Principles and practice on constraint programming - CP 2003 : 9th International Conference, CP 2003, 615-633 | |
| | | Schmidt, Renate A.
Hustadt, Ullrich | | A Principle for Incorporating Axioms into the First-Order Translation of Modal Formulae
In: Automated deduction, CADE-19 : 19th International Conference on Automated Deduction, 412-426 | |
| | | Sofronie-Stokkermans, Viorica | | Automated theorem proving by resolution in non-classical logics
In: Fourth International Conference Journees de l'Informatique Messine: Knowledge Discovery and Discrete Mathematics (JIM-03), 151-167 | |