MPI-INF Logo
Publications

Server    halma.mpi-inf.mpg.de

Publications

Entries sorted by: 5. Year - 4. All Years - 3. University Format

Login to this database


 

Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)


Show entries starting with: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Author/Editor [Non Institute]YearTitleType
Lang, van der Torre, Weydert
(Ed: Parsons, Gmytrasiewicz)
[Lang, van der Torre]
2001Two Kinds of Conflicts between Desires (and how to resolve them)
In: Proceedings of the AAAI Symposium on Game and Decision Theoretic Agents, 54-59
Proceedings Article
Lang, van der Torre, Weydert
[-]
2002Utilitarian Desires
In: Autonomous Agents and Multi-Agent Systems [5], 329-363
Journal Article
Lee
[-]
2009Ranking functions for size-change termination
In: ACM Transactions on Programming Languages and Systems [31], 10:1-10:42
Journal Article
Lee
[-]
2004Size-change Termination AnalyzerUnpublished/Draft
Lee, Plaisted
[Lee]
1994Problem solving by searching for models with a theorem prover
In: Artificial Intelligence [69], 205-233
Journal Article
Lee, Plaisted
[Lee]
1994Use of replace rules in theorem proving
In: Methods of Logic in Computer Science [1], 217-240
Journal Article
Letz, Stenz
(Ed: Cialdea Mayer, Pirri)
[-]
2003Universal variables in disconnection tableaux
In: Automated reasoning with analytical tableaux and related methods : International Conference, TABLEAUX 2003, 117-133
Proceedings Article
Letz, Weidenbach
[Letz]
1998Paradigmen und Perspektiven der automatischen Deduktion
In: KI, Organ des Fachbereichs 1 "Künstliche Intelligenz'' der Gesellschaft für Informatik e.V. [4], 15-19
Journal Article
Leven
[-]
1998Integrating Clausal Decision Procedures in a Tactic Based Theorem Prover
Universität des Saarlandes
Thesis - Masters thesis
Levy, Veanes
[Levy]
2000On the Undecidability of Second-Order Unification
In: Information and Computation [159], 125-150
Journal Article
Lilith, Billington, Freiheit
[-]
2006Approximate Closed-Form Aggregation of a Fork-Join Structure in Generalised Stochastic Petri Nets
In: 1st International Conference on Performance Evaluation Methodologies and Tools, ??-??
Proceedings Article
Löchner, Hillenbrand
[-]
2002Attachment IconA Phytography of WALDMEISTER
In: AI Communications [15], 127-133
Journal Article
Lu, Wu
[Lu]
2000On Theorem proving in Annotated Logics
In: Journal of Applied Non-Classical Logics [10], 121-143
Journal Article
Madden
(Ed: Kapur)
[-]
1992Automated Program Transformation Through Proof Transformation
In: Proceedings of the 11th International Conference on Automated Deduction (CADE-11), 446-460
Proceedings Article
Madden
(Ed: Nebel, Dreschler-Fischer)
[-]
1994Formal Methods for Automated Program Improvement
In: KI-94: Advances in Artificial Intelligence. Proceedings of the 18th German Annual Conference on Artificial Intelligence, 367-378
Proceedings Article
Madden
[-]
1995Program improvement by proof planning
In: Proceedings of British Colloquium on Theoretical Computer Science (BCTCS 11),
Proceedings Article
Madden, Bundy
[Bundy]
1993General Proof Theoretic Techniques for Automatic
Programing
In: Proceedings of the EAST-WEST AI CONFERENCE: From
Theory to Practice - EWAIC'93,
Proceedings Article
Madden, Bundy, Smaill
[Bundy, Smaill]
1999Recursive Program Optimization Through Inductive Synthesis Proof Transformation
In: Journal of Automated Reasoning [22], 65-115
Journal Article
Madden, Green
(Ed: Calmet, Campbell)
[Green]
1995A General Technique for Automatic Optimization by Proof Planning
In: Proceedings of the 2nd International Conference on Artificial Intelligence and Symbolic Mathematical Computing (AISMC-2), 80-96
Proceedings Article
Maier
(Ed: Charatonik, Ganzinger)
[-]
2002A Framework for Circular Assume-Guarantee Rules
In: Symposium on the Effectiveness of Logic in Computer Science in Honour of Moshe Vardi, 55-58
Proceedings Article
Maier
(Ed: Gordon)
[-]
2003Compositional Circular Assume-Guarantee Rules Cannot Be Sound and Complete
In: Foundations of software science and computation structures : 6th International Conference, FOSSACS 2003, 343-357
Proceedings Article
Maier
(Ed: Marcinkowski, Tarlecki)
[-]
2004Intuitionistic LTL and a New Characterization of Safety and Liveness
In: Computer science logic : 18th International Workshop CSL 2004, 13th Annual Conference of the EACSL, 295-309
Proceedings Article
Maier
(Ed: Orejas, Spirakis, van Leeuwen)
[Orejas, Spirakis, van Leeuwen]
2001A Set-Theoretic Framework for Assume-Guarantee Reasoning
In: Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP-2001), 821-834
Proceedings Article
Maier
[-]
2004Attachment IconIntuitionistic LTL and a New Characterization of Safety and LivenessReport
Maier
[-]
2003Attachment IconA Lattice-Theoretic Framework For Circular Assume-Guarantee Reasoning
Universität des Saarlandes
Thesis - PhD thesis
Makinson, van der Torre
[Makinson]
2001Input-output logics
In: Proceedings of the 5th International Workshop on Deontic Logic in Computer Science (Deon-00),, 29
Proceedings Article
Makinson, van der Torre
[Makinson]
2000Input-output logics
In: Journal of Philosophical Logic [29], 383-408
Journal Article
Malkis, Podelski, Rybalchenko
(Ed: Barkaoui, Cavalcanti, Cerone)
[-]
2006Thread-Modular Verification is Cartesian Abstract Interpretation
In: Theoretical Aspects of Computing - ICTAC 2006 : Third International Colloquium, 183-197
Proceedings Article
Malkis, Podelski, Rybalchenko
(Ed: Gopalakrishnan, O'Leary)
[-]
2006Attachment IconThread-Modular Verification and Cartesian AbstractionUnpublished/Draft
Matthews
(Ed: Abadi, Ito)
[-]
1997Extending a logical framework with a modal connective for validity
In: Proceedings of the 3rd Symposium on Theoretical Aspects of Computer Software (TACS-97), 491-514
Proceedings Article

Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)