 | Journal Full Title / ISSN | Year | Author/Editor | | Title | |
|---|
| Information and Computation
- | 2005 | Ganzinger, Harald
Stuber, Jürgen | | Superposition with equivalence reasoning and delayed clause normal form transformation
In: Information and Computation [199], 3-23 | |
| Siberian Mathematical Journal
0037-4466 | 2005 | Goncharov, Sergey
Harizanov, Valentina
Knight, Julia F.
Morozov, Andrey
Romina, Anya | | On automorphic tuples of elements in computable models
In: Siberian Mathematical Journal [46], 405-412 | |
| Artificial Intelligence
0004-3702 | 2005 | Hoffmann, Jörg | | In Defense of PDDL Axioms
In: Artificial Intelligence [168], 38-69 | |
| Journal of Artificial Intelligence Research
1076-9757 | 2005 | Hoffmann, Jörg | | The Deterministic Part of IPC-4: An Overview
In: Journal of Artificial Intelligence Research [24], 519 - 579 | |
| Journal of Artificial Intelligence Research
1076-9757 | 2005 | Hoffmann, Jörg | | Where Ignoring Delete Lists Works: Local Search Topology in Planning Benchmarks
In: Journal of Artificial Intelligence Research [24], 685-758 | |
| ACM Transactions on Computational Logic
- | 2005 | Korovin, Konstantin
Voronkov, Andrei | | Knuth-Bendix constraint solving is NP-complete
In: ACM Transactions on Computational Logic [6], 361-388 | |
| Journal of Automated Reasoning
- | 2004 | Baumgartner, Peter
Furbach, Ulrich
Gross-Hardt, Margret
Sinner, Alex | | Living Book -- Deduction, Slicing, and Interaction
In: Journal of Automated Reasoning [32], 259-286 | |
| Softwaretechnik-Trends
0720-8928 | 2004 | Baumgartner, Peter
Grabowski, Barbara
Oevel, Walter
Melis, Erica | | In2Math - Interaktive Mathematik- und Informatikgrundausbildung
In: Softwaretechnik-Trends [24], 36-45 | |
| Journal of Automated Reasoning
- | 2004 | Ganzinger, Harald
Nieuwenhuis, Robert
Nivela, Pilar |  | Fast Term Indexing with Coded Context Trees
In: Journal of Automated Reasoning [32], 103-120 | |
| Journal of Artificial Intelligence Research
1076-9757 | 2004 | Hoffmann, Jörg
Porteous, Julie
Sebastia, Laura | | Ordered Landmarks in Planning
In: Journal of Artificial Intelligence Research [22], 215-278 | |
| Reliable Computing
- | 2004 | Jaulin, Luc
Ratschan, Stefan
Hardouin, Laurent | | Set Computation for Nonlinear Control
In: Reliable Computing [10], 1-26 | |
| Theory and Practice of Logic Programming (TPLP)
1471-0684 | 2004 | Podelski, Andreas | | Introduction to the Special Issue on Verification and Computational Logic
In: Theory and Practice of Logic Programming (TPLP) [4], 541-751 | |
| ACM Transactions on Computational Logic
- | 2004 | Ratschan, Stefan | | Convergent Approximate Solving of First-order Constraints by Approximate Quantifiers
In: ACM Transactions on Computational Logic [5], 264-281 | |
| Annals of Mathematics and Artificial Intelligence
1012-2443 | 2004 | Schmidt, Renate A.
Tishkovsky, Dmitry | | Multi-Agent Dynamic Logics with Informational Test
In: Annals of Mathematics and Artificial Intelligence [42], 5-36 | |
| Studia Logica
0039-3215 | 2004 | Schmidt, Renate A.
Tishkovsky, Dmitry
Hustadt, Ullrich | | Interaction between Knowledge, Action and Commitment within Agent Dynamic Logic
In: Studia Logica [78], 381-415 | |
| Journal of Symbolic Computation
0747-7171 | 2003 | Avenhaus, Jürgen
Hillenbrand, Thomas
Löchner, Bernd | | On Using Ground Joinable Equations in Equational Theorem Proving
In: Journal of Symbolic Computation [36], 217-233 | |
| Theoretical Computer Science
0304-3975 | 2003 | Charatonik, Witold
Dal Zilio, Silvano
Gordon, Andrew Donald
Mukhopadhyay, Supratik
Talbot, Jean-Marc | | Model checking mobile ambients
In: Theoretical Computer Science [308], 277-331 | |
| Journal of Symbolic Computation
0747-7171 | 2003 | de Nivelle, Hans
de Rijke, Maarten | | Deciding the Guarded Fragments by Resolution
In: Journal of Symbolic Computation [35], 21-58 | |
| Journal of Artificial Intelligence Research
1076-9757 | 2003 | Hoffmann, Jörg | | The Metric-FF Planning System: Translating ``Ignoring Delete Lists'' To Numeric State Variables
In: Journal of Artificial Intelligence Research [20], 51 | |
| Information and Computation
- | 2003 | Korovin, Konstantin
Voronkov, Andrei | | Orienting rewrite rules with the Knuth-Bendix order
In: Information and Computation [183], 165-186 | |
| International Journal on Software Tools for Technology Transfer (STTT)
1433-2779 | 2003 | Podelski, Andreas
Ball, Tom
Rajamani, Sriram K. | | Boolean and Cartesian Abstraction for Model Checking C Programs
In: International Journal on Software Tools for Technology Transfer (STTT) [5], 1-15 | |
| Journal of Symbolic Computation
0747-7171 | 2003 | Sofronie-Stokkermans, Viorica | | Resolution-based decision procedures for the universal theory of some classes of distributive lattices with operators
In: Journal of Symbolic Computation [36], 891-924 | |
| Journal of Automated Reasoning
0168-7433 | 2002 | Bezem, Marc
Hendriks, Dimitri
de Nivelle, Hans | | Automated Proof Construction in Type Theory using Resolution
In: Journal of Automated Reasoning [29], 253-275 | |
| Information and Computation
0890-5401 | 2002 | Charatonik, Witold
Podelski, Andreas | | Set Constraints with Intersection
In: Information and Computation [179], 213-229 | |
| Autonomous Agents and Multi-Agent Systems
1387-2532 | 2002 | Lang, Jérôme
van der Torre, Leendert W. N.
Weydert, Emil | | Utilitarian Desires
In: Autonomous Agents and Multi-Agent Systems [5], 329-363 | |
| AI Communications
0921-7126 | 2002 | Löchner, Bernd
Hillenbrand, Thomas | | A Phytography of WALDMEISTER
In: AI Communications [15], 127-133 | |
| Information and Computation
- | 2002 | Vorobyov, Sergei | | The undecidability of the first-order theories of one step rewriting in linear canonical systems
In: Information and Computation [175], 182-213 | |
| Theoretical Computer Science
- | 2002 | Vorobyov, Sergei | | $\forall\exists^5$-equational theory of context unification is undecidable
In: Theoretical Computer Science [275], 463-479 | |
| Journal of Symbolic Computation
0747-7171 | 2002 | Waldmann, Uwe | | Cancellative Abelian Monoids and Related Structures in Refutational Theorem Proving (Part II)
In: Journal of Symbolic Computation [33], 831-861 | |
| Journal of Symbolic Computation
0747-7171 | 2002 | Waldmann, Uwe | | Cancellative Abelian Monoids and Related Structures in Refutational Theorem Proving (Part I)
In: Journal of Symbolic Computation [33], 777-829 | |
