Max-Planck-Institut für Informatik
max planck institut
informatik
mpii logo Minerva of the Max Planck Society
 

Publications Master Template

Publications Master Template

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
Abdelwaheb, Basin, Podelski
(Ed: Nielsen, Thomas)
[-]
1998LISA: A Specification Language Based on WS2S
In: Proceedings of the 11th International Workshop on Computer Science Logic (CSL-97), 18-34
Proceedings Article
Afshordel, Hillenbrand, Weidenbach
(Ed: Nieuwenhuis, Voronkov)
[Nieuwenhuis, Voronkov]
2001Attachment IconFirst-Order Atom Definitions Extended
In: Proceedings of the 8th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR-2001), 309-319
Proceedings Article
Ahrendt, Baumgartner, de Nivelle (ed.)
(Ed: Ahrendt, Baumgartner, de Nivelle)
[-]
2006IJCAR'06 Workshop : Disproving'06: Non-Theorems, Non-Validity, Non-ProvabilityElectronic Proceedings
Althaus
[-]
1998Berechnung optimaler Steinerbäume in der Ebene
Universität des Saarlandes
Thesis - Masters thesis
Anderson, Basin
[-]
1995Deriving and Applying Logic Program Transformers
In: Algorithms, Concurrency and Knowledge (1995 Asian Computing Science Conference), 301-318
Proceedings Article
Anderson, Basin
[Anderson]
2000Program Development Schemata as Derived Rules
In: Journal of Symbolic Computation [30], 5-36
Journal Article
Antoy, Echahed, Hanus
[Antoy, Echahed]
1994A Needed Narrowing Strategy
In: Proceedings of the 21st ACM Symposium on Principles of Programming Languages (POPL'94), 268-279
Proceedings Article
Areces, de Rijke, de Nivelle
[-]
2001Resolution in modal, description and hybrid logic
In: Journal of Logic and Computation [11], 717-736
Journal Article
Argon, Delzanno, Mukhopadhyay, Podelski
(Ed: Pacholski, Ruzicka)
[Argon, Delzanno]
2001Model Checking for Communication Protocols
In: Proceedings of the 28th Annual Conference on Current Trends in Theory and Practice of Informatics (SOFSEM-2001), 160-170
Proceedings Article
Autexier
[-]
1996Heuristiken zum Beweisen von Gleichungen
Universität des Saarlandes
Thesis - Masters thesis
Avenhaus, Hillenbrand, Löchner
[Avenhaus, Löchner]
2003Attachment IconOn Using Ground Joinable Equations in Equational Theorem Proving
In: Journal of Symbolic Computation [36], 217-233
Journal Article
Ayari
[-]
1995Attachment IconA Reinterpretation of the Deductive Tableaux System in Higher-Order Logic
Universität des Saarlandes
Thesis - Masters thesis
Ayari, Basin
(Ed: Margaria, Steffen)
[-]
1996Generic System Support for Deductive Program Development
In: Second International Workshop, TACAS'96: Tools and Algorithms for the Construction and Analysis of Systems, 313-328
Proceedings Article
Ayari, Basin
(Ed: Paulson)
[-]
1995Interpretation of the Deductive Tableau in HOL
In: Proceedings of the First Isabelle Users Workshop, 91-100
Proceedings Article
Ayari, Basin
[Ayari]
2001A Higher-order Interpretation of Deductive Tableau
In: Journal of Symbolic Computation [31], 487-520
Journal Article
Baader, Ohlbach
[-]
1995A Multi-Dimensional Terminological Knowledge Representation Language
In: Journal of Applied Non-Classical Logics [5], 153-198
Journal Article
Bach
[-]
1996Attachment IconStatic analysis of functional programs via Linear Logic
Universität des Saarlandes
Thesis - Masters thesis
Bachmair, Ganzinger
(Ed: Bibel, Schmitt)
[-]
1998Equational Reasoning in Saturation-Based Theorem Proving
In: Automated Deduction: A Basis for Applications, 353-397
Part of a Book
Bachmair, Ganzinger
(Ed: Bundy)
[-]
1994Ordered Chaining for Total Orderings
In: Proceedings of the 12th International Conference on Automated Deduction (CADE-12), 435-450
Proceedings Article
Bachmair, Ganzinger
(Ed: Dershowitz, Lindenstrauss)
[-]
1995Associative-Commutative Superposition
In: Proceedings of the 4th International Workshop on Conditional and Typed Rewrite Systems (CTRS-94), 1-14
Proceedings Article
Bachmair, Ganzinger
(Ed: Jouannaud)
[-]
1994Buchberger's algorithm: a constraint-based completion procedure
In: Proceedings of the 1st International Conference on Constraints in Computational Logics (CCL'94), 285-301
Proceedings Article
Bachmair, Ganzinger
(Ed: Kaplan, Okada)
[-]
1991Completion of first-order clauses with equality by strict superposition
In: Proceedings of the 2nd International Workshop on Conditional and Typed Rewriting, 162-180
Proceedings Article
Bachmair, Ganzinger
(Ed: Kirchner, Kirchner)
[-]
1998Strict Basic Superposition
In: Proceedings of the 15th International Conference on Automated Deduction (CADE-98), 160-174
Proceedings Article
Bachmair, Ganzinger
(Ed: Robinson, Voronkov)
[Robinson, Voronkov]
2001Attachment IconResolution Theorem Proving
In: Handbook of Automated Reasoning, 19-99
Part of a Book
Bachmair, Ganzinger
(Ed: Voronkov)
[-]
1992Non-Clausal Resolution and Superposition with Selection and Redundancy Criteria
In: Logic Programming and Automated Reasoning, 273-284
Proceedings Article
Bachmair, Ganzinger
[-]
1994Rewrite-based equational theorem proving with selection and simplification
In: Journal of Logic and Computation [4], 217-247
Journal Article
Bachmair, Ganzinger
[-]
1994Rewrite Techniques for Transitive Relations
In: Proceedings of the 9th IEEE Symposium on Logic in Computer Science, 384-393
Proceedings Article
Bachmair, Ganzinger
[-]
1991Perfect model semantics for logic programs with equality
In: Proceedings International Conference on Logic Programming '91, 645-659
Proceedings Article
Bachmair, Ganzinger
[Bachmair]
1998Ordered Chaining Calculi for First-Order Theories of Transitive Relations
In: Journal of the ACM [45], 1007-1049
Journal Article
Bachmair, Ganzinger, Lynch, Snyder
(Ed: Kapur)
[-]
1992Basic Paramodulation and Superposition
In: Proceedings of the 11th International Conference on Automated Deduction (CADE-11), 462-476
Proceedings Article
Bachmair, Ganzinger, Lynch, Snyder
[Lynch, Snyder]
1995Basic Paramodulation
In: Information and Computation [121], 172-192
Journal Article
Bachmair, Ganzinger, Stuber
(Ed: Astesiano, Reggio, Tarlecki)
[-]
1995Combining Algebra and Universal Algebra in First-Order Theorem Proving: The Case of Commutative Rings
In: Recent Trends in Data Type Specification. 10th Workshop on Specification of Abstract Data Types Joint with the 5th COMPASS Workshop, 1-29
Proceedings Article
Bachmair, Ganzinger, Voronkov
(Ed: Kirchner, Kirchner)
[-]
1998Elimination of Equality via Transformation with Ordering Constraints
In: Proceedings of the 15th International Conference on Automated Deduction (CADE-98), 175-190
Proceedings Article
Bachmair, Ganzinger, Waldmann
(Ed: Gottlob, Leitsch, Mundici)
[Bachmair, Gottlob, Leitsch, Mundici]
1993Superposition with simplification as a decision procedure for the monadic class with equality
In: Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, KGC'93, 83-96
Proceedings Article
Bachmair, Ganzinger, Waldmann
(Ed: Kirchner, Levi)
[-]
1992Theorem proving for hierarchic first-order theories
In: Algebraic and Logic Programming, 420-434
Proceedings Article
Bachmair, Ganzinger, Waldmann
[-]
1994Refutational Theorem Proving for Hierarchic First-Order Theories
In: Applicable Algebra in Engineering, Communication and Computing (AAECC) [5], 193-212
Journal Article
Bachmair, Ganzinger, Waldmann
[Bachmair]
1993Set Constraints are the Monadic Class
In: Eighth Annual IEEE Symposium on Logic in Computer Science, 75-83
Proceedings Article
Backes
[-]
2005Programmanalyse des XRTL Zwischencodes
Universität des Saarlandes
Thesis - PhD thesis
Backes, Wetzel
(Ed: Bosma)
[Wetzel]
2000New Results on Lattice Basis Reduction in Practice
In: Proceedings of the 4th International Algorithmic Number Theory Symposium (ANTS-IV), 135-152
Proceedings Article
Backes, Wetzel
(Ed: Näher, Wagner)
[Wetzel]
2001Lattice Basis Reduction with Dynamic Approximation
In: Proceedings of the 4th Workshop On Algorithm Engineering (WAE-2000), 63-73
Proceedings Article
Ball, Podelski, Rajamani
(Ed: Margaria, Yi)
[Ball, Rajamani]
2001Boolean and Cartesian Abstraction for Model Checking C Programs
In: Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS-2001), 268-283
Proceedings Article
Barnett, Basin, Hesketh
[-]
1993A Recursion Planning Analysis of Inductive Completion
In: Annals of Mathematics and Artificial Intelligence [8], 363-381
Journal Article
Barth
(Ed: Benhamou, Colmerauer, Smolka)
[-]
1993A Complete Symbolic 0-1 Constraint Solver
In: 3rd Workshop on Constraint Logic Programming (WCLP '93), ?
Proceedings Article
Barth
(Ed: Jouannaud)
[-]
1994Simplifying Clausal Satisfiability Problems
In: Proceedings of the 1st International Conference on Constraints in Computational Logics (CCL'94), 19-33
Proceedings Article
Barth
(Ed: Voronkov)
[-]
1993Linear 0-1 Inequalities and Extended Clauses
In: Proceedings~4th International~Conference on Logic Programming and Automated Reasoning LPAR '93, 40-51
Proceedings Article
Barth
[-]
1995Logic-based 0-1 constraint programmingBook
Barth
[-]
1995Logic-based 0-1 Constraint Solving in Constraint Logic Programming
Fachbereich Informatik, Universität des Saarlandes, Germany
Thesis - PhD thesis
Barth, Bockmayr
(Ed: Sterling)
[-]
1995Finite domain and cutting plane techniques in CLP($\cal PB$)
In: Proceedings of the Twelfth International Conference on Logic Programming, 133-147
Proceedings Article
Barth, Bockmayr
[-]
1997PLAM: ProLog and Algebraic Modelling
In: Proceedings of the 5th International Conference on the Practical Application of Prolog, 73-82
Proceedings Article
Barth, Bockmayr
[-]
1996Modelling 0-1 Problems in CLP($\cal PB$)
In: Proceedings of the Second International Conference on Practical Application of Constraint Technology, 1-9
Proceedings Article
Barth, Bockmayr
[-]
1995Pseudo-Boolean Constraint Logic Programming
In: Computational Logic. The Newsletter of the European Network in Computational Logic [2], 52-53
Journal Article
Barth, Bockmayr
[-]
1994Global Consistency in CLP($\cal PB$)
In: Proceedings of the 10th Workshop Logic Programming WLP'94, 4
Proceedings Article
Barth, Bockmayr
[-]
1993Solving 0-1 Problems in CLP($\cal PB$)
In: Proceedings 9th Conference on Artificial Intelligence for Applications (CAIA), 263-269
Proceedings Article
Barth, Bockmayr
[Barth]
1998Modelling Discrete Optimisation Problems in Constraint Logic Programming
In: Annals of Operations Research [81], 467-496
Journal Article
Barth, Kleine Büning, Weidenbach
(Ed: Dreschler-Fischer, Pribbenow)
[Kleine Büning]
1995Workshop CPL Computational Propositional Logic
In: KI-95 Activities: Workshops, Posters, Demos, 71-72
Proceedings Article
Basin
(Ed: Fribourg, Turini)
[-]
1994Logic Frameworks for Logic Programs
In: Proceedings of the 4th International Workshop on Logic Program Synthesis and Transformation - Meta Programming in Logic (LOPSTR'94 and META'94), 1-16
Proceedings Article
Basin
(Ed: Van Hentenryck)
[-]
1994IsaWhelk: Whelk Interpreted in Isabelle
In: Proceedings of the 11th International Conference on Logic Programming (ICLP'94), 741-741
Proceedings Article
Basin
[-]
1995Thema der Antrittsvorlesung: MONA - Ein Werkzeug zur Systemverifikation und -entwicklung
Universität des Saarlandes
Thesis - Habilitation thesis
Basin
[-]
1994A Term Equality Problem Equivalent to Graph Isomorphism
In: Information Processing Letters [51], 61-66
Journal Article
Basin
[-]
1994Generalized Rewriting in Type Theory
In: Journal of Information Processing and Cybernetics [30], 249-259
Journal Article
Basin, Brown, Leeser
[-]
1991Formally Verified Synthesis of Combinational CMOS Circuits
In: Integration: The Intern. Journal of VLSI Design [11], 235-250
Journal Article
Basin, Bundy, Kraan, Matthews
[-]
1993A Framework for Program Development Based on Schematic Proof
In: Proc. 7th Intern.~Workshop on Software Specification and Design, 162-171
Proceedings Article
Basin, Constable
(Ed: Huet, Plotkin)
[-]
1993Metalogical Frameworks
In: Logical Environments, 1-29
Part of a Book
Basin, Friedrich
(Ed: von Wright, Grundy, Harrison)
[von Wright, Grundy, Harrison]
1996Modeling a hardware synthesis methodology in Isabelle
In: Theorem Proving in Higher Order Logics. 9th International Conference, TPHOLs'96, 33-50
Proceedings Article
Basin, Friedrich
[-]
1999Modeling a Hardware Synthesis Methodology in Isabelle
In: Formal Methods in Systems Design [15], 99-122
Journal Article
Basin, Ganzinger
[-]
2001Attachment IconAutomated Complexity Analysis Based on Ordered Resolution
In: Journal of the ACM [48], 70-109
Journal Article
Basin, Ganzinger
[-]
1996Complexity Analysis Based on Ordered Resolution
In: Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science (LICS'96), 456-465
Proceedings Article
Basin, Giunchiglia, Kaufmann (ed.)
(Ed: Basin, Giunchiglia, Kaufmann)
[Giunchiglia, Kaufmann]
1994Proceedings of the Workshop on Correctness and Metatheoretic Extensibility of Automated Reasoning SystemsReport
Basin, Giunchiglia, Traverso
(Ed: Ardizzone, Gaglio, Sorbello)
[-]
1991Automating Meta-Theory Creation and System Extension
In: Proc. Trends in AI: 2nd Congress of the Italian Association for Artificial Intelligence (AI*IA), 48-57
Proceedings Article
Basin, Howe
(Ed: Ito, Meyer)
[-]
1991Some Normalization Properties of Martin-Löf's Type Theory, and Applications
In: International Conference on Theoretical Aspects of Computer Software (TACS '91), 475-494
Proceedings Article
Basin, Kaufmann
(Ed: Huet, Plotkin)
[-]
1991The Boyer-Moore Prover and Nuprl: An Experimental Comparison
In: Logical Frameworks, 90-119
Proceedings Article
Basin, Klarlund
[Klarlund]
1998Automata Based Symbolic Reasoning in Hardware Verification
In: Formal Methods in Systems Design [13], 255-288
Journal Article
Basin, Klarlund
[Klarlund]
1995Hardware Verification using Monadic Second-Order Logic
In: Proceedings of the 7th International Conference on Computer-Aided Verification (CAV '95), 31-41
Proceedings Article
Basin, Krieg-Brückner
(Ed: Astesiano, Kreowski, Krieg-Brückner)
[Astesiano, Kreowski, Krieg-Brückner]
1999Formalization of the Development Process
In: Algebraic foundations of systems specification, 521-562
Part of a Book
Basin, Matthews
(Ed: Gabbay, Guenthner)
[-]
2002Logical Frameworks
In: Handbook of Philosophical Logic, 89-164
Part of a Book
Basin, Matthews
(Ed: McRobbie, Slaney)
[McRobbie, Slaney]
1996Structuring metatheory on inductive definitions
In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), 171-185
Proceedings Article
Basin, Matthews
(Ed: Shyamasundar)
[-]
1993A Conservative Extension of First-Order Logic and its Applications to Theorem Proving
In: Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'93), 151-160
Proceedings Article
Basin, Matthews
[-]
1996Adding Metatheoretic facilities to First-order Theories
In: Journal of Logic and Computation [6], 835-849
Journal Article
Basin, Matthews, Viganò
(Ed: Baader, Schulz)
[-]
1996A Topography of Labelled Modal Logics
In: Frontiers of Combining Systems (First International Workshop, Munich, March 1996), 75-92
Part of a Book
Basin, Matthews, Viganò
(Ed: Brewka, Habel, Nebel)
[-]
1997Labelled quantified modal logics
In: Proceedings of the 21st Annual German Conference on Artificial Intelligence (KI-97): Advances in Artificial Intelligence, 171-182
Proceedings Article
Basin, Matthews, Viganò
(Ed: Carlucci-Aiello, Doyle, Shapiro)
[-]
1996Implementing Modal and Relevance Logics in a Logical Framework
In: Proceedings of the 5th International Conference on Principles of Knowledge Representation and Reasoning (KR'96), 386-397
Proceedings Article
Basin, Matthews, Viganò
(Ed: Ginzburg, Khasidashvili, Vogel, Levy, Vallduvi)
[Basin, Viganò]
1998A Modular Presentation of Modal Logics in a Logical Framework
In: Proceedings of the 1st Tbilisi Symposium on Language, Logic and Computation: Selected Papers, 293-307
Proceedings Article
Basin, Matthews, Viganò
(Ed: Gottlob, Leitsch, Mundici)
[-]
1997A New Method for Bounding the Complexity of Modal Logics
In: Proceedings of the 5th Kurt Gödel Colloquium on Computational Logic and Proof Theory (KGC-97), 89-102
Proceedings Article
Basin, Matthews, Viganò
[-]
1998Natural Deduction for Non-Classical Logics
In: Studia Logica [60], 119-160
Journal Article
Basin, Matthews, Viganò
[-]
1997Labelled Propositional Modal Logics: Theory and Practice
In: Journal of Logic and Computation [7], 685-717
Journal Article
Basin, Matthews, Viganò
[Basin, Viganò]
1998Labelled Modal Logics: quantifiers
In: Journal of Logic, Language and Information [7], 237-263
Journal Article
Basin, Walsh
(Ed: Bajcsy)
[-]
1993Difference Unification
In: Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI-93), 116-122
Proceedings Article
Basin, Walsh
(Ed: Bundy)
[Walsh]
1994Termination Orderings for Rippling
In: Proceedings of the 12th International Conference On Automated Deduction (CADE-12), 466-483
Proceedings Article
Basin, Walsh
(Ed: Kapur)
[-]
1992Difference Matching
In: Proceedings of the11th International Conference on Automated Deduction (CADE-11), 295-309
Proceedings Article
Basin, Walsh
(Ed: Zhang)
[Walsh]
1996A Calculus for and Termination of Rippling
In: Automated mathematical induction, 147-180
Part of a Book
Basin, Walsh
[Walsh]
1996A Calculus for and Termination of Rippling
In: Journal of Automated Reasoning [16], 147-180
Journal Article
Baumeister
(Ed: Abramsky, Maibaum)
[-]
1991Unifying 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
Proceedings Article
Baumeister
(Ed: Mosses, Nielsen, Schwartzbach)
[-]
1995Relations as Abstract Datatypes: An Institution to Specify Relations between Algebras
In: Proceedings of the 6th Joint Conference on Theory and Practice of Software Development (TAPSOFT '95), 756-771
Proceedings Article
Baumeister
[-]
1999Attachment IconRelations between Abstract Datatypes modeled as Abstract Datatypes
Universität des Saarlandes
Thesis - PhD thesis
Baumeister
[-]
1990Attachment IconÜber die Stabilität parameterisierter algebraischer Spezifikationen
Universität Dortmund
Thesis - Masters thesis
Baumgartner, Burchardt
(Ed: Alferes, Leite)
[-]
2004Logic Programming Infrastructure for Inferences on FrameNet
In: Logics in artificial intelligence : 9th European Conference, JELIA 2004, 591-603
Proceedings Article
Baumgartner, Fuchs, Tinelli
(Ed: Schulz, Tammet, Sutcliffe)
[-]
2004Darwin: A Theorem Prover for the Model Evolution Calculus
In: Proceedings of the 1st Workshop on Empirically Successful First Order Reasoning (ESFOR'04), 1-24
Proceedings Article
Baumgartner, Fuchs, Tinelli
[-]
2006Implementing the Model Evolution Calculus
In: International Journal on Artificial Intelligence Tools [15], 21-52
Journal Article
Baumgartner, Furbach
(Ed: Hutter, Stephan)
[-]
2005Living Books, Automated Deduction and other Strange Things
In: Mechanizing Mathematical Reasoning: Techniques, Tools and Applications - Essays in honour of Jörg H. Siekmann, 255-274
Part of a Book
Baumgartner, Furbach, Gross-Hardt, Kleemann
(Ed: Biundo, Frühwirth, Palm)
[-]
2004Model Based Deduction for Database Schema Reasoning
In: KI 2004: Advances in Artificial Intelligence: 27th Annual German Conference on AI, KI 2004, 168-182
Proceedings Article
Baumgartner, Furbach, Gross-Hardt, Kleemann
(Ed: Seipel, Hanus, Geske, Bartenstein)
[-]
2005Optimizing the Evaluation of XPath Using Description Logics
In: Applications of Declarative Programming and Knowledge Management: 15th International Conference on Applications of Declarative Programming and Knowledge Management, INAP 2004, and 18th Workshop on Logic Programming, WLP 2004, 1-15
Proceedings Article
Baumgartner, Furbach, Gross-Hardt, Sinner
[-]
2004Living Book -- Deduction, Slicing, and Interaction
In: Journal of Automated Reasoning [32], 259-286
Journal Article
Baumgartner, Furbach, Yahya
[-]
2005Automated Reasoning, Knowledge Representation and Management
In: KI - Künstliche Intelligenz [1], 5-11
Journal Article
Baumgartner, Grabowski, Oevel, Melis
[-]
2004In2Math - Interaktive Mathematik- und Informatikgrundausbildung
In: Softwaretechnik-Trends [24], 36-45
Journal Article
Baumgartner, Mediratta
(Ed: Sasikumar, Vakil, Kavitha)
[-]
2004Improving Stable Models Based Planning by Bidirectional Search
In: Proceedings of the 5th International Conference on Knowledge Based Computer Systems (KBCS 2004), 404-413
Proceedings Article
Baumgartner, Suchanek
[-]
2005Attachment IconModel-Generation Theorem Proving for First-Order Logic OntologiesUnpublished/Draft
Baumgartner, Tinelli
(Ed: Nieuwenhuis)
[-]
2005The Model Evolution Calculus with Equality
In: Automated deduction - CADE-20 : 20th International Conference on Automated Deduction, 392-408
Proceedings Article
Becker
[-]
1994Attachment IconEffiziente Subsumption in Deduktionssystemen
Universität des Saarlandes
Thesis - Masters thesis
Ben-Amram, Lee
[-]
2007Program termination analysis in polynomial time
In: ACM Transactions on Programming Languages and Systems [29], 5:1-37
Journal Article
Bertling, Ganzinger, Schäfers, Nieuwenhuis, Orejas
(Ed: Hoffmann, Krieg-Brückner)
[-]
1993Completion Subsystem
In: Program Development by Specification and Transformation, The PROSPECTRA Methodology, Language Family, and System, 460-494
Part of a Book
Beyer, Henzinger, Majumdar, Rybalchenko
(Ed: Cook, Podelski)
[-]
2007Invariant Synthesis for Combined Theories
In: Verification, Model Checking, and Abstract Interpretation : 8th International Conference, VMCAI 2007, 378-394
Proceedings Article
Beyer, Henzinger, Majumdar, Rybalchenko
(Ed: Ferrante, McKinley)
[-]
2007Attachment IconPath Invariants
In: PLDI'07 : Proceedings of the ACM SIGPLAN 2007 Conference on Programming Language Design and Implementation, 300-309
Proceedings Article
Bezem, Hendriks, de Nivelle
[-]
2002Automated Proof Construction in Type Theory using Resolution
In: Journal of Automated Reasoning [29], 253-275
Journal Article
Blackburn, Tzakova
(Ed: Boros, Greiner)
[Blackburn, Boros, Greiner]
1998A Hybrid Concept Language
In: Proceedings of the 5th International Symposium on Artificial Intelligence and Mathematics, ?
Proceedings Article
Blackburn, Tzakova
[Blackburn]
1999Hybrid Languages and Temporal Logic
In: Logic Journal of the IGPL [7], 27-54
Journal Article
Blackburn, Tzakova
[Blackburn]
1998Hybrid Completeness
In: Logic Journal of the IGPL [6], 625-650
Journal Article
Blackburn, Tzakova
[Blackburn]
1998Hybrid Languages and Temporal Logic (Full Version)Report
Blackburn, Tzakova
[Blackburn]
1998Hybridizing Concept Languages
In: Annals of Mathematics and Artificial Intelligence [24], 23-49
Journal Article
Blanchet, Podelski
(Ed: Gordon)
[-]
2003Verification of Cryptographic Protocols: Tagging Enforces Termination
In: Foundations of software science and computation structures : 6th International Conference, FOSSACS 2003, 136-152
Proceedings Article
Blanchet, Podelski
[-]
2005Verification of Cryptographic Protocols: Tagging Enforces Termination
In: Theoretical Computer Science [333], 67-90
Journal Article
Bockmayr
(Ed: Bachem, )
[-]
1994Using Strong Cutting Planes in Constraint Logic Programming (Extended Abstract)
In: Operations Research '93, 18th Symposium on Operations Research, 47-49
Proceedings Article
Bockmayr
(Ed: Benhamou, Colmerauer)
[-]
1993Logic Programming with Pseudo-Boolean Constraints
In: Constraint Logic Programming---Selected Research, 327-350
Proceedings Article
Bockmayr
(Ed: Benhamou, Colmerauer, Smolka)
[-]
19930-1 Constraints and 0-1 Optimization
In: 3rd Workshop on Constraint Logic Programming (WCLP '93), ?
Proceedings Article
Bockmayr
(Ed: Hanus, Lloyd, Moreno Navarro)
[Hanus, Lloyd, Moreno Navarro]
1996Constraints in functional logic programming (Abstract)
In: Integration of functional and logic languages, 4
Proceedings Article
Bockmayr
(Ed: Karmann, Mosler, Schader, Uebe)
[-]
1993Embedding OR Techniques in Constraint Logic Programming
In: Operations Research '92. 17th Symposium on Operations Research, 252-254
Proceedings Article
Bockmayr
(Ed: Podelski)
[-]
1995Solving pseudo-Boolean constraints
In: Constraint Programming: Basics and Trends, 22-38
Proceedings Article
Bockmayr
(Ed: Schulz)
[-]
1992Algebraic and Logical Aspects of Unification
In: Proc.~1st Workshop on Word Equations and Related Topics, 171-180
Proceedings Article
Bockmayr
(Ed: Schulz)
[-]
1992Model-Theoretic Aspects of Unification
In: Proceedings of the 1st Workshop on Word Equations and Related Topics, 181-196
Proceedings Article
Bockmayr
(Ed: Tchuente)
[-]
1992A Theoretical Basis for Constraint Logic and Functional Programming
In: Proc.~1st African Conference on Research in Computer Science, 793-804
Proceedings Article
Bockmayr
[-]
1996Gleichheit und Constraints in der Logikprogrammierung
Universität des Saarlandes
Thesis - Habilitation thesis
Bockmayr
[-]
1994Cutting planes in constraint logic programming (Abstract)
In: Proceedings of the 3rd International Symposium Artificial Intelligence and Mathematics,
Proceedings Article
Bockmayr
[-]
1993Conditional Narrowing Modulo a Set of Equations
In: Applicable Algebra in Engineering, Communication and Computing [4], 147-168
Journal Article
Bockmayr, Barth, Kasper
(Ed: Steinbach)
[Steinbach]
1996Methods and Tools for Pseudo-Boolean Problems
In: 2. Workshop Boolesche Probleme, 105-109
Proceedings Article
Bockmayr, Brzoska, Deussen, Varsek
[-]
1991KA-Prolog: Erweiterungen einer logischen Programmiersprache und ihre effiziente Implementierung
In: Informatik--Forschung und Entwicklung [6], 128-140
Journal Article
Bockmayr, Dimopoulos
(Ed: Frank, Sabin)
[Frank, Sabin]
1998Mixed Integer Programming Models for Planning Problems
In: Proceedings of the Workshop on Constraint Problem Reformulation (CP-98), 1-6
Proceedings Article
Bockmayr, Eisenbrand
[Bockmayr]
2001Cutting planes and the elementary closure in fixed dimension
In: Mathematics of Operations Research [26], 304-312
Journal Article
Bockmayr, Eisenbrand, Hartmann, Schulz
[Hartmann, Schulz]
1999On the Chvátal Rank of Polytopes in the 0/1 Cube
In: Discrete Applied Mathematics [98], 21-27
Journal Article
Bockmayr, Kasper
(Ed: Geske, Simonis)
[Geske, Simonis]
1996Pseudo-Boolean and Finite Domain Constraint Programming: A Case Study
In: Deklarative Constraint Programmierung, 29-41
Proceedings Article
Bockmayr, Kasper
[-]
1998Branch-and-Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
In: INFORMS Journal on Computing [10], 287-300
Journal Article
Bockmayr, Krischer, Werner
[Krischer, Werner]
1995Narrowing strategies for arbitrary canonical systems
In: Fundamenta Informaticae [24], 125-155
Journal Article
Bockmayr, Radermacher
(Ed: Herzog, Christaller, Schütt)
[-]
1993Künstliche Intelligenz und Operations Research
In: Grundlagen und Anwendungen der Künstlichen Intelligenz. 17. Fachtagung für Künstliche Intelligenz, 249-254
Proceedings Article
Bockmayr, Weispfenning
(Ed: Robinson, Voronkov)
[Robinson, Voronkov, Weispfenning]
2001Solving numerical constraints
In: Handbook of Automated Reasoning, 751-842
Part of a Book
Bockmayr, Werner
(Ed: Dershowitz, Lindenstrauss)
[Werner]
1995LSE narrowing for decreasing conditional term rewrite systems
In: Conditional Term Rewriting Systems CTRS'94, 51-70
Proceedings Article
Booth
(Ed: Baral, Truszczynski)
[Baral, Truszczynski]
2000Attachment IconThe lexicographic closure as a revision process
In: Proceedings of the 8th International Workshop on Non-Monotonic Reasoning (NMR 2000), ?
Electronic Proceedings Article
Booth
[-]
2001The lexicographic closure as a revision process
In: Journal of Applied Non-Classical Logics [11], 35-58
Journal Article
Bozkurt
[-]
1995Strategien für Resolutionsbeweiser in Logik höherer Stufe
Universität des Saarlandes
Thesis - Masters thesis
Bozzano, Delzanno, Martelli, Mascardi, Zini
(Ed: Apt, Marek, Truszczynski, Warren)
[Bozzano, Martelli, Mascardi, Zini]
1999Logic Programming and Multi-Agent Systems: a Synergic Combination for Applications and Semantics
In: The Logic Programming Paradigm: a 25-Year Perspective, 5-32
Part of a Book
Bozzano, Delzanno, Martelli, Mascardi, Zini
(Ed: Gupta)
[Bozzano, Martelli, Mascardi, Zini]
1999Multi-Agent Systems Development as a Software Engineering Enterprise
In: Proceedings of the 1st International Workshop on Practical Aspects of Declarative Languages (PADL-99), 46-60
Proceedings Article
Brafman, Hoffmann
(Ed: Zilberstein, Koehler, Koenig)
[-]
2004Conformant Planning via Heuristic Forward Search: A New Approach
In: Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling (ICAPS 2004), 355-364
Proceedings Article
Brahm
[-]
2013Möglichkeiten des Groupware-Einsatzes im Umfeld des Wissenschaftlerarbeitsplatzes am Beispiel des Max-Planck-Instituts für Informatik
Universität des Saarlandes
Thesis - Masters thesis
Brahm
[-]
2006Attachment IconEine integrierte Publikationsverwaltung am Beispiel des Max-Planck-Instituts für InformatikMiscellaneous
Brahm, Pitz
[Pitz]
1990Parkwächter
In: c't Magazin für computer technik [-], 252-253
Journal Article
Brinker
[-]
2000Geometrisches Schließen mit SPASS
Universität des Saarlandes
Thesis - Masters thesis
Brink, Britz, Schmidt
(Ed: Nivat, Rattray, Rus, Scollo)
[Brink, Britz]
1994Peirce Algebras: Extended Abstract
In: Proceedings of the 3rd International Conference on Algebraic Methodology and Software Technology (AMAST '93), 163-166
Proceedings Article
Brink, Britz, Schmidt
[Brink, Britz]
1994Peirce Algebras
In: Formal Aspects of Computing [6], 339-358
Journal Article
Brink, Gabbay, Ohlbach
[Brink]
1994Towards Automating Duality
In: Journal of Computers and Mathematics with Applications [29], 73-90
Journal Article
Brink, Rewitzky, Schmidt
[-]
1991Autodescriptivity: Beware!
In: The Computer Journal [34], 380-381
Journal Article
Buchmann, Eisenbrand
[Buchmann]
1999On Factor Refinement in Number Fields
In: Mathematics of Computation [68], 345-350
Journal Article
Bugliesi, Delzanno, Liquori, Martelli
[Bugliesi, Liquori, Martelli]
2000Object Calculi in Linear Logic
In: Journal of Logic and Computation [10], 75-104
Journal Article
Bundy, Lombart
(Ed: Mellish)
[Lombart]
1995Relational Rippling: a General Approach
In: Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95), 175-181
Proceedings Article
Cantu, Bundy, Smaill, Basin
(Ed: Srivas, Camilleri)
[Cantu, Bundy, Smaill, Srivas, Camilleri]
1996Experiments in Automating Hardware Verification using Inductive Proof Planning
In: Proceedings of the Formal Methods for Computer-Aided Design Conference (FMCAD'96), 94-108
Proceedings Article
Chadha, Plaisted
[-]
1993On the mechanical derivation of loop invariants
In: Journal of Symbolic Computation [15], 705-744
Journal Article
Chadha, Plaisted
[Chadha]
1994Correctness of unification without occur check in Prolog
In: Journal of Logic Programming [18], 99-122
Journal Article
Charatonik
(Ed: Smolka)
[Smolka]
2000Directional Type Checking for Logic Programs: Beyond Discriminative Types
In: Proceedings of the 8th European Symposium on Programming (ESOP-00), 72-87
Proceedings Article
Charatonik
[-]
2002Direktionale Typen in der Logischen Programmierung
Universität des Saarlandes
Thesis - Habilitation thesis
Charatonik
[-]
1998An Undecidable Fragment of the Theory of Set Constraints
In: Information Processing Letters [68], 147-151
Journal Article
Charatonik
[-]
1998Set Constraints in Some Equational Theories
In: Information and Computation [142], 40-75
Journal Article
Charatonik, Amadio
(Ed: Brim, Jancar, Kretinsky, Kucera)
[-]
2002On Name Generation and Set-Based Analysis in the Dolev-Yao Model
In: CONCUR 2002 - Concurrency Theory. 13th International Conference, 499-514
Proceedings Article
Charatonik, Dal Zilio, Gordon, Mukhopadhyay, Talbot
(Ed: Honsell, Miculan)
[-]
2001The Complexity of Model Checking Mobile Ambients
In: Foundations of Software Science and Computation Structures. Proceedings of the 4th International Conference (FOSSACS-01). Held as Part of the Joint European Conferences on Theory and Practice of Software (ETAPS-01), 152-167
Proceedings Article
Charatonik, Dal Zilio, Gordon, Mukhopadhyay, Talbot
[-]
2003Model checking mobile ambients
In: Theoretical Computer Science [308], 277-331
Journal Article
Charatonik, Dal Zilio, Gordon, Mukhopadhyay, Talbot
[Dal Zilio, Gordon, Talbot]
2001The Complexity of Model Checking Mobile AmbientsReport
Charatonik, Georgieva, Maier
(Ed: Ong)
[-]
2005Bounded Model Checking of Pointer Programs
In: Computer Science Logic; 19th International Workshop, CSL 2005; 14th Annual Conference of the EACSL, 397-412
Proceedings Article
Charatonik, Gordon, Talbot
(Ed: Le Métayer)
[-]
2002Finite-Control Mobile Ambients
In: Programming languages and systems: 11th European Symposium on Programming, ESOP 2002. Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2002, 295-313
Proceedings Article
Charatonik, McAllester, Niwinski, Podelski, Walukiewicz
(Ed: Pratt)
[McAllester, Niwinski, Walukiewicz, Pratt]
1998The Horn Mu-calculus
In: Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science (LICS-98), 58-69
Proceedings Article
Charatonik, Mukhopadhyay, Podelski
(Ed: Cortesi)
[-]
2002Compositional Termination Analysis of Symbolic Forward Analysis
In: Verification, Model Checking, and Abstract Interpretation. Third International Workshop, VMCAI 2002, 109-125
Proceedings Article
Charatonik, Mukhopadhyay, Podelski
(Ed: Stuckey)
[-]
2002Constraint-Based Infinite Model Checking and Tabulation for Stratified CLP
In: Logic Programming. 18th International Conference, ICLP 2002, 115-129
Proceedings Article
Charatonik, Podelski
(Ed: Freuder)
[Freuder]
1996The Independence Property of a Class of Set Constraints
In: Principles and Practice of Constraint Programming, Proceedings of the Second International Conference (CP'96), 76-90
Proceedings Article
Charatonik, Podelski
(Ed: Levi)
[Levi]
1998Directional Type Inference for Logic Programs
In: Proceedings of the 5th International Symposium in Static Analysis (SAS-98), 278-294
Proceedings Article
Charatonik, Podelski
(Ed: Nipkow)
[Nipkow]
1998Co-definite Set Constraints
In: Proceedings of the 9th International Conference on Rewriting Techniques and Applications (RTA-98), 211-225
Proceedings Article
Charatonik, Podelski
(Ed: Steffen)
[Steffen]
1998Set-Based Analysis of Reactive Infinite-state Systems
In: Tools and Algorithms for the Construction and Analysis of Systems (TACAS-98), 358-375
Proceedings Article
Charatonik, Podelski
(Ed: Winskel)
[Winskel]
1997Set Constraints with Intersection
In: Proceedings of the Twelfth Annual IEEE Symposium on Logic in Computer Science (LICS-97), 362-372
Proceedings Article
Charatonik, Podelski
[-]
2002Set Constraints with Intersection
In: Information and Computation [179], 213-229
Journal Article
Charatonik, Podelski, Talbot
[-]
2000Paths vs. Trees in Set-based Program Analysis
In: Proceedings of the 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL-00), 330-337
Proceedings Article
Charatonik, Talbot
(Ed: Fribourg)
[Talbot]
2001The Decidability of Model Checking Mobile Ambients
In: Computer science logic (CSL-01) : 15th International Workshop, CSL 2001, Annual Conference of the EACSL, 339-354
Proceedings Article
Charatonik, Talbot
(Ed: Tison)
[-]
2002Atomic Set Constraints with Projection
In: Rewriting Techniques and Applications. 13th International Conference, RTA 2002, 311-325
Proceedings Article
Chaudhuri, Dimopoulos, Zaroliagis
[-]
1996On the Parallel Complexity of Acyclic Logic Programs
In: Parallel Processing Letters [6], 223-230
Journal Article
Christen
[-]
1997Attachment IconA Calculus of Simplification for Superposition
Universität des Saarlandes
Thesis - Masters thesis
Chu, Plaisted
(Ed: Bundy)
[Chu]
1994Semantically Guided First-Order Theorem Proving using Hyper-Linking
In: Proceedings of the 12th International Conference on Automated Deduction (CADE-12), 192-206
Proceedings Article
Claus, Hopf, Schwefel (ed.)
(Ed: Claus, Hopf, Schwefel)
[Claus, Schwefel]
1996Evolutionary Algorithms and their ApplicationReport
Cook, Gotsman, Podelski, Rybalchenko, Vardi
(Ed: Hofmann, Felleisen)
[-]
2007Proving that programs eventually do something good
In: 34th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2007), 265-276
Proceedings Article
Cook, Podelski, Rybalchenko
(Ed: Ball, Jones)
[-]
2006Terminator: Beyond Safety
In: Computer aided verification : 18th International Conference, CAV 2006, 415-418
Proceedings Article
Cook, Podelski, Rybalchenko
(Ed: Ferrante, McKinley)
[-]
2007Attachment IconProving Thread Termination
In: PLDI'07 : Proceedings of the ACM SIGPLAN 2007 Conference on Programming Language Design and Implementation, 320-330
Proceedings Article
Cook, Podelski, Rybalchenko
(Ed: Hankin, Siveroni)
[-]
2005Abstraction-refinement for Termination
In: Static analysis : 12th International Symposium, SAS 2005, 87-101
Proceedings Article
Cook, Podelski, Rybalchenko
[-]
2006Termination Proofs for Systems Code
In: PLDI 2006 : Proceedings of the ACM SIGPLAN 2006 Conference on Programming Language Design and Implementation, 415-426
In: ACM SIGPLAN Notices [41], 415-426
Proceedings Article
Cortier, Ganzinger, Jacquemard, Veanes
(Ed: Wiedermann, van Emde Boas, Nielsen)
[Cortier, Wiedermann, van Emde Boas, Nielsen]
1999Decidable fragments of simultaneous rigid reachability
In: Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP-99), 250-260
Proceedings Article
Cunningham, Gabbay, Ohlbach
[-]
1991Towards the MEDLAR Framework
In: ESPRIT '91 Conference Proceedings, 822-841
Proceedings Article
Cuntz, Freiheit, Kindler
(Ed: Nuettgens, Rump)
[-]
2005On the semantics of EPCs: Faster calculation for EPCs with small state spaces
In: EPK 2005 : Geschäftsprozessmanagement mit Ereignisgesteuerten Prozessketten, 7-23
Proceedings Article
Damm, Disch, Hungar, Pang, Pigorsch, Scholl, Waldmann, Wirtz
(Ed: Graf, Zhang)
[-]
2006Automatic Verification of Hybrid Systems with Large Discrete State Space
In: Automated Technology for Verification and Analysis, 4th International Symposium, ATVA 2006, 276-291
Proceedings Article
Damm, Pinto, Ratschan
(Ed: Peled, Tsay)
[-]
2005Guaranteed Termination in the Verification of LTL Properties of Non-linear Robust Discrete Time Hybrid Systems
In: Automated technology for verification and analysis : Third International Symposium, ATVA 2005, 99-113
Proceedings Article
Daum, Maus, Schirmer, Seghir
(Ed: Sutcliffe, Voronkov)
[-]
2005Attachment IconIntegration of a Software Model Checker into Isabelle
In: Logic for Programming, Artificial Intelligence, and Reasoning: 12th International Conference, LPAR 2005, 381-395
Proceedings Article
de Nivelle
(Ed: Baader)
[-]
2003Translation of Resolution Proofs into Short First-Order Proofs without Choice Axioms
In: Automated deduction, CADE-19 : 19th International Conference on Automated Deduction, 365-379
Proceedings Article
de Nivelle
(Ed: Bradfield)
[-]
2002Extraction of Proofs from the Clausal Normal Form Transformation
In: Computer Science Logic : 16th International Workshop, CSL 2002, 11th Annual Conference of the EACSL, 584-598
Proceedings Article
de Nivelle
(Ed: Faller, Kaufmann, Pauly)
[Faller, Kaufmann, Pauly]
2000An Overview of Resolution Decision Procedures
In: Formalizing the Dynamics of Information, 115-130
Proceedings Article
de Nivelle
(Ed: Konev, Schmidt)
[-]
2003Implementing the clausal normal form transformation with proof generation
In: Fourth Workshop on the Implementation of Logics, 69-83
Proceedings Article
de Nivelle
(Ed: Nieuwenhuis, Voronkov)
[Nieuwenhuis, Voronkov]
2001Splitting through New Proposition Symbols
In: Proceedings of the 8th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR-2001), 172-185
Proceedings Article
de Nivelle
[-]
2005Translation of Resolution Proofs into Short First-Order Proofs without Choice Axioms
In: Information and Computation [199], 24-54
Journal Article
de Nivelle
[-]
2000Deciding the E-plus class by an a posteriori, liftable order
In: Annals of Pure and Applied Logic [88], 219-232
Journal Article
de Nivelle, Areces, de Rijke
(Ed: Ganzinger)
[Areces, de Rijke]
1999Prefixed Resolution: A Resolution Method for Modal and Description Logics
In: Proceedings of the 16th International Conference on Automated Deduction (CADE-16), 187-201
Proceedings Article
de Nivelle, Baumgartner, Fuchs, Tinelli
(Ed: Ahrendt, Baumgartner, de Nivelle)
[-]
2006Computing Finite Models by Reduction to Function-Free Clause Logic
In: IJCAR'06 Workshop : Disproving'06: Non-Theorems, Non-Validity, Non-Provability, 82-95
Electronic Proceedings Article
de Nivelle, Bezem, Hendriks
(Ed: McAllester)
[Bezem, Hendriks, McAllester]
2000Automated Proof Construction in Type Theory Using Resolution
In: Proceedings of the 17th International Conference on Automated Deduction (CADE-17), 148-163
Proceedings Article
de Nivelle, Blackburn, Bos, Kohlhase
[Blackburn, Bos, Kohlhase]
2001Inference and Computational Semantics
In: Studies in Linguistics and Philosophy, Computing Meaning [77], 11-28
Journal Article
de Nivelle, de Rijke
[de Rijke]
2003Deciding the Guarded Fragments by Resolution
In: Journal of Symbolic Computation [35], 21-58
Journal Article
de Nivelle, Demri
(Ed: Areces, Blackburn)
[-]
2003Deciding Modal Logics through Relational Translations into GF2
In: Proceedings of the 3rd Methods for Modalities Workshop, 15-30
Proceedings Article
de Nivelle, Demri
[-]
2005Deciding Regular Grammar Logics with Converse through First-Order Logic
In: Journal of Logic, Language and Information [14], 289-329
Journal Article
de Nivelle, Demri
[-]
2003Deciding regular grammar logics with converse through first-order logicReport
de Nivelle, Hustadt, Schmidt
[Hustadt, Schmidt]
2000Resolution-Based Methods for Modal Logics
In: Logic Journal of the IGPL [8], 265-292
Journal Article
de Nivelle, Kazakov
[-]
2004Attachment IconResolution Decision Procedures for the Guarded Fragment with
Transitive Guards
Report
de Nivelle, Meng
(Ed: Furbach, Shankar)
[-]
2006Geometric Resolution: A Proof Procedure Based on Finite Model Search
In: Automated reasoning : Third International Joint Conference, IJCAR 2006, 303-317
Proceedings Article
de Nivelle, Meng
[-]
2006Geo 2006jMiscellaneous
de Nivelle, Piskac
(Ed: Aichernig, Beckert)
[-]
2005Verification of an Off-Line Checker for Priority Queues
In: Third IEEE International Conference on Software Engineering and Formal Methods (SEFM 2005), 210-219
Proceedings Article
de Nivelle, Pratt-Hartmann
(Ed: Goré, Leitsch, Nipkow)
[Pratt-Hartmann, Goré, Leitsch, Nipkow]
2001A Resolution-Based Decision Procedure for the Two-Variable Fragment with Equality
In: Automated reasoning : First International Joint Conference, IJCAR 2001, 211-225
Proceedings Article
de Nivelle, Schulz (ed.)
(Ed: de Nivelle, Schulz)
[-]
2001Proceedings of the 2nd International Workshop on the Implementation of LogicsProceedings
de Raedt, Jaeger, Lee, Mannila
[-]
2002Attachment IconA Theory of Inductive Query Answering
In: Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM'02), 123-130
Proceedings Article
Degtyarev, Gurevich, Narendran, Veanes, Voronkov
(Ed: Nipkow)
[Degtyarev, Gurevich, Narendran, Voronkov, Nipkow]
1998The Decidability of Simultaneous Rigid E-Unification with One Variable
In: Proceedings of the 9th International Conference on Rewriting Techniques and Applications (RTA-98), 181-195
Proceedings Article
Degtyarev, Gurevich, Narendran, Veanes, Voronkov
[Degtyarev, Gurevich, Narendran, Voronkov]
2000Decidability and Complexity of Simultaneous Rigid E-unification with One Variable and Related Results
In: Theoretical Computer Science [243], 167-184
Journal Article
Delahaye, Jaume, Prevosto
[-]
2005Coq, un outil pour l'enseignement
In: Technique et Science Informatiques [24], 1139-1160
Journal Article
Delzanno
(Ed: Galmiche)
[-]
1998Specification of Term Rewriting in Linear Logic
In: Proceedings of Workshop on Proof-Search in Type-Theoretic Languages, ??
Proceedings Article
Delzanno, Esparza, Podelski
(Ed: Flum, Rodríguez-Artalejo)
[Esparza, Flum]
1999Constraint-Based Analysis of Broadcast Protocols
In: Proceedings of the 13th International Workshop on Computer Science Logic (CSL-99), 8th Annual Conference on the EACSL, 50-66
Proceedings Article
Delzanno, Galmiche, Martelli
[Galmiche, Martelli]
1999A specification logic for concurrent object-oriented programming
In: Mathematical Structures in Computer Science [9], 253-286
Journal Article
Delzanno, Podelski
(Ed: Cleaveland)
[-]
1999Model Checking in CLP
In: Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS-99), 223-239
Proceedings Article
Delzanno, Podelski
[-]
2001Constraint-based Deductive Model Checking
In: International Journal on Software Tools for Technology Transfer (STTT) [3], 250-270
Journal Article
Delzanno, Raskin
(Ed: Graf, Schwartzbach)
[Raskin, Graf, Schwartzbach]
2000Symbolic Representation of Upward-Closed Sets
In: Proceedings of the 6th Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS-00); Held as Part of the European Joint Conferences on the Theory and Practice of Software (ETAPS-00), 426-440
Proceedings Article
Dimitrova
[-]
2006Model Checking with Abstraction Refinement for Well-Structured Systems
Universität des Saarlandes
Thesis - Masters thesis
Dimopoulos
(Ed: MacNish, Pearce, Pereira)
[-]
1994The Computational Value of Joint Consistency
In: Logics in Artificial Intelligence: Proceedings of the JELIA'94, 50-65
Proceedings Article
Dimopoulos
(Ed: Ras, Zemankova)
[-]
1994Classical Methods in Nonmonotonic Reasoning
In: Proceedings of the 8th International Symposium on Methodologies for Intelligent Systems (ISMIS'94), 500-510
Proceedings Article
Dimopoulos
[-]
1996On Computing Logic Programs
In: Journal of Automated Reasoning [17], 259-289
Journal Article
Dimopoulos, Magirou
[Magirou]
1994A Graph Theoretic Approach to Default Logic
In: Information and Computation [112], 239-256
Journal Article
Dimopoulos, Magirou, Papadimitriou
[-]
1993On Kernels, Defaults and Even Graphs
In: Annals of Mathematics and Artificial Intelligence,
Journal Article
Domshlak, Hoffmann
(Ed: Long, Smith, Borrajo, McCluskey)
[-]
2006Fast Probabilistic Planning Through Weighted Model Counting
In: Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling (ICAPS 2006), 243-252
Proceedings Article
Dräge, Finkbeiner, Podelski
(Ed: Valmari)
[-]
2006Directed Model Checking with Distance-Preserving Abstractions
In: Model checking software : 13th International SPIN Workshop, 19-34
Proceedings Article
Dubois, Jaume, Pons, Prevosto
(Ed: Juilland)
[-]
2004L'atelier FOCAL
In: Actes du 6ème Atelier sur les Approches Formelles dans l'Assistance au Développement de Logiciels (AFADL 2004), 321-324
Proceedings Article
Eisenbrand
[-]
2001Short vectors of planar integral lattices via continued fractions
In: Information Processing Letters [79], 121-126
Journal Article
Eisenbrand
[-]
2000Gomory-Chvátal Cutting planes and the Elementary Closure of Polyhedra
Universität des Saarlandes
Thesis - PhD thesis
Eisenbrand
[-]
1999On the Membership Problem for the Elementary Closure of a Polyhedron
In: Combinatorica [19], 297-300
Journal Article
Eisenbrand, Bockmayr
(Ed: Kirchner, Ringeissen)
[Bockmayr]
2000Combining logic and optimization in cutting plane theory
In: Proceedings of the Workshop on Frontiers of Combining Systems (FROCOS-2000), 1-17
Proceedings Article
Eisenbrand, Rinaldi, Ventura
[-]
20020/1 Optimization and 0/1 Primal Separation are Equivalent
In: Proceedings of the 13th Annual ACM SIAM Symposium on Discrete Algorithms, 920-926
Proceedings Article
Eisenbrand, Rote
(Ed: Gerards, Aardal)
[Rote]
2001Fast 2-variable integer programming
In: Proceedings of the 8th Conference on Integer and Combinatorial Optimization (IPCO-01), 78-89
Proceedings Article
Eisenbrand, Rote
(Ed: Silverman)
[Rote]
2001Fast reduction of ternary quadratic forms
In: Proceedings of the 1st Conference on Lattices and Cryptography (CaLC-01), 99-111
Proceedings Article
Eisenbrand, Schulz
(Ed: Cornuéjols, Burkard, Woeginger)
[Schulz, Cornuéjols, Burkard, Woeginger]
1999Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube
In: Proceedings of the 7th Conference on Integer Programming and Combinatorial Optimization (IPCO-99), 137-150
Proceedings Article
Eisinger, Nonnengart, Präcklein
(Ed: Bläsius, Bürckert)
[Eisinger, Bläsius, Bürckert, Präcklein]
1992Termersetzungssysteme
In: Deduktionssysteme -- Automatisierung des logischen Denkens, 126-149
Part of a Book
Eisinger, Ohlbach
(Ed: Gabbay, Hogger, Robinson)
[-]
1993Deduction Systems Based on Resolution
In: Handbook of Logic in Artificial Intelligence and Logic Programming, 184-271
Proceedings Article
Eisinger, Ohlbach, Präcklein
[-]
1991Reduction Rules for Resolution Based Systems
In: Artificial Intelligence [50], 141-181
Journal Article
Engel
[-]
1996Attachment IconQuantifier Elimination in Second-Order Predicate Logic
Universität des Saarlandes
Thesis - Masters thesis
Esparza, Podelski
[Esparza]
2000Efficient Algorithms for Pre$^\star$ and Post$^\star$ on Interprocedural Parallel Flow Graphs
In: Proceedings of the 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL-00), 1-11
Proceedings Article
Fehrer
(Ed: Clarke, Kruse, Moral)
[-]
1993A Unifying Framework for Reason Maintenance
In: Symbolic and Quantitative Approaches to Reasoning and Uncertainty: Proceedings European Conference ECSQARU '93, 113-120
Proceedings Article
Fehrer
(Ed: Cunningham, Pitt)
[-]
1994A Unifying Logical Framework for Reason Maintenance (Deliverable DI.1.2-3P)
In: Medlar II Report PPR2, 47-55
Proceedings Article
Fehrer
[-]
1995A unifying logical framework for reason maintenance
Universität des Saarlandes
Thesis - PhD thesis
Fehrer, Hustadt, Jaeger, Nonnengart, Ohlbach, Schmidt, Weidenbach, Weydert
(Ed: Baader, Lenzerini, Nutt, Patel-Schneider)
[Baader, Lenzerini, Nutt, Patel-Schneider]
1994Description Logics for Natural Language Processing
In: International Workshop on Description Logics '94, 80-84
Proceedings Article
Fermüller, Leitsch, Hustadt, Tammet
(Ed: Robinson, Voronkov)
[Robinson, Voronkov, Fermüller, Leitsch, Tammet]
2001Resolution Decision Procedures
In: Handbook of Automated Reasoning, 1793-1849
Part of a Book
Firozabadhi, van der Torre
(Ed: Prade)
[Firozabadhi]
1998Towards a formal analysis of control systems
In: Proceedings of the 13th European Conference on Artificial Intelligence (ECAI-98), 317-318
Proceedings Article
Fischmann
[-]
1999On Applications of Decidable Object-Oriented Type Theory
Universität des Saarlandes
Thesis - Masters thesis
Frank, Basin
[-]
1998Search in Games with Incomplete Information: A Case Study Using Bridge Card Play
In: Artificial Intelligence [100], 87-123
Journal Article
Frank, Basin
[-]
1996Search in Games with Incomplete Information: A Case Study Using Bridge Card PlayReport
Frank, Basin, Bundy
(Ed: Neuman, Horn)
[-]
1992Finesse: An Adaptation of Proof-Planning to Declarer Play in Bridge
In: Proceedings of the 10th European Conference on Artificial Intelligence (ECAI-92), 72-76
Proceedings Article
Freiheit, Luuk, Münch, Sijanski, Zangl
[-]
2006Lexecute: Visualisation and representation of legal procedures
In: Digital Evidence Journal [3], 17-27
Journal Article
Freiheit, Münch, Schöttle, Sijanski, Zangl
(Ed: Meersman, Tari, Herrero, Méndez, Cavedon, Martin, Hinze, Buchanan, Pérez, Robles, Humble, Albani, Dietz, Panetto, Scannapieco, Halpin, Spyns, Zaha, Zimány, Stefanakis, Dillon, Feng, Jarrar, Lehmann, de Moor, Duval, Aroyo)
[-]
2005Attachment IconEnhanced Workflow Models as a Tool for Judicial Practitioners
In: On the move to meaningful internet systems 2005: OTM 2005 Workshops : OTM Confederated International Workshops and Posters, AWeSOMe, CAMS, GADA, MIOS+INTEROP, ORM, PhDS, SeBGIS, SWWS, and WOSE 2005, 26-27
Proceedings Article
Freiheit, Zangl
(Ed: Remenyi)
[-]
2006Model-based user-interface management for public services
In: 6th European Conference on e-Government, 141-151
Proceedings Article
Friedrich
[-]
1998Integration of a Decision Procedure for Second-Order Monadic Logic in a Higher-Order Logic Theorem Proving Environment
Universität des Saarlandes
Thesis - Masters thesis
Furbach, Ganzinger, Hasegawa, Kapur (ed.)
(Ed: Furbach, Ganzinger, Hasegawa, Kapur)
[-]
2000DeductionProceedings
Gabbay, Kruse, Nonnengart, Ohlbach (ed.)
(Ed: Gabbay, Kruse, Nonnengart, Ohlbach)
[-]
1997Qualitative and Quantitative Practical ReasoningBook
Gabbay, Ohlbach
(Ed: Broda)
[-]
1992From a Hilbert Calculus to its Model Theoretic Semantics
In: Proc.~4th Annual UK Conference on Logic Programming (APULK '92), 218-252
Proceedings Article
Gabbay, Ohlbach
(Ed: Nebel, Rich, Swartout)
[-]
1992Quantifier Elimination in Second-Order Predicate Logic
In: Principles of Knowledge Representation and Reasoning (KR92),, 425-435
In: South African Computer Journal [7], 425-435
Proceedings Article
Gabbay, Ohlbach
[-]
1992Quantifier Elimination in Second-Order Predicate Logic
In: South African Computer Journal [7], 35-43
Journal Article
Gabbay, Ohlbach (ed.)
(Ed: Gabbay, Ohlbach)
[-]
1994Temporal Logic: Proceedings of the 1st International Conference on Temporal LogicProceedings
Gaede
[-]
1995Attachment IconSuperposition Extended with Sorts
Universität Kaiserslautern
Thesis - Masters thesis
Gaillourdet, Hillenbrand, Löchner, Spies
(Ed: Baader)
[Baader]
2003Attachment IconThe New WALDMEISTER Loop at Work
In: Automated deduction, CADE-19 : 19th International Conference on Automated Deduction, 317-321
Proceedings Article
Gamkrelidze
[-]
2001Attachment IconEinige Optimierungsmethoden hierarchischer Schaltkreise
Universität des Saarlandes
Thesis - PhD thesis
Ganzinger
(Ed: Danvy, Filinski)
[Danvy, Filinski]
2001Bottom-Up Deduction with Deletion and Priorities
In: Programs as Data Objects (PADO-01) : Second Symposium PADO 2001, 276-277
Proceedings Article
Ganzinger
(Ed: Meyer auf der Heide, Monien)
[-]
1996Saturation-based theorem proving (abstract)
In: Automata, Languages and Programming: International Colloquium (ICALP-23), 1-3
Proceedings Article
Ganzinger
(Ed: Voronkov)
[-]
2002Attachment IconShostak Light
In: Automated deduction, CADE-18 : 18th International Conference on Automated Deduction, 332-346
Proceedings Article
Ganzinger
(Ed: Williams)
[-]
2001Attachment IconRelating Semantic and Proof-Theoretic Concepts for Polynomial Time Decidability of Uniform Word Problems
In: Proceedings of the 16th IEEE Symposium on Logic in Computer Science (LICS-01), 81-90
Proceedings Article
Ganzinger
[-]
2001Efficient deductive methods for program analysis
In: ACM SIGPLAN Notices [36], 102-103
Journal Article
Ganzinger
[-]
1998Preface
In: Theoretical Computer Science [208], 1
Journal Article
Ganzinger
[-]
1994The Saturate SystemUnpublished/Draft
Ganzinger
[-]
1991A completion procedure for conditional equations
In: Journal of Symbolic Computation [11], 51-81
Journal Article
Ganzinger
[-]
1991Order-Sorted Completion: The Many-Sorted Way
In: Theoretical Computer Science [89], 3-32
Journal Article
Ganzinger (ed.)
(Ed: Ganzinger)
[-]
1999Proceedings of the 16th International Conference on Automated Deduction (CADE-16)Proceedings
Ganzinger (ed.)
(Ed: Ganzinger)
[-]
1996Rewriting Techniques and Applications, 7th International Conference, RTA-96Proceedings
Ganzinger, de Nivelle
(Ed: Longo)
[Longo]
1999Attachment IconA Superposition Decision Procedure for the Guarded Fragment with Equality
In: Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science (LICS-99), 295-303
Proceedings Article
Ganzinger, Hagen, Nieuwenhuis, Oliveras, Tinelli
(Ed: Alur, Peled)
[-]
2004DPLL(T): Fast Decision Procedures
In: Computer aided verification : 16th International Conference, CAV 2004, 175-188
Proceedings Article
Ganzinger, Hillenbrand, Waldmann
(Ed: Baader)
[-]
2003Attachment IconSuperposition modulo a Shostak Theory
In: Automated Deduction, CADE-19 : 19th International Conference on Automated Deduction, 182-196
Proceedings Article
Ganzinger, Hustadt, Meyer, Schmidt
(Ed: Zakharyaschev, Segerberg, de Rijke, Wansing)
[-]
2001Attachment IconA Resolution-Based Decision Procedure for Extensions of K4
In: Advances in Modal Logic, Volume 2, 225-246
Part of a Book
Ganzinger, Jacquemard, Veanes
(Ed: Hsiang, Ohori)
[Hsiang, Ohori]
1998Rigid Reachability
In: Proceedings of the 4th Asian Computing Science Conference on Advances in Computing Science (ASIAN-98), 4-21
Proceedings Article
Ganzinger, Jacquemard, Veanes
[Jacquemard, Veanes]
2000Rigid Reachability: The Non-Symmetric Form of Rigid E-unification
In: International Journal of Foundations of Computer Science [11], 3-27
Journal Article
Ganzinger, Korovin
(Ed: Hermann, Voronkov)
[-]
2006Theory Instantiation
In: 13th Conference on Logic for Programming Artificial Intelligence Reasoning (LPAR'06), 497-511
Proceedings Article
Ganzinger, Korovin
(Ed: Hermann, Voronkov)
[-]
2006Theory Instantiation
In: Logic for Programming, Artificial Intelligence, and Reasoning : 13th International Conference, LPAR 2006, 497-511
Proceedings Article
Ganzinger, Korovin
(Ed: Kolaitis)
[-]
2003Attachment IconNew Directions in Instantiation-Based Theorem Proving
In: 18th Annual IEEE Symposium on Logic in Computer Science (LICS-03), 55-64
Proceedings Article
Ganzinger, Korovin
(Ed: Marcinkowski, Tarlecki)
[-]
2004Integration of equational reasoning into instantiation-based theorem proving
In: Computer science logic : 18th International Workshop CSL 2004, 13th Annual Conference of the EACSL, 71-84
Proceedings Article
Ganzinger, McAllester
(Ed: Goré, Leitsch, Nipkow)
[-]
2001Attachment IconA new meta-complexity theorem for bottom-up logic programs
In: Automated reasoning : First International Joint Conference, IJCAR 2001, 514-528
Proceedings Article
Ganzinger, McAllester
(Ed: Stuckey)
[-]
2002Attachment IconLogical Algorithms
In: Logic Programming. 18th International Conference, ICLP 2002, 209-223
Proceedings Article
Ganzinger, McAllester, Voronkov (ed.)
(Ed: Ganzinger, McAllester, Voronkov)
[McAllester, Voronkov]
1999Proceedings of the 6th International Conference on Logic for Programming and Automated Reasoning (LPAR-99)Proceedings
Ganzinger, Meyer, Veanes
(Ed: Longo)
[Longo]
1999The Two-Variable Guarded Fragment with Transitive Relations
In: Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science (LICS-99), 24-34
Proceedings Article
Ganzinger, Meyer, Weidenbach
(Ed: McCune)
[McCune]
1997Soft Typing for Ordered Resolution
In: Proceedings of the 14th International Conference on Automated Deduction (CADE-14), 321-335
Proceedings Article
Ganzinger, Nieuwenhuis
(Ed: Comon, Marché, Treinen)
[-]
2001Attachment IconConstraints and Theorem Proving
In: Contraints in Computational Logics, International Summer School (CCL-99), 159-201
Proceedings Article
Ganzinger, Nieuwenhuis, Nivela
(Ed: Goré, Leitsch, Nipkow)
[-]
2001Attachment IconContext trees
In: Automated reasoning : First International Joint Conference, IJCAR 2001, 242-256
Proceedings Article
Ganzinger, Nieuwenhuis, Nivela
[-]
2004Attachment IconFast Term Indexing with Coded Context Trees
In: Journal of Automated Reasoning [32], 103-120
Journal Article
Ganzinger, Sofronie-Stokkermans
[-]
2000Attachment IconChaining Techniques for Automated Theorem Proving in Many-Valued Logics
In: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (ISMVL-00), 337-344
Proceedings Article
Ganzinger, Sofronie-Stokkermans, Waldmann
(Ed: Basin, Rusinowitch)
[-]
2004Modular Proof Systems for Partial Functions with Weak Equality
In: Automated reasoning : Second International Joint Conference, IJCAR 2004, 168-182
Proceedings Article
Ganzinger, Sofronie-Stokkermans, Waldmann
[-]
2006Modular Proof Systems for Partial Functions with Evans Equality
In: Information and Computation [204], 1453-1492
Journal Article
Ganzinger, Stuber
(Ed: Baader)
[-]
2003Attachment IconSuperposition with Equivalence Reasoning and Delayed Clause Normal Form Transformation
In: Automated Deduction, CADE-19 : 19th International Conference on Automated Deduction, 335-349
Proceedings Article
Ganzinger, Stuber
(Ed: Buchmann, Ganzinger, Paul)
[-]
1992Inductive theorem proving by consistency for first-order clauses
In: Informatik - Festschrift zum 60. Geburtstag von Günter Hotz, 441-462
Part of a Book
Ganzinger, Stuber
[-]
2005Superposition with equivalence reasoning and delayed clause normal form transformation
In: Information and Computation [199], 3-23
Journal Article
Ganzinger, Waldmann
(Ed: McRobbie, Slaney)
[-]
1996Theorem Proving in Cancellative Abelian Monoids (Extended Abstract)
In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), 388-402
Proceedings Article
Ganzinger, Waldmann
(Ed: Rusinowitch, Rémy)
[-]
1992Termination Proofs of Well-Moded Logic Programs Via Conditional Rewrite Systems
In: Proceedings of the 3rd International Workshop on Conditional Term Rewriting Systems '92, 430-437
Proceedings Article
Georgieva, Hustadt, Schmidt
(Ed: Horrocks, Tessaris)
[-]
2002On the Relationship Between Decidable Fragments, Non-Classical Logics, and Description Logics
In: Proceedings of the International Workshop on Description Logics (DL'2002), 25-36
Proceedings Article
Georgieva, Hustadt, Schmidt
(Ed: Voronkov)
[-]
2002A New Clausal Class Decidable by Hyperresolution
In: Automated deduction, CADE-18 : 18th International Conference on Automated Deduction, 260-274
Proceedings Article
Georgieva, Hustadt, Schmidt
[-]
2002A New Clausal Class Decidable by HyperresolutionReport
Georgieva, Maier
(Ed: Aichernig, Beckert)
[-]
2005Description Logics for Shape Analysis
In: Third IEEE International Conference on Software Engineering and Formal Methods (SEFM 2005), 321-330
Proceedings Article
Gerber
[-]
1995Entwicklung eines Algorithmus zur effizienten Anfragebeantwortung für eine terminologische Wissensrepräsentationssprache
Universität des Saarlandes
Thesis - Masters thesis
Göbel, Maier
(Ed: Ganzha, Mayr, Vorozhtsov)
[Göbel, Ganzha, Mayr, Vorozhtsov]
2000Three Remarks on Comprehensive Gröbner and SAGBI Bases
In: Proceedings of the 3rd Workshop on Computer Algebra in Scientific Computing (CASC-2000), 191-202
Proceedings Article
Goncharov, Harizanov, Knight, Morozov, Romina
[-]
2005On automorphic tuples of elements in computable models
In: Siberian Mathematical Journal [46], 405-412
Journal Article
Goranko, Hustadt, Schmidt, Vakarelov
(Ed: Berghammer, Möller, Struth)
[-]
2004SCAN is complete for all Sahlqvist formulae
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, 149-162
Proceedings Article
Graf
(Ed: Bundy)
[-]
1995Substitution Tree Indexing
In: Proceedings of the 6th International Conference on Rewriting Techniques and Applications (RTA-95), 117-131
Proceedings Article
Graf
(Ed: Bundy)
[-]
1994Extended Path-Indexing
In: Proceedings of the 12th International Conference on Automated Deduction (CADE-12), 514-528
Proceedings Article
Graf
(Ed: Carbonell, Siekmann)
[Carbonell, Siekmann]
1996Term IndexingBook
Graf
(Ed: McRobbie, Slaney)
[McRobbie, Slaney]
1996Path indexing for AC-theories
In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), 718-732
Proceedings Article
Graf
[-]
1995Term Indexing
Universität des Saarlandes
Thesis - PhD thesis
Graf
[-]
1992Unification Using Dynamic Sorts
Universität des Saarlandes
Thesis - Masters thesis
Graf, Meyer
(Ed: McRobbie, Slaney)
[-]
1996Advanced indexing operations on substitution trees
In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), 553-567
Proceedings Article
Grenner
[-]
2001Die Erzeugung von Schnittebenen mit maximalem Verletzungsgrad und deren Einsatz im Branch-and-Cut Verfahren
Universität des Saarlandes
Thesis - Masters thesis
Gurevich, Veanes
[Gurevich]
1999Logic with Equality: Partisan Corroboration and Shifted Pairing
In: Information and Computation [152], 205-235
Journal Article
Hagemann
[-]
2005Formalisierung der Arithmetik
Universität Göttingen
Thesis - other
Hähnle, Kerber, Weidenbach
[Hähnle, Kerber]
1996Common Syntax of the DFG-Schwerpunktprogramm ``Deduktion''Report
Hanus
(Ed: Abramsky, Maibaum)
[-]
1991Parametric Order-Sorted Types in Logic Programming
In: Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT-91), 181-200
Proceedings Article
Hanus
(Ed: Apt)
[-]
1992On the Completeness of Residuation
In: Proceedings of the 1992 Joint International Conference and Symposium on Logic Programming, 192-206
Proceedings Article
Hanus
(Ed: Boley, Richter)
[-]
1991Efficient Implementation of Narrowing and Rewriting
In: Proc. Intern. Workshop on Processing Declarative Knowledge, 344-365
Proceedings Article
Hanus
(Ed: Bruynooghe, Wirsing)
[-]
1992Improving Control of Logic Programs by Using Functional Logic Languages
In: Proceedings 4th International Symposium on Programming Language Implementation and Logic Programming, 1-23
Proceedings Article
Hanus
(Ed: Hermenegildo, Penjam)
[-]
1994Combining Lazy Narrowing and Simplification
In: Proceedings of the 6th International Symposium on Programming Language Implementation and Logic Programming (PLILP'94), 370-384
Proceedings Article
Hanus
(Ed: Kirchner, Levi)
[-]
1992Incremental Rewriting in Narrowing Derivations
In: Proceedings of the 3rd International Conference on Algebraic and Logic Programming (ALP-92), 228-243
Proceedings Article
Hanus
(Ed: Pfenning)
[-]
1992Logic Programming with Type Specifications
In: Types in Logic Programming, 91-140
Part of a Book
Hanus
(Ed: Sannella)
[-]
1994Lazy Unification with Simplification
In: Proceedings of the 5th European Symposium on Programming Languages and Systems (ESOP'94), 272-286
Proceedings Article
Hanus
(Ed: Warren)
[-]
1993Analysis of Nonlinear Constraints in CLP($\calR$)
In: Proceedings of the 10th International Conference on Logic Programming (ICLP '93), 83-99
Proceedings Article
Hanus
[-]
1995Analysis of Residuating Logic Programs
In: Journal of Logic Programming [24], 219-245
Journal Article
Hanus
[-]
1995Compile-Time Analysis of Nonlinear Constraints in CLP(R)
In: New Generation Computing [13], 155-186
Journal Article
Hanus
[-]
1995On Extra Variables in (Equational) Logic Programming
In: Proceedings of the Twelfth International Conference on Logic Programming, 665-679
Proceedings Article
Hanus
[-]
1994The Integration of Functions into Logic Programming: From Theory to Practice
In: Journal of Logic Programming [19 & 20], 583-628
Journal Article
Hanus
[-]
1994Thema der Antrittsvorlesung: Deklarative Programmierparadigmen und ihre Integration
Universität des Saarlandes
Thesis - Habilitation thesis
Hanus
[-]
1993Towards the Global Optimization of Functional Logic Programs
In: Proc.~Workshop on Global Compilation, International Logic
Programming Symposium, 83-97
Proceedings Article
Hanus
[-]
1991Horn Clause Programs with Polymorphic Types: Semantics and Resolution
In: Theoretical Computer Science [89], 63-106
Journal Article
Hanus, Josephs
(Ed: Bruynooghe, Penjam)
[Josephs]
1993A Debugging Model for Functional Logic Programs
In: Proceedings of the 5th International Symposium on Programming Language Implementation and Logic Programming (PLILP-93), 28-43
Proceedings Article
Hanus, Zartmann
(Ed: Le Charlier)
[-]
1994Mode Analysis of Functional Logic Programs
In: Proceedings of the 1st International Static Analysis Symposium (SAS'94), 26-42
Proceedings Article
Hillenbrand
(Ed: Dahn, Vigneron)
[-]
2003Attachment IconCitius altius fortius: Lessons learned from the Theorem Prover WALDMEISTER
In: Proceedings of the 4th International Workshop on First Order Theorem Proving, FTP'03, 1-13
Electronic Proceedings Article
Hillenbrand
(Ed: Sattler)
[-]
2004Attachment IconA Superposition View on Nelson-Oppen
In: Contributions to the Doctoral Programme of the 2nd International Joint Conference on Automated Reasoning, 16-20
Electronic Proceedings Article
Hillenbrand, Löchner
(Ed: de Nivelle, Schulz)
[Löchner, Schulz]
2001Attachment IconThe Next WALDMEISTER Loop (Extended Abstract)
In: Proceedings of the Second International Workshop on the Implementation of Logics, IWIL 2001, 13-21
Proceedings Article
Hillenbrand, Löchner
(Ed: Voronkov)
[-]
2002Attachment IconThe Next WALDMEISTER Loop
In: Automated deduction, CADE-18 : 18th International Conference on Automated Deduction, 486-500
Proceedings Article
Hillenbrand, Podelski, Topić
(Ed: Charatonik, Ganzinger)
[-]
2002Attachment IconIs Logic Effective for Analyzing C Programs?
In: Symposium on the Effectiveness of Logic in Computer Science in Honour of Moshe Vardi, 27-30
Proceedings Article
Hillenbrand, Topic, Weidenbach
(Ed: Ahrendt, Baumgartner, de Nivelle)
[-]
2006Sudokus as Logical Puzzles
In: Proceedings of the Third Workshop on Disproving, 2-12
Electronic Proceedings Article
Hoenicke, Maier
(Ed: Fitzgerald, Hayes, Tarlecki)
[-]
2005Model-Checking of Specifications Integrating Processes, Data and Time
In: FM 2005: Formal Methods; International Symposium of Formal Methods Europe, 465-480
Proceedings Article
Hoffmann
(Ed: Kaelbling)
[-]
2005A Covering Problem for Hypercubes
In: Proceedings of the 19th International Joint Conference on Artificial Intelligence, 579-580
Poster
Hoffmann
[-]
2005In Defense of PDDL Axioms
In: Artificial Intelligence [168], 38-69
Journal Article
Hoffmann
[-]
2005The Deterministic Part of IPC-4: An Overview
In: Journal of Artificial Intelligence Research [24], 519 - 579
Journal Article
Hoffmann
[-]
2005Where Ignoring Delete Lists Works: Local Search Topology in Planning Benchmarks
In: Journal of Artificial Intelligence Research [24], 685-758
Journal Article
Hoffmann
[-]
2003The Metric-FF Planning System: Translating ``Ignoring Delete Lists'' To Numeric State Variables
In: Journal of Artificial Intelligence Research [20], 51
Journal Article
Hoffmann
[-]
2003Utilizing Problem Structure in Planning: A Local Search ApproachBook
Hoffmann, Brafman
(Ed: Biundo, Meyers, Rajan)
[-]
2005Contingent Planning via Heuristic Forward Search with Implicit Belief States
In: 15th International Conference on Automated Planning and Scheduling, 71-80
Proceedings Article
Hoffmann, Brafman
[-]
2006Conformant planning via heuristic forward search: A new approach
In: Artificial Intelligence [170], 507-541
Journal Article
Hoffmann, Geffner
(Ed: Giunchiglia, Muscettola, Nau)
[-]
2003Branching Matters: Alternative Branching in Graphplan
In: 13th International Conference on Automated Planning and Scheduling (ICAPS-13), 22-31
Proceedings Article
Hoffmann, Gomes, Selman
(Ed: Long, Smith, Borrajo, McCluskey)
[-]
2006Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning
In: Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling (ICAPS 2006), 284-293
Proceedings Article
Hoffmann, Porteous, Sebastia
[-]
2004Ordered Landmarks in Planning
In: Journal of Artificial Intelligence Research [22], 215-278
Journal Article
Hoffmann, Sabharwal, Domshlak
(Ed: Long, Smith, Borrajo, McCluskey)
[-]
2006Friends or Foes? An AI Planning Perspective on Abstraction and Search
In: Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling (ICAPS 2006), 294-303
Proceedings Article
Hopf
(Ed: Claus, Hopf, Schwefel)
[Claus, Schwefel]
1996Optimizing Photo Mask Layout for Grey-tone LithographyReport
Hopf
(Ed: Claus, Hopf, Schwefel)
[Claus, Schwefel]
1996Optimizing Photo Mask Layout for Grey-tone LithographyReport
Hopf
(Ed: Steele)
[Steele]
1997Cooperative Coevolution of Fuzzy Rules
In: Proceedings of the 2nd International ICSC Symposium on Fuzzy Logic and Applications (ISFL-97), 337-381
Proceedings Article
Hopf
[-]
2001Photomaskenlayout für eine 3D-Grauton-Lithographie als kombinatorisches Optimierungsproblem
Universität des Saarlandes
Thesis - PhD thesis
Hopf
[-]
1994Genetic Algorithms within the Framework of Evolutionary ComputationMiscellaneous
Hopf, Klawonn
(Ed: Kruse, Palm, Gebhardt)
[Klawonn, Kruse, Palm, Gebhardt]
1994Learning the Rule Base of a Fuzzy Controller by a Genetic Algorithm
In: Fuzzy Systems in Computer Science, 63-74
Part of a Book
Hopf, Klawonn
[Klawonn]
1993Selbstlernende Fuzzy-Controller auf der Basis Genetischer Algorithmen
In: Fuzzy-Systeme '93 / Management unsicherer Informationen, 21-27
Proceedings Article
Hopf, Rau
(Ed: Jamshidi, Fathi, Pierrot)
[Jamshidi, Fathi, Pierrot]
1996Decision Making in an Economy Exploiting Fuzzy Rules Obtained from a Genetic Algorithm
In: Soft Computing with Industrial Applications, 331-336
Proceedings Article
Hustadt
(Ed: Baader, Buchheit, Jeusfeld, Nutt)
[-]
1994Do we need the closed-world assumption in knowledge representation?
In: Working Notes of the KI'94 Workshop: Reasoning about Structured Objects: Knowledge Representation meets Databases (KRDB'94), 24-26
Proceedings Article
Hustadt
(Ed: Bürckert, Nutt)
[-]
1993Automated Support for the Development of Non-classical Logics
In: Workshop: Modellierung epistemischer Propositionen, KI '93,
Proceedings Article
Hustadt
(Ed: Codognet, Dung, Kakas, Mancarella)
[-]
1993Abductive Disjunctive Logic Programming
In: ICLP '93 Postconference Workshop on Abductive Reasoning, ?
Proceedings Article
Hustadt
(Ed: Kunze, Stoyan)
[-]
1994Common and Mutual Belief for Agent Modeling
In: KI-94 Workshops: Extended Abstracts, 123-124
Proceedings Article
Hustadt
(Ed: Kunze, Stoyan)
[-]
1994Do we need the closed-world assumption in knowledge representation?
In: KI-94 Workshops: Extended Abstracts, 293-294
Proceedings Article
Hustadt
(Ed: Laux, Wansing)
[-]
1994Common and Mutual Belief for Agent Modeling
In: Modeling Epistemic Propositions: Workshop during the 18th German Annual Conference on Artificial Intelligence (KI-94),
Proceedings Article
Hustadt
(Ed: Laux, Wansing)
[Laux, Wansing]
1995Introducing Epistemic Operators into a Description Logic
In: Knowledge and Belief in Philosophie and Artificial Intelligence, 65-85
Part of a Book
Hustadt
[-]
1999Resolution-Based Decision Procedures for Subclasses of First-Order Logic
Universität des Saarlandes
Thesis - PhD thesis
Hustadt
[-]
1994A Multi-Modal Logic for Stereotyping
In: Proceedings of the 4th International Conference on User Modeling UM94, 87-92
Proceedings Article
Hustadt, Nonnengart
(Ed: Rowles, Liu, Foo)
[Rowles, Liu, Foo]
1993Modalities in Knowledge Representation
In: Proc. of the 6th Australian Joint Conference on Artificial Intelligence (AI '93), 249-254
Proceedings Article
Hustadt, Schmidt
(Ed: de Swart)
[de Swart]
1998Simplification and backjumping in modal tableau
In: Proceedings of the International Conference on Automated Reaso ning with Analytic Tableaux and Related Methods (TABLEAUX'98), 187-201
Proceedings Article
Hustadt, Schmidt
(Ed: Ganzinger)
[-]
1999Maslov's Class K Revisited
In: Proceedings of the 16th International Conference on Automated Deduction (CADE-16), 172-186
Proceedings Article
Hustadt, Schmidt
(Ed: Pollack)
[-]
1997On Evaluating Decision Procedures for Modal Logics
In: Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (IJCAI-97), 202-207
Proceedings Article
Hustadt, Schmidt
[-]
1999An Empirical Analysis of Modal Theorem Provers
In: Journal of Applied Non-Classical Logics [9], 479-522
Journal Article
Hustadt, Schmidt
[Dean]
1999On the relation of resolution and tableaux proof systems for description logics
In: Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99), 110-115
Proceedings Article
Hustadt, Schmidt, Weidenbach
(Ed: de Swart)
[de Swart]
1998Optimised Functional Translation and Resolution
In: Proceedings of the International Conference on Automated Reaso ning with Analytic Tableaux and Related Methods (TABLEAUX'98), 36-37
Proceedings Article
Iturrioz, Sofronie-Stokkermans
(Ed: Iturrioz, Orlowska, Turunen)
[Iturrioz, Orlowska, Turunen]
2000SHn-algebras (Symmetric Heyting algebras of order n)
In: COST Action 15 (Many-Valued Logics for Computer Science Applications) ATLAS of Many-Valued Structures, 1-11
Part of a Book
Jacobs
[-]
2004Attachment IconInstance Generation Methods for Automated Reasoning
Universität des Saarlandes
Thesis - Masters thesis
Jacobs, Sofronie-Stokkermans
(Ed: Cook, Sebastiani)
[-]
2006Attachment IconApplications of hierarchical reasoning in the verification of complex systems
In: PDPAR'06: Pragmatical Aspects of Decision Procedures in Automated Reasoning, 15-26
Electronic Proceedings Article
Jacobs, Sofronie-Stokkermans
[-]
2007Applications of hierarchical reasoning in the verification of complex systems
In: Electronic Notes in Theoretical Computer Science [??],
Electronic Journal Article
Jacobs, Waldmann
(Ed: Beckert)
[-]
2005Attachment IconComparing Instance Generation Methods for Automated Reasoning
In: Automated reasoning with analytic tableaux and related methods : International Conference, TABLEAUX 2005, 153-168
Proceedings Article
Jacquemard, Meyer, Weidenbach
(Ed: Nipkow)
[Jacquemard, Nipkow]
1998Unification in Extensions of Shallow Equational Theories
In: Proceedings of the 9th International Conference on Rewriting Techniques and Applications (RTA-98), 76-90
Proceedings Article
Jaeger
(Ed: Carlucci-Aiello, Doyle, Shapiro)
[-]
1996Representation Independence of Nonmonotonic Inference Relations
In: Principles of Knowledge Representation and Reasoning, Proceedings of the 5th International Conference (KR-96), 461-472
Proceedings Article
Jaeger
(Ed: Cohn, Schubert, Shapiro)
[-]
1998Attachment IconReasoning About Infinite Random Structures with Relational Bayesian Networks
In: Proceedings of the 6th International Conference on Principles of Knowledge Representation and Reasoning (KR-98), 570-581
Proceedings Article
Jaeger
(Ed: Cooper, Moral)
[-]
1998Attachment IconMeasure Selection: Notions of Rationality and Representation Independence
In: Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence (UAI-98), 274-281
Proceedings Article
Jaeger
(Ed: Doyle, Sandewall, Torasso)
[-]
1994Probabilistic Reasoning in Terminological Logics
In: Principles of Knowledge Representation an Reasoning: Proceedings of the 4th International Conference (KR94), 305-316
Proceedings Article
Jaeger
(Ed: Fawcett, Mishra)
[-]
2003Probabilistic Classifiers and the Concepts they Recognize
In: Proceedings of the Twentieth International Conference on Machine Learning (ICML-03), 266-273
Proceedings Article
Jaeger
(Ed: Geiger, Shenoy)
[-]
1997Attachment IconRelational Bayesian Networks
In: Proceedings of the 13th Conference of Uncertainty in Artificial Intelligence (UAI-13), 266-273
Proceedings Article
Jaeger
(Ed: Kwiatkowska)
[Kwiatkowska]
1999Attachment IconFairness, Computable Fairness and Randomness
In: Proceedings of the 2nd International Workshop on Probabilistic Methods in Verification (PROBMIV-99), 57-66
Proceedings Article
Jaeger
(Ed: Lopez de Mantaraz, Poole)
[-]
1994A Logic for Default Reasoning About Probabilities
In: Proceedings of the 10th Conference on Uncertainty in Artificial Intelligence (UAI'94), 352-359
Proceedings Article
Jaeger
(Ed: Mellish)
[-]
1995Minimum Cross-Entropy Reasoning: A Statistical Justification
In: Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95), 1847-1852
Proceedings Article
Jaeger
(Ed: Nebel)
[Nebel]
2001Attachment IconConstraints as Data: a New Perspective on Inferring Probabilities
In: Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI-01), 755-760
Proceedings Article
Jaeger
(Ed: Nielsen, Zhang)
[-]
2003Attachment IconA Representation Theorem and Applications
In: Symbolic and Quantitative Approaches to Reasoning with Uncertainty :
7th European Conference, ECSQARU 2003, 50-61
Proceedings Article
Jaeger
(Ed: Pratt)
[-]
1998Attachment IconConvergence Results for Relational Bayesian Networks
In: Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science (LICS-98), 44-55
Proceedings Article
Jaeger
[-]
2002Attachment IconProbababilistic Decision Graphs - Combining Verification and AI Techniques for Probabilistic Inference
In: Proceedings of the First European Workshop on Probabilistic Graphical Models, 81-88
Proceedings Article
Jaeger
[-]
2002Probabilistic Decision Graphs
Universität des Saarlandes
Thesis - Habilitation thesis
Jaeger
[-]
2002Attachment IconRelational Bayesian Networks: a Survey
In: Electronic Transactions on Artificial Intelligence [6],
Electronic Journal Article
Jaeger
[-]
2001Attachment IconAutomatic Derivation of Probabilistic Inference Rules
In: International Journal of Approximate Reasoning [28], 1-22
Journal Article
Jaeger
[-]
2001Attachment IconComplex Probabilistic Modeling with Recursive Relational Bayesian Networks
In: Annals of Mathematics and Artificial Intelligence [32], 179-220
Journal Article
Jaeger
[-]
2000Attachment IconOn the complexity of inference about probabilistic relational models
In: Artificial Intelligence [117], 297-308
Journal Article
Jaeger
[-]
1995Default Reasoning about Probabilities
Universität des Saarlandes
Thesis - PhD thesis
Jaeger
[-]
1993Circumscription: Completeness Reviewed
In: Artificial Intelligence [60], 293-301
Journal Article
Jaeger, Mannila, Weydert
(Ed: Ng)
[Ng]
1996Data Mining as Selective Theory Extraction in Probabilistic Logic
In: Proceedings of the 1996 SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, -
Proceedings Article
Jaulin, Ratschan, Hardouin
[-]
2004Set Computation for Nonlinear Control
In: Reliable Computing [10], 1-26
Journal Article
Jensen, Podelski
[-]
2006Tools and algorithms for the construction and analysis of systems
In: International Journal on Software Tools for Technology Transfer [8], 177-179
Journal Article
Jensen, Podelski (ed.)
(Ed: Jensen, Podelski)
[-]
2004Tools and algorithms for the construction and analysis of systems : 10th International Conference, TACAS 2004 ; held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2004Proceedings
Johann, Socher-Ambrosius
(Ed: Jouannaud)
[Johann]
1994Solving Simplificating Ordering Constraints
In: Proceedings of the 1st International Conference on Constraints in Computational Logics (CCL'94), 352-367
Proceedings Article
Jung
[-]
2001Attachment IconEin Frontend für die Anwendung von Model Checking auf die Analyse von Array Bounds für C Programme
Universität des Saarlandes
Thesis - Masters thesis
Kasper
[-]
1998A Unifying Logical Framework for Integer Linear Programming and Finite Domain Constraint Programming
Universität des Saarlandes
Thesis - PhD thesis
Kazakov
(Ed: Alferes, Leite)
[-]
2004Attachment IconA Polynomial Translation from the Two-Variable Guarded Fragment with Number Restrictions to the Guarded Fragment
In: Logics in artificial intelligence : 9th European Conference, JELIA 2004, 372-384
Proceedings Article
Kazakov
(Ed: Charatonik, Ganzinger)
[-]
2002Attachment IconRecursive resolution for modal logic
In: Symposium on the Effectiveness of Logic in Computer Science in Honour of Moshe Vardi, 11-15
Proceedings Article
Kazakov
[-]
2006Attachment IconSaturation-Based Decision Procedures For Extensions Of The Guarded Fragment
Universität des Saarlandes
Thesis - PhD thesis
Kazakov, de Nivelle
(Ed: Basin, Rusinowitch)
[-]
2004A Resolution Decision Procedure for the Guarded Fragment with Transitive Guards
In: Automated reasoning : Second International Joint Conference, IJCAR 2004, 122-136
Proceedings Article
Kazakov, de Nivelle
(Ed: Calvanese, De Giacomo, Franconi)
[-]
2003Attachment IconSubsumption 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
Proceedings Article
Klotzki
[-]
1995Wiedemann-Algorithmus zur Lösung dünnbesetzter Gleichungssysteme über Fp
Universität des Saarlandes
Thesis - Masters thesis
Korovin
[-]
2003Knuth-Bendix orders in automated deduction and term rewriting
University of Manchester
Thesis - PhD thesis
Korovin, Voronkov
(Ed: Baader)
[-]
2003Attachment IconAC-compatible Knuth-Bendix Order
In: Automated deduction, CADE-19 : 19th International Conference on Automated Deduction, 47-59
Proceedings Article
Korovin, Voronkov
(Ed: Kolaitis)
[Voronkov, Kolaitis]
2003Attachment IconOrienting Equalities with the Knuth-Bendix Order
In: 18th Annual IEEE Symposium on Logic in Computer Science (LICS-03), 75-84
Proceedings Article
Korovin, Voronkov
[-]
2005Knuth-Bendix constraint solving is NP-complete
In: ACM Transactions on Computational Logic [6], 361-388
Journal Article
Korovin, Voronkov
[-]
2003Orienting rewrite rules with the Knuth-Bendix order
In: Information and Computation [183], 165-186
Journal Article
Kraan, Basin, Bundy
(Ed: Lau, Clement)
[-]
1993Logic Program Synthesis via Proof Planning
In: International Workshop on Logic Program Synthesis and Transformation (LOPSTR '92), 1-14
Proceedings Article
Kraan, Basin, Bundy
(Ed: Zhang)
[Kraan, Bundy]
1996Middle-Out Reasoning for Synthesis and Induction
In: Automated mathematical induction, 113-145
Part of a Book
Kraan, Basin, Bundy
[-]
1993Middle-Out Reasoning for Logic Program Synthesis
In: Proc.~10th Intern. Conference on Logic Programing (ICLP '93), 441-455
Proceedings Article
Kraan, Basin, Bundy
[Kraan, Bundy]
1996Middle-out reasoning for synthesis and induction
In: Journal of Automated Reasoning [16], 113-145
Journal Article
Krischer, Bockmayr
(Ed: Book)
[-]
1991Detecting Redundant Narrowing Derivations by the LSE-SL Reducibility Test
In: Proceedings of the 4th International Conference on Rewriting Techniques and Applications (RTA '91), 74-85
Proceedings Article
Krishna Rao
(Ed: Anjaneyulu, Sasikumar, Ramani)
[-]
1996Learning Prolog programs from examples
In: Knowledge Based Computer Systems, 19-30
Proceedings Article
Krishna Rao
(Ed: Arikawa, Sharma)
[-]
1996A class of Prolog programs inferable from positive data
In: Algorithmic Learning Theory, 272-284
Proceedings Article
Krishna Rao
(Ed: Ganzinger)
[-]
1996Modularity of termination in term graph rewriting
In: Rewriting Techniques and Applications, 230-244
Proceedings Article
Krishna Rao
(Ed: Jantke, Shinohara, Zeugmann)
[-]
1995Incremental Learning of Logic Programs
In: Proceedings of International Workshop on Algorithmic Learning Theory, 95-109
Proceedings Article
Krishna Rao
(Ed: Maher)
[-]
1996Completeness results for basic narrowing in non-copying implementations
In: Logic Programming, 393-407
Proceedings Article
Krishna Rao
(Ed: Mosses, Nielsen, Schwartzbach)
[Mosses, Nielsen, Schwartzbach]
1995Semi-completeness of Hierarchical and Super-hierarchical Combinations of Term Rewriting Systems
In: Proceedings of the 6th Joint Conference on Theory and Practice of Software Development, 379-393
Proceedings Article
Krishna Rao
(Ed: Wiedermann, Hájek)
[Wiedermann, Hájek]
1995Graph reducibility of term rewriting systems
In: Proceedings of Mathematical Foundations of Computer Science, 371-381
Proceedings Article
Krishna Rao
(Ed: Wirsing, Nivat)
[-]
1996Some characteristics of strong innermost normalization
In: Algebraic Methodology and Software Technology, 5th International Conference, AMAST '96, 406-420
Proceedings Article
Krishna Rao
[-]
2000Some characteristics of strong innermost normalization
In: Theoretical Computer Science [239], 141-164
Journal Article
Krishna Rao
[-]
2000Some classes of prolog programs inferable from positive data
In: Theoretical Computer Science [241], 211-223
Journal Article
Krishna Rao
[-]
1998Modular Aspects of term graph rewriting
In: Theoretical Computer Science [208], 59-86
Journal Article
Krishna Rao
[-]
1997A framework for incremental learning of logic programs
In: Theoretical Computer Science [185], 191-213
Journal Article
Krishna Rao
[-]
1996Relating confluence, innermost-confluence and outermost-confluence properties of term rewriting systems
In: Acta Informatica [33], 595-606
Journal Article
Krishna Rao
[-]
1995Modular Proofs for Completeness of hierarchical term rewriting systems
In: Theoretical Computer Science [151], 487-512
Journal Article
Krishna Rao, Shyamasundar
(Ed: Mycroft)
[Shyamasundar]
1995Unification-free Execution of Well-moded Prolog Programs
In: Proc. of International Static Analysis Symposium, 243-260
Proceedings Article
Kupferschmid, Hoffmann, Dierks, Behrmann
(Ed: Valmari)
[-]
2006Adapting an AI Planning Heuristic for Directed Model Checking
In: Model checking software : 13th International SPIN Workshop, 35-52
Proceedings Article
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
Matthews
(Ed: Gabbay)
[-]
1994A Theory and its Metatheory in $FS_0$
In: What is a logical system?, 329-354
Part of a Book
Matthews
(Ed: McCune)
[-]
1997A practical implementation of simple consequence relations using inductive definitions
In: Proceedings of the 14th International Conference on Automated Deduction (CADE-14), 306-320
Proceedings Article
Matthews
(Ed: Paulson)
[-]
1996Implementing $\textrm FS_0$ in Isabelle: Adding Structure at the Metalevel
In: Design and Implementation of Symbolic Computation Systems (DISCO'96), 228-239
Proceedings Article
Matthews
(Ed: Yonezawa, Smith)
[-]
1992Reflection in a Logical System
In: Proc.~IMSA '92 Workshop on Reflection and Meta-Level Architecture, 178-183
Proceedings Article
Matthews, Basin
[Basin]
2000Structuring Metatheory on Inductive Definitions
In: Information and Computation [162], 80-95
Journal Article
Matthews, Basin
[Basin]
1998Scoped Metatheorems
In: Electronic Notes in Computer Science [15], 1-14
Journal Article
Matthews, Simpson
(Ed: Ursini, Agilanò)
[Simpson]
1996Reflection using the derivability conditions
In: Logic and Algebra, 603-616
Part of a Book
Matthews, Smaill, Basin
(Ed: Huet, Plotkin)
[-]
1993Experience with $FS_0$ as a Framework Theory
In: Logical Environments, 61-82
Part of a Book
Meter
(Ed: Blubber, Bla)
[-]
2009Just a test entry
In: Booktitle, 1001-1010
Proceedings Article
Meyer
[-]
1999Soft Typing for Clausal Inference Systems
Universität des Saarlandes
Thesis - PhD thesis
Meyer
[-]
1996Attachment IconParallel Unit Resulting Resolution
Universität des Saarlandes
Thesis - Masters thesis
Meyer, Faber, Rybalchenko
(Ed: Barkaoui, Cavalcanti, Cerone)
[-]
2006Model checking Duration Calculus: a practical approach
In: Theoretical Aspects of Computing - ICTAC 2006 : Third International Colloquium, 332-346
Proceedings Article
Mohr
[-]
1995Resolution-Based Calculi for Modal Logics
Universität des Saarlandes
Thesis - Masters thesis
Mukhopadhyay
[-]
2001Attachment IconA Uniform Constraint-based Framework for the Verification of Infinite State Systems
Universität des Saarlandes
Thesis - PhD thesis
Mukhopadhyay, Podelski
(Ed: Koenig, Holte)
[-]
2002An Algebraic Framework for Abstract Model Checking
In: Abstraction, reformulation, and approximation : 5th International Symposium, SARA 2002, 152-169
Proceedings Article
Mukhopadhyay, Podelski
(Ed: Lloyd, Dahl, Furbach, Kerber, Lau, Palamidessi, Pereira, Sagiv, Stuckey)
[-]
2000Model Checking for Timed Logic Processes
In: Proceedings of the 1st International Conference on Computational Logic, 598-612
Proceedings Article
Mukhopadhyay, Podelski
(Ed: Ramakrishnan)
[Ramakrishnan]
2001Attachment IconConstraint Database Models Characterizing Timed Bisimilarity
In: Proceedings of the 3rd International Symposium on Practical Aspects of Declarative Languages, 245-258
Proceedings Article
Mukhopadhyay, Podelski
(Ed: Ramanujam, Raman)
[Ramanujam, Raman]
1999Attachment IconBeyond Region Graphs: Symbolic Forward Analysis of Timed Automata
In: Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS-99), 232-244
Proceedings Article
Mukhopadhyay, Podelski
(Ed: Zamulin, Broy, Bjorner)
[-]
2001Accurate Widenings and Boundedness Properties of Timed Systems
In: Perspectives of System Informatics: 4th International Andrei Ershov Memorial Conference, 79-94
Proceedings Article
Müller, Niehren, Podelski
(Ed: Bidoit, Dauchet)
[Müller, Niehren, Bidoit, Dauchet]
1997Inclusion Constraints over Non-empty Sets of Trees
In: Proceedings of the 7th International Joint Conference CAAP/FASE: Theory and practice of software development (TAPSOFT-97), 345-356
Proceedings Article
Müller, Niehren, Podelski
(Ed: Smolka)
[Müller, Niehren, Smolka]
1997Ordering Constraints over Feature Trees
In: Proceedings of the 3rd International Conference on Principles and Practice of Constraint Programming (CP-97), 549-562
Proceedings Article
Müller, Niehren, Podelski
[Müller, Niehren]
2000Ordering Constraints over Feature Trees
In: Constraints [5], 7-41
Journal Article
Naumann
[-]
1997Integration des automatischen Beweisers SPASS in die mathematische Assistenzumgebung OMEGA
Universität des Saarlandes
Thesis - Masters thesis
Nielson, Seidl
(Ed: Hussmann)
[Seidl]
2001Control-Flow Analysis in Cubic Time
In: Proceedings of the 10th European Symposium on Programming (ESOP-01) held as part of the Joint European Conferences on Theory and Practice of Software (ETAPS-01), 252-268
Proceedings Article
Nieuwenhuis, Hillenbrand, Riazanov, Voronkov
(Ed: Goré, Leitsch, Nipkow)
[Nieuwenhuis, Riazanov, Voronkov, Goré, Leitsch, Nipkow]
2001Attachment IconOn the Evaluation of Indexing Techniques for Theorem Proving
In: Automated reasoning : First International Joint Conference, IJCAR 2001, 257-271
Proceedings Article
Nivat, Podelski
[Nivat]
1997Minimal Ascending and Descending Tree Automata
In: SIAM Journal on Computing [26], 39-58
Journal Article
Nonnengart
(Ed: Bajcsy)
[Bajcsy]
1993First-Order Modal Logic Theorem Proving and Functional Simulation
In: Proc.~13th Intern.~Joint Conference on Artificial Intelligence (IJCAI '93), 80-85
Proceedings Article
Nonnengart
(Ed: MacNish, Pearce, Pereira)
[MacNish, Pearce, Pereira]
1994How to Use Modalities and Sorts in Prolog
In: Logics in Artificial Intelligence: Proceedings of the JELIA'94, 365-378
Proceedings Article
Nonnengart
(Ed: McRobbie, Slaney)
[McRobbie, Slaney]
1996Resolution-Based Calculi for Modal and Temporal Logics
In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), 598-612
Proceedings Article
Nonnengart
[-]
2001Strong SkolemizationUnpublished/Draft
Nonnengart
[-]
1998Modal Frame Characterization by Way of Auxiliary Modalities
In: Logic Journal of the IGPL [6], 875-899
Journal Article
Nonnengart
[-]
1995A Resolution-Based Calculus for Temporal Logics
Universität des Saarlandes
Thesis - PhD thesis
Nonnengart, Ohlbach
(Ed: Bläsius, Bürckert)
[Bläsius, Bürckert]
1992Modal- und Temporallogik
In: Deduktionssysteme - Automatisierung des logischen Denkens, 239-284
Part of a Book
Nonnengart, Ohlbach, Gabbay
(Ed: Robinson, Voronkov)
[Ohlbach, Gabbay]
2001Encoding two-valued non-classical logics in classic logic
In: Handbook of Automated Reasoning, 1403-1486
Part of a Book
Nonnengart, Ohlbach, Szalas
[Szalas, Ohlbach]
2001Quantifier Elimination for Second-Order Predicate LogicUnpublished/Draft
Nonnengart, Rock, Weidenbach
(Ed: Kirchner, Kirchner)
[Rock, Kirchner, Kirchner]
1998On Generating Small Clause Normal Forms
In: Proceedings of the 15th International Conference on Automated Deduction (CADE-98), 397-411
Proceedings Article
Nonnengart, Szalas
(Ed: Orlowska)
[Szalas, Orlowska]
1999A Fixpoint Approach to Second-Order Quantifier Elimination with Applications to Correspondence Theory
In: Logic at Work: Essays Dedicated to the Memory of Helena Rasiowa, 18
Part of a Book
Nonnengart, Weidenbach
(Ed: Robinson, Voronkov)
[Robinson, Voronkov]
2001Computing small clause normal forms
In: Handbook of Automated Reasoning, 335-367
Part of a Book
Ohlbach
(Ed: Kobsa)
[-]
1993Ein kurzes Tutorial über funktionale Übersetzung von Modallogik nach Prädikatenlogik
In: Bericht Nr. 15/93: Recommendations for Extensions to BGP-MS, 19-26
Proceedings Article
Ohlbach
(Ed: McRobbie, Slaney)
[McRobbie, Slaney]
1996SCAN-Elimination of Predicate Quantifiers
In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), 161-165
Proceedings Article
Ohlbach
(Ed: Voronkov)
[Voronkov]
1993Optimized Translation of Multi Modal Logic into Predicate Logic
In: Proceedings of the 4th International Conference on Logic Programming and Automated Reasoning (LPAR'93), 253-264
Proceedings Article
Ohlbach
[-]
1995Boolean Algebras with Functions - Correspondence, Completeness and Quantifier EliminationUnpublished/Draft
Ohlbach
[-]
1995Clause Killer TransformationsUnpublished/Draft
Ohlbach
[-]
1993Thema der Antrittsvorlesung: Transformation logischer Systeme
Universität des Saarlandes
Thesis - Habilitation thesis
Ohlbach
[-]
1993Translation Methods for Non-Classical Logics: An Overview
In: Bulletin of the Interest Group in Propositional and Predicate Logics (IGPL) [1], 69-90
Journal Article
Ohlbach
[-]
1992Logic Engineering: Konstruktion von Logiken
In: KI [3], 34-38
Journal Article
Ohlbach
[-]
1991Semantics Based Translation Methods for Modal Logics
In: Journal of Logic and Computation [1], 691-746
Journal Article
Ohlbach
[-]
1988A Resolution Calculus for Modal Logics
Universität Kaiserslautern
Thesis - PhD thesis
Ohlbach, Herzig
[-]
1991Parameter Structures for Parametrized Modal Operators
In: Proc.~Intern.~Joint Conference on Artificial Intelligence (IJCAI'91), 512-517
Proceedings Article
Ohlbach, Koehler
[Koehler]
1996Reasoning about Sets via Atomic DecompositionReport
Ohlbach, Schmidt
[-]
1997Functional Translation and Second-Order Frame Properties of Modal Logics
In: Journal of Logic and Computation [7], 581-603
Journal Article
Ohlbach, Schmidt, Hustadt
(Ed: Borgida, Lenzerini, Nardi, Nebel)
[Borgida, Lenzerini, Nardi, Nebel]
1995Symbolic Arithmetical Reasoning with Qualified Number Restrictions
In: Proceedings of International Workshop on Description Logics'95, 89-95
Proceedings Article
Ohlbach, Schmidt, Hustadt
(Ed: Wansing)
[Wansing]
1996Translating Graded Modalities into Predicate Logic
In: Proof Theory of Modal Logic, 253-291
Part of a Book
Ohlbach, Siekmann
(Ed: Lassez, Plotkin)
[-]
1991The Markgraf Karl Refutation Procedure
In: Computational Logic, Essays in Honor of Alan Robinson, 41-112
Proceedings Article
Ohlbach, Weidenbach
[-]
1995A Note on Assumptions about Skolem Functions
In: Journal of Automated Reasoning [15], 267-275
Journal Article
Pacholski, Podelski
(Ed: Smolka)
[Pacholski, Smolka]
1997Set Constraints: a Pearl in Research on Constraints
In: Proceedings of the 3rd International Conference on Principles and Practice of Constraint Programming (CP-97), 549-562
Proceedings Article
Piskac
[-]
2005Formal Correctness of Result Checking for Priority Queues
Universität des Saarlandes
Thesis - Masters thesis
Plaisted
(Ed: Bundy)
[-]
1994The Search Efficiency of Theorem Proving Strategies
In: Proceedings of the 12th International Conference on Automated Deduction (CADE-12), 57-71
Proceedings Article
Plaisted
(Ed: Gabbay, Hogger, Robinson, Siekmann)
[-]
1993Equational Reasoning and Term Rewriting Systems
In: Handbook of Logic in Artificial Intelligence and Logic Programming, 273-364
Proceedings Article
Pnueli, Podelski, Rybalchenko
(Ed: Halbwachs, Zuck)
[-]
2005Separating Fairness and Well-Foundedness for the Analysis of Fair Discrete Systems
In: Tools and Algorithms for the Construction and Analysis of Systems: 11th International Conference, TACAS 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, 124-139
Proceedings Article
Podelski
(Ed: Maluszynski)
[-]
1997Set-Based Analysis of Logic Programs and Reactive Logic Programs
In: Proceedings of the International Symposium on Logic Programming (ILPS-14), 35-36
Proceedings Article
Podelski
(Ed: Palsberg)
[Palsberg]
2000Model Checking as Constraint Solving
In: Proceedings of the 7th International Symposium on Static Analysis (SAS-00), 221-237
Proceedings Article
Podelski
(Ed: Zuck, Attie, Cortesi, Mukhopadhyay)
[-]
2003Software Model Checking with Abstraction Refinement
In: Verification, model checking, and abstract interpretation : 4th International Conference, VMCAI 2003, 1-13
Proceedings Article
Podelski
[-]
2004Introduction to the Special Issue on Verification and Computational Logic
In: Theory and Practice of Logic Programming (TPLP) [4], 541-751
Journal Article
Podelski
[-]
1998Thema der Antrittsvorlesung: Alte Resultate aus der Automatentheorie
Universität des Saarlandes
Thesis - Habilitation thesis
Podelski (ed.)
(Ed: Podelski)
[-]
1995Constraint Programming: Basics and Trends
In: Constraint Programming: Basics and Trends, 328
Proceedings
Podelski, Ball, Rajamani
(Ed: Kaoen, Stevens)
[-]
2002Relative Completeness of Abstraction Refinement for Software Model Checking
In: Tools and algorithms for the construction and analysis of systems : 8th International Conference, TACAS 2002, 158-172
Proceedings Article
Podelski, Ball, Rajamani
[Ball, Rajamani]
2003Boolean and Cartesian Abstraction for Model Checking C Programs
In: International Journal on Software Tools for Technology Transfer (STTT) [5], 1-15
Journal Article
Podelski, Charatonik, Müller
(Ed: Swierstra)
[Müller, Swierstra]
1999Set-based Failure Analysis for Logic Programs and Concurrent Constraint Programs
In: Programming Languages and Systems: Proceedings of the 8th European Symposium on Programming (ESOP-99), 177-192
Proceedings Article
Podelski, Rybalchenko
(Ed: Hanus)
[-]
2007Attachment IconARMC: The Logical Choice for Software Model Checking with Abstraction Refinement
In: Practical aspects of declarative languages : 9th International Symposium, PADL 2007, 245-259
Proceedings Article
Podelski, Rybalchenko
(Ed: Levi, Steffen)
[-]
2004A Complete Method for the Synthesis of Linear Ranking Functions
In: Verification, model checking, and abstract interpretation : 5th International Conference, VMCAI 2004, 239-251
Proceedings Article
Podelski, Rybalchenko
(Ed: Palsberg, Abadi)
[-]
2005Transition predicate abstraction and fair termination
In: Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2005, 124-139
Proceedings Article
Podelski, Rybalchenko
[-]
2007Transition Predicate Abstraction and Fair Termination
In: ACM Transactions on Programming Languages and Systems [29], 30
Journal Article
Podelski, Rybalchenko
[-]
2004Transition Invariants
In: Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, LICS 2004, 32-41
Proceedings Article
Podelski, Rybalchenko, Cook
[-]
2005Counterexample-Guided Abstraction Refinement for TerminationUnpublished/Draft
Podelski, Schaefer, Wagner
(Ed: Sagiv)
[-]
2005Attachment IconSummaries for While Programs with Recursion
In: Programming Languages and Systems: 14th European Symposium on Programming, ESOP 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, 94-107
Proceedings Article
Podelski, Schaefer, Wagner
[-]
2004Attachment IconSummaries for While Programs with RecursionReport
Podelski, Smolka
(Ed: Montanari, Rossi)
[-]
1995Situated Simplification
In: Proceedings of the First International Conference on Principles and Practice of Constraint Programming (CP'95), 328-344
Proceedings Article
Podelski, Smolka
(Ed: Sterling)
[-]
1995Operational Semantics of Constraint Logic Programming with Coroutining
In: Proceedings of the 12th International Conference on Logic Programming, 449-463
Proceedings Article
Podelski, Smolka
[Smolka]
1997Situated Simplification
In: Theoretical Computer Science [173], 235-252
Journal Article
Podelski, Wagner
(Ed: Bemporad, Bicchi, Buttazzo)
[-]
2007Attachment IconA Sound and Complete Proof Rule for Region Stability of Hybrid Systems
In: Hybrid systems: computation and control : 10th International Conference, HSCC 2007, 750-753
Poster
Podelski, Wagner
(Ed: Hespanha, Tiwari)
[-]
2006Model Checking of Hybrid Systems: From Reachability towards Stability
In: Hybrid Systems: Computation and Control : 9th International Workshop, HSCC 2006
, 507-521
Proceedings Article
Podelski, Wagner
[-]
2007Attachment IconA Method and a Tool for Automatic Verification of Region Stability for Hybrid SystemsReport
Podelski, Wies
(Ed: Hankin, Siveroni)
[-]
2005Boolean Heaps
In: Static analysis : 12th International Symposium, SAS 2005, 268-283
Proceedings Article
Prevosto
(Ed: Coquand, Lombardi, Roy)
[-]
2006Certified mathematical hierarchies: the FoCal system.
In: Proceedings of the MAP (Mathematics, Algorithms, Proofs) Workshop,
Electronic Proceedings Article
Prevosto, Boulmé
(Ed: Urzyczyn)
[-]
2005Proof Contexts with Late Binding
In: Typed Lambda Calculi and Applications: 7th International Conference, TLCA 2005, 325-339
Proceedings Article
Prevosto, Waldmann
(Ed: Sutcliffe, Schmidt, Schulz)
[-]
2006SPASS+T
In: ESCoR: FLoC'06 Workshop on Empirically Successful Computerized Reasoning, 18-33
Proceedings Article
Rahman, Rückert, Fischmann
[Rahman, Rückert]
1997Dialogues and Ontology, the Dialogical Approach to Free Logic
In: Logique et Analyse [160], 357-374
Journal Article
Ratschan
(Ed: Dolzmann, Seidl, Sturm)
[-]
2005Solving Undecidable Problems in the Theory of Real Numbers and Hybrid Systems
In: Algorithmic Algebra and Logic; Conference in Honor of the 60th Birthday of Volker Weispfenning, 213-216
Proceedings Article
Ratschan
(Ed: Rossi)
[-]
2003Solving 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
Proceedings Article
Ratschan
[-]
2006Efficient Solving of Quantified Inequality Constraints over the Real Numbers
In: ACM Transactions on Computational Logic [7], 723-748
Journal Article
Ratschan
[-]
2004Convergent Approximate Solving of First-order Constraints by Approximate Quantifiers
In: ACM Transactions on Computational Logic [5], 264-281
Journal Article
Ratschan, She
(Ed: Calmet, Ida, Wang)
[-]
2006Constraints for Continuous Reachability in the Verification of Hybrid Systems
In: Artificial Intelligence and Symbolic Computation, 8th International Conference, AISC 2006, 196-210
Proceedings Article
Ratschan, She
(Ed: Morari, Thiele)
[-]
2005Safety Verification of Hybrid Systems by Constraint Propagation Based Abstraction Refinement
In: Hybrid Systems: Computation and Control: 8th International Workshop, HSCC 2005, 573-589
Proceedings Article
Ratschan, She
[-]
2007Attachment IconSafety Verification of Hybrid Systems by Constraint Propagation Based Abstraction Refinement
In: ACM Transactions in Embedded Computing Systems [6], 1-23
Journal Article
Ratschan, Smaus
(Ed: Cassandras, Giua, Seatzu, Zaytoon)
[-]
2006Verification-Integrated Falsification of Non-Deterministic Hybrid Systems
In: 2nd IFAC Conference on Analysis and Design of Hybrid Systems, ?
Proceedings Article
Ratschan, Vehi
(Ed: Bittanti)
[-]
2004Attachment IconRobust Pole Clustering of Parametric Uncertain Systems Using Interval Methods
In: Robust control design 2003 : (ROCOND 2003) ; a proceedings volume from the 4th IFAC symposium, 323-328
Proceedings Article
Rau
[-]
1997Adaption of a Fuzzy Controller for a Cybernetic System through an Evolutionary Algorithm
Universität des Saarlandes
Thesis - Masters thesis
Reinold
[-]
1991Transformation in dichten Wäldern
Universität des Saarlandes
Thesis - Masters thesis
Rock
[-]
1995Attachment IconTransformations of First-Order Formulae for Automated Reasoning
Universität des Saarlandes
Thesis - Masters thesis
Rybalchenko
[-]
2007Precise Thread-Modular Verification
In: 14th International Static Analysis Symposium (SAS 2007), ?
Proceedings Article
Rybalchenko
[-]
2002Attachment IconA Model Checker based on Abstraction Refinement
Universität des Saarlandes
Thesis - Masters thesis
Rybalchenko, Sofronie-Stokkermans
(Ed: Cook, Podelski)
[-]
2007Constraint Solving for Interpolation
In: 8th International Conference on Verification, Model Checking and Abstract Interpretation (VMCAI 2007), ?
Proceedings Article
Schäf
[-]
2006Attachment IconAbstrakte Übergangsrelationen als Mittel zur Verifikation von Programmeigenschaften
Universität des Saarlandes
Thesis - Masters thesis
Schlobach
[-]
1996Untersuchung nicht-monotoner Logiken - Fallstudie zur Automatisierung
Universität des Saarlandes
Thesis - Masters thesis
Schmidt
(Ed: Böttner, Thümmel)
[Böttner, Thümmel]
2000Relational Grammars for Knowledge Representation
In: Variable-Free Semantics, 162-180
Part of a Book
Schmidt
(Ed: Brink, Schmidt)
[-]
1994Peirce Algebras and Their Applications in Artificial Intelligence and Computational Linguistics: Abstract
In: Relational Methods in Computer Science; Dagstuhl Seminar Report 80 (9403), 21-22
Proceedings Article
Schmidt
(Ed: Kracht, de Rijke, Wansing, Zakharyaschev)
[Kracht, de Rijke, Wansing, Zakharyaschev]
1998Resolution is a Decision Procedure for Many Propositional Modal Logics
In: Advances in Modal Logic, Volume 1, 189-208
Part of a Book
Schmidt
(Ed: Kunze, Stoyan)
[-]
1994Terminological Logics and Conceptual Graphs: An Historical Perspective
In: KI-94 Workshops: Extended Abstracts, 135-136
Proceedings Article
Schmidt
(Ed: Nipkow)
[Nipkow]
1998E-Unification for Subsystems of S4
In: Proceedings of the 9th International Conference on Rewriting Techniques and Applications (RTA-98), 106-120
Proceedings Article
Schmidt
(Ed: Ohlbach)
[-]
1993Terminological Representation, Natural Language \& Relation Algebra
In: GWAI-92: Advances in Artificial Intelligence: Proc.~16th German Workshop on Artificial Intelligence, 357-371
Proceedings Article
Schmidt
[-]
1999Decidability by Resolution for Propositional Modal Logics
In: Journal of Automated Reasoning [22], 379-396
Journal Article
Schmidt
[-]
1997Optimised Modal Translation and Resolution
Universität des Saarlandes
Thesis - PhD thesis
Schmidt
[-]
1994Peirce Algebras and Their Applications in Artificial Intelligence and Computational Linguistics: Abstract
In: SIGALA Newsletter [2], 27-27
Journal Article
Schmidt, Hustadt
(Ed: Baader)
[-]
2003A 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
Proceedings Article
Schmidt, Orłowska, Hustadt
(Ed: Berghammer, Möller, Struth)
[-]
2004Two 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
Proceedings Article
Schmidt, Tishkovsky
(Ed: Balbiani, Suzuki, Wolter, Zakharyaschev)
[Schmidt, Tishkovsky]
2003Combining Dynamic Logic and Doxastic Modal Logics
In: Advances in Modal Logic, 371-391
Part of a Book
Schmidt, Tishkovsky
(Ed: Flesca, Greco, Leone, Ianni)
[-]
2002Multi-Agent Logic of Dynamic Belief and Knowledge
In: Proceedings of the 8th European Conference on Logics in Artificial Intelligence (JELIA), 38-49
Proceedings Article
Schmidt, Tishkovsky
[-]
2004Multi-Agent Dynamic Logics with Informational Test
In: Annals of Mathematics and Artificial Intelligence [42], 5-36
Journal Article
Schmidt, Tishkovsky
[Schmidt, Tishkovsky]
2003Multi-Agent Logic of Dynamic Belief and KnowledgeUnpublished/Draft
Schmidt, Tishkovsky, Hustadt
[-]
2004Interaction between Knowledge, Action and Commitment within Agent Dynamic Logic
In: Studia Logica [78], 381-415
Journal Article
Schmidt, Tishkovsky, Hustadt
[Schmidt, Tishkovsky, Hustadt]
2002Interaction between Knowledge, Action and Commitment within Agent Dynamic LogicUnpublished/Draft
Schmolzi
[-]
1999Kooperative koevolutionäre Entwicklung von Fuzzy-Reglern
Universität des Saarlandes
Thesis - Masters thesis
She, Ratschan
[-]
2006Providing a Basin of Attraction to a Target Region by Computation of Lyapunov-like Functions
In: 4th IEEE International Conference on Computational Cybernetics, 245-249
Proceedings Article
She, Xia, Xiao
(Ed: Kovalerchuk)
[-]
2006A Semi-Algebraic Approach for the Computation of Lyapunov Functions
In: 2th IASTED International Conference on COMPUTATIONAL INTELLIGENCE, 7-12
Proceedings Article
Simon, Freiheit, Olbrich
(Ed: Nüttgens, Rump, Mendling)
[-]
2006Using BPEL processes defined by Event-driven Process Chains
In: 5. GI-Workshop "EPK 2006 - Geschäftsprozessmanagement mit Ereignisgesteuerten Prozessketten", 121-135
Proceedings Article
Smaus
[-]
1996Finding Resolution K-Transformations
Universität des Saarlandes
Thesis - Masters thesis
Socher-Ambrosius
(Ed: Book)
[-]
1991Boolean Algebra Admits no Convergent Term Rewriting System
In: Proceedings of the 4th International Conference on Rewriting Techniques and Applications (RTA-91), 264-274
Proceedings Article
Socher-Ambrosius
(Ed: Bundy)
[-]
1994A Refined Version of General E-Unification
In: Proceedings of the 12th International Conference on Automated Deduction (CADE-12), 665-677
Proceedings Article
Socher-Ambrosius
(Ed: Kirchner, Levi)
[-]
1992A Goal Oriented Strategy Based on Completion
In: Proc.~3rd Intern.~Conference on Algebraic and Logic Programming, 435-445
Proceedings Article
Socher-Ambrosius
(Ed: Voronkov)
[-]
1993Unification in Order-Sorted Logic with Term Declarations
In: Proceedings of the 4th Conference on Logic Programming and Automated Reasoning (LPAR-93), 301-308
Proceedings Article
Socher-Ambrosius
[-]
1992How to Avoid the Derivation of Redundant Clauses in Reasoning Systems
In: Journal of Automated Reasoning [9], 325-336
Journal Article
Socher-Ambrosius
[-]
1991On the Church-Rosser Property in Left-Linear SystemsReport
Socher-Ambrosius
[-]
1991On the Relation Between Completion Based and Resolution Based Theorem Proving
In: Journal of Symbolic Computation [11], 129-148
Journal Article
Socher-Ambrosius
[-]
1991Optimizing the Clausal Normal Form Transformation
In: Journal of Automated Reasoning [7], 325-336
Journal Article
Sofronie-Stokkermans
(Ed: Autexier, Mantel)
[-]
2006Local reasoning in verification
In: Proceedings of VERIFY'06: Verification Workshop, 128-145
Electronic Proceedings Article
Sofronie-Stokkermans
(Ed: Cachro, Kijania-Placek)
[Cachro, Kijania-Placek]
1999Resolution-based theorem proving for non-classical logics based on distributive lattices with operators
In: Proceedings of the 11th International Congress of Logic, Methodology and Philosophy of Science. Volume of abstracts, 481-481
Proceedings Article
Sofronie-Stokkermans
(Ed: Egly, Fermüller)
[-]
2002Attachment IconOn uniform word problems involving bridging operators on distributive lattices
In: Automated Reasoning with Analytic and Related Methods : International Conference, TABLEAUX 2002, 235-250
Proceedings Article
Sofronie-Stokkermans
(Ed: Eklund, Escalada-Imaz, Haehnle, Vojtas)
[Eklund, Escalada-Imaz, Haehnle, Vojtas]
1998Representation Theorems and Automated Theorem Proving in Certain Classes of Non-Classical Logics
In: Proceedings of the Workshop on Many-Valued Logic for AI Applications (ECAI-98), ?-?
Proceedings Article
Sofronie-Stokkermans
(Ed: Fitting, Orlowska)
[-]
2003Attachment IconRepresentation Theorems and the Semantics of Non-classical Logics, and Applications to Automated Theorem Proving
In: Beyond Two: Theory and Applications of Multiple Valued Logic, 59-100
Part of a Book
Sofronie-Stokkermans
(Ed: Furbach, Shankar)
[-]
2006Attachment IconInterpolation in local theory extensions
In: Proceedings of IJCAR 2006, 235-250
Proceedings Article
Sofronie-Stokkermans
(Ed: Ganzinger)
[-]
1999Attachment IconOn the Universal Theory of Varieties of Distributive Lattices with Operators: Some Decidability and Complexity Results
In: Proceedings of the 16th International Conference on Automated Deduction (CADE-16), 157-171
Proceedings Article
Sofronie-Stokkermans
(Ed: Iturrioz, Orlowska, Turunen)
[Iturrioz, Orlowska, Turunen]
2000Some properties of Kleene algebras
In: COST Action 15 (Many-Valued Logics for Computer Science Applications) ATLAS of Many-Valued Structures, 1-7
Part of a Book
Sofronie-Stokkermans
(Ed: McAllester)
[McAllester]
2000Attachment IconOn unification for bounded distributive lattices
In: Proceedings of the 17th International Conference on Automated Deduction (CADE-17), 465-481
Proceedings Article
Sofronie-Stokkermans
(Ed: Nadif, Napoli, SanJuan, Sigayret)
[-]
2003Attachment IconAutomated 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
Proceedings Article
Sofronie-Stokkermans
(Ed: Nieuwenhuis)
[-]
2005Attachment IconHierarchic reasoning in local theory extensions
In: Automated deduction - CADE-20 : 20th International Conference on Automated Deduction, 219-234
Proceedings Article
Sofronie-Stokkermans
(Ed: Prade)
[Prade]
1998On Translation of Finitely-Valued Logics to Classical First-Order Logic
In: Proceedings of the 13th European Conference on Artificial Intelligence (ECAI-98), 410-411
Proceedings Article
Sofronie-Stokkermans
(Ed: Vaz de Carvalho, Ferreirim)
[Vaz de Carvalho, Ferreirim]
1999Priestley representation for distributive lattices with operators and applications to automated theorem proving
In: Dualities, Interpretability and Ordered Structures, 43-54
Proceedings Article
Sofronie-Stokkermans
[-]
2007Attachment IconAutomated theorem proving by resolution in non-classic logics
In: Discrete Applied Mathematics [?], ?
Journal Article
Sofronie-Stokkermans
[-]
2007Attachment IconOn unification for bounded distributive lattices
In: ACM Transactions on Computational Logic [8], ?
Journal Article
Sofronie-Stokkermans
[-]
2006Sheaves and geometric logic in concurrency
In: Proceedings of the Eighth Workshop on Geometric and Topological Methods in Concurrency (GETCO 2006), ?
Proceedings Article
Sofronie-Stokkermans
[-]
2004Algebraic and logical methods in automated theorem proving and in the study of concurrency
Universität des Saarlandes
Thesis - Habilitation thesis
Sofronie-Stokkermans
[-]
2004Resolution-based decision procedures for the positive theory of some finitely generated varieties of algebras
In: Proceedings of the 34th International Symposium on Multiple-Valued Logic (ISMVL-2004), 32-37
Proceedings Article
Sofronie-Stokkermans
[-]
2003Attachment IconResolution-based decision procedures for the universal theory of some classes of distributive lattices with operators
In: Journal of Symbolic Computation [36], 891-924
Journal Article
Sofronie-Stokkermans
[-]
2001Attachment IconAutomated Theorem Proving by Resolution for Finitely-Valued Logics Based on Distributive Lattices with Operators
In: Multiple-Valued Logic - An International Journal [6], 289-344
Journal Article
Sofronie-Stokkermans
[-]
2001Representation theorems and the semantics of (semi)lattice-based logics
In: Proceedings of the 31st IEEE International Symposium on Multiple-Valued Logics, 125-134
Proceedings Article
Sofronie-Stokkermans
[-]
2000Attachment IconDuality and Canonical Extensions of Bounded Distributive Lattices with Operators and Applications to the Semantics of Non-Classical Logics. Part I
In: Studia Logica [64], 93-132
Journal Article
Sofronie-Stokkermans
[-]
2000Attachment IconDuality and Canonical Extensions of Bounded Distributive Lattices with Operators and Applications to the Semantics of Non-Classical Logics. Part II
In: Studia Logica [64], 151-172
Journal Article
Sofronie-Stokkermans
[-]
2000Attachment IconPriestley Duality for SHn-algebras and Applications to the Study of Kripke-style Models for SHn-logics
In: Multiple-Valued Logic - An International Journal [5], 281-305
Journal Article
Sofronie-Stokkermans
[-]
1999Representation Theorems and Automated Theorem Proving in Non-Classical Logics
In: Proceedings of the 29th IEEE International Symposium on Multiple-Valued Logic (ISMVL-99), 242-247
Proceedings Article
Sofronie-Stokkermans
[-]
1998Attachment IconResolution-based Theorem Proving for SHn-LogicsReport
Sofronie-Stokkermans
[Caferra, Salzer]
2000Attachment IconResolution-based theorem proving for SHn-logics
In: Automated Deduction in Classical and Non-Classical Logic (Selected Papers of FTP'98), 268-282
Proceedings Article
Sofronie-Stokkermans, Stokkermans
(Ed: Ciobanu, Paun)
[-]
1999Attachment IconModeling Interaction by Sheaves and Geometric Logic
In: Proceedings of the 12th International Symposium Fundamentals of Computation Theory (FCT-99), 512-523
Proceedings Article
Struth
(Ed: Comon)
[Comon]
1997On the Word Problem for Free Lattices
In: Proceedings of the 8th International Conference on Rewriting Techniques and Applications (RTA-97), 128-141
Proceedings Article
Struth
(Ed: Kunze, Stoyan)
[-]
1994Intensionality, Possible Worlds and Propositional Attitudes: Formal and Philosophical Foundations of Modal Semantics
In: KI-94 Workshops: Extended Abstracts, 108-109
Proceedings Article
Struth
[-]
1998Canonical Transformation in Algebra, Universal Algebra and Logic
Universität des Saarlandes
Thesis - PhD thesis
Struth
[-]
1994Philosophical Logics: A Survey and a BibliographyReport
Stuber
(Ed: Bachmair)
[-]
2000Deriving Theory Superposition Calculi from Convergent Term Rewriting Systems
In: Proceedings of the 11th International Conference Rewriting Techniques and Applications (RTA-00), 229-245
Proceedings Article
Stuber
(Ed: Bibel, Schmitt)
[Bibel, Schmitt]
1998Superposition theorem proving for commutative rings
In: Automated Deduction - A Basis for Applications. Volume III. Applications, 31-55
Part of a Book
Stuber
(Ed: Bonacina, Furbach)
[Bonacina, Furbach]
1997Strong Symmetrization, Semi-Compatibility of Normalized Rewriting and First-Order Theorem Proving
In: Proceedings of the International Workshop on First-Order Theorem Proving (FTP-97), 125-129
Proceedings Article
Stuber
(Ed: Ganzinger)
[-]
1996Superposition Theorem Proving for Abelian Groups Represented as Integer Modules
In: Rewriting Techniques and Applications, 7th International Conference, RTA-96, 33-47
Proceedings Article
Stuber
(Ed: Narendran, Rusinowitch)
[Narendran, Rusinowitch]
1999Theory path orderings
In: Proceedings of the 10th International Conference on Rewriting Techniques and Applications (RTA-99), 148-162
Proceedings Article
Stuber
(Ed: Van Hentenryck)
[-]
1994Computing Stable Models by Program Transformation
In: Proceedings of the 11th International Conference on Logic Programming (ICLP'94), 58-73
Proceedings Article
Stuber
[-]
1999Attachment IconSuperposition Theorem Proving for Commutative Algebraic Theories
Universität des Saarlandes
Thesis - PhD thesis
Stuber
[-]
1998Superposition theorem proving for abelian groups represented as integer modules
In: Theoretical Computer Science [208], 149-177
Journal Article
Stuber
[-]
1991Attachment IconInductive Theorem Proving for Horn Clauses
Universität Dortmund
Thesis - Masters thesis
Suchanek
[-]
2005Ontological Reasoning for Natural Language Understanding
Universität des Saarlandes
Thesis - Masters thesis
Talbot
(Ed: Parigot, Voronkov)
[Parigot, Voronkov]
2000On the Alternation-free Horn mu-calculus
In: Proceedings of the 7th International Conference on Logic for Programming and Automated Reasoning (LPAR-2000), 418-435
Proceedings Article
Talbot
[-]
2000The $\exists \forall^2$ fragment of the First-Order Theory of Set Constraints is $\pi^0_1$-hard
In: Information Processing Letters [74], 27-33
Journal Article
Talbot, Devienne, Tison
[Devienne, Tison]
2000Generalized Definite Set Constraints
In: Constraints [5], 161-202
Journal Article
Talbot, Niehren, Müller
(Ed: Longo)
[Niehren, Müller, Longo]
1999Entailment of Atomic Set Constraints is PSPACE-Complete
In: Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science (LICS-99), 285-294
Proceedings Article
Thiebaux, Hoffmann, Nebel
(Ed: Gottlob)
[-]
2003In Defense of PDDL Axioms
In: 18th International Joint Conference on Artificial Intelligence, 961-966
Proceedings Article
Timm
[-]
1997Attachment IconTesting the Satisfiability of RPO Constraints
Universität des Saarlandes
Thesis - Masters thesis
Trueg, Hoffmann, Nebel
(Ed: Biundo, Frühwirth, Palm)
[-]
2004Applying Automatic Planning Systems to Airport Ground Traffic Control -- A Feasibility Study
In: KI 2004: Advances in Artificial Intelligence: 27th Annual German Conference on AI, KI 2004, 183-197
Proceedings Article
Tzakova
(Ed: Murray)
[Murray]
1999Tableau Calculi for Hybrid Logics
In: Proceedings of the International Conference TABLEAUX'99 - Automated Reasoning with Analytic Tableaux and Related Methods, 278-292
Proceedings Article
Tzakova
[-]
1999Hybrid Languages
Universität des Saarlandes
Thesis - PhD thesis
van der Torre
(Ed: Dix, Fariñas del Cerro, Furbach)
[-]
1998Phased labeled logics of conditional goals
In: Proceedings of the 6th European Workshop on Logics in AI: Logics in Artificial Intelligence (JELIA-98), 92-106
Proceedings Article
van der Torre
(Ed: Hunter, Parsons)
[Hunter, Parsons]
1999Defeasible Goals
In: Proceedings of the 5th European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty (ECSQARU-99), 374-385
Proceedings Article
van der Torre
(Ed: Prade)
[-]
1998Labeled logics of conditional goals
In: Proceedings of the 13th European Conference on Artificial Intelligence (ECAI-98), 368-369
Proceedings Article
van der Torre, Tan
(Ed: Brewka, Habel, Nebel)
[Tan]
1997Reasoning about exceptions
In: Proceedings of the 21st Annual German Conference on Artificial Intelligence (KI-97): Advances in Artificial Intelligence, 405-408
Proceedings Article
van der Torre, Tan
(Ed: Cavalcanti)
[Tan, Cavalcanti]
1999Contextual Deontic Logic: violation contexts and factual defeasibility
In: Formal Aspects in Context, 173-192
Part of a Book
van der Torre, Tan
(Ed: Dix, Fariñas del Cerro, Furbach)
[Tan]
1998Prohairetic Deontic Logic (PDL)
In: Proceedings of the 6th European Workshop on Logics in AI: Logics in Artificial Intelligence (JELIA-98), 77-91
Proceedings Article
van der Torre, Tan
(Ed: Laskey, Prade)
[Tan, Laskey, Prade]
1999An Update Semantics for Defeasible Obligations
In: Proceedings of the 15th Conference on Uncertainty in Artificial Intelligence (UAI-99), 631-638
Proceedings Article
van der Torre, Tan
(Ed: McNamara, Prakken)
[Tan, McNamara, Prakken]
1999An update semantics for deontic reasoning
In: Norms, Logics and Information Systems: New Studies on Deontic Logic and Computer Science, 73-90
Part of a Book
van der Torre, Tan
(Ed: Prade)
[Tan]
1998An update semantics for prima facie obligations
In: Proceedings of the 13th European Conference on Artificial Intelligence (ECAI-98), 38-42
Proceedings Article
van der Torre, Tan
[Tan]
1999Contrary-to-duty reasoning with preference-based dyadic obligations
In: Annals of Mathematics and Artificial Intelligence [27], 49-78
Journal Article
van der Torre, Tan
[Tan]
1999Diagnosis and Decision Making in Normative Reasoning
In: Journal of Artificial Intelligence and Law [7], 51-67
Journal Article
van der Torre, Tan
[Tan]
1999Rights, Duties and Commitments Between Agents
In: Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99), 1239-1244
Proceedings Article
van der Torre, Tan
[Tan]
1998The temporal analysis of Chisholm's paradox
In: Proceedings of the 15th National Conference, and 10th Conference on Innovative Applications of Artificial Intelligence (AAAI-98) and (IAAI-98), 650-655
Proceedings Article
van der Torre, Tan
[Tan]
1997Distinguishing different roles in normative reasoning
In: Proceedings of the 6th International Conference on Artificial Intelligence and Law (ICAIL-97), 225-232
Proceedings Article
van der Torre, Weydert
[van der Torre]
2001Parameters for Utilitarian Desires in a Qualitative Decision Theory
In: Applied Artificial Intelligence [14], 285-301
Journal Article
Veanes
(Ed: Pratt)
[-]
1998The Relation Between Second-Order Unification and Simultaneous Rigid E-Unification
In: Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science (LICS-98), 264-275
Proceedings Article
Veanes
[-]
2000Farmer's Theorem Revisited
In: Information Processing Letters [74], 47-53
Journal Article
Veit
[-]
1999Formal Fairness Proofs for Optimistic Contract Signing Protocols
Universität des Saarlandes
Thesis - Masters thesis
Viganò
[-]
1997A Framework for Non-Classical Logics
Universität des Saarlandes
Thesis - PhD thesis
Vorobyov
(Ed: Brim, Gruska, Zlatuska)
[-]
1998Attachment Icon$\forall\exists^\ast$-Equational Theory of Context Unification is $\Pi_1^0$-Hard
In: Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science (MFCS-98), 597-606
Proceedings Article
Vorobyov
(Ed: Comon)
[Comon]
1997The first-order theory of one step rewriting in linear noetherian systems is undecidable
In: Proceedings of the 8th International Conference on Rewriting Techniques and Applications (RTA-97), 254-268
Proceedings Article
Vorobyov
(Ed: Gottlob, Grandjean, Seyr)
[Gottlob, Grandjean, Seyr]
1999Attachment IconSubtyping Functional+Nonempty Record Types
In: Proceedings of the 12th International Workshop on Computer Science Logic (CSL-98), Annual Conference on the EACSL, 285-297
Proceedings Article
Vorobyov
(Ed: Jaffar, Yap)
[Jaffar, Yap]
1996On the bounded theories of finite trees
In: Second Asian Computing Science Conference, ASIAN'96, 152-161
Proceedings Article
Vorobyov
(Ed: McRobbie, Slaney)
[McRobbie, Slaney]
1996An improved lower bound for the elementary theories of trees
In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), 275-287
Proceedings Article
Vorobyov
(Ed: Winskel)
[Winskel]
1997The `hardest´ natural decidable theory
In: Proceedings of the Twelfth Annual IEEE Symposium on Logic in Computer Science (LICS-97), 294-305
Proceedings Article
Vorobyov
[-]
2002The undecidability of the first-order theories of one step rewriting in linear canonical systems
In: Information and Computation [175], 182-213
Journal Article
Vorobyov
[-]
2002$\forall\exists^5$-equational theory of context unification is undecidable
In: Theoretical Computer Science [275], 463-479
Journal Article
Vorobyov
[-]
1995Fsub with recursive types: `Types-As-Propositions´ Interpretations in M. Rabin's S2S
In: Proceedings of JFLA'95: Journées Francophones des Langages Applicatifs (JFLA'95), 49-73
Proceedings Article
Vorobyov
[-]
1995Structural decidable extensions of bounded quantification
In: Proceedings of the 22nd ACM Symposium on Principles of Programming Languages (POPL'95), 164-175
Proceedings Article
Vorobyov, Voronkov
[-]
1998Attachment IconComplexity of Nonrecursive Logic Programs with Complex Values
In: Proceedings of the 17th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS-98), 244-253
Proceedings Article
Voronkov
[-]
1999The ground-negative fragment of first-order logics is $\pi^p_2$-complete
In: The Journal of Symbolic Logic [64], 984-990
Journal Article
Wagner, Podelski
(Ed: Raskin, Thiagarajan)
[-]
2007Region Stability Proofs for Hybrid Systems
In: Formal Modelling and Analysis of Timed Systems: 5th International Conference, FORMATS 2007, 16
Proceedings Article
Waldmann
(Ed: Bonacina, Furbach)
[Bonacina, Furbach]
1997A Superposition Calculus for Divisible Torsion-Free Abelian Groups
In: Proceedings of the International Workshop on First-Order Theorem Proving (FTP-97), 130-134
Proceedings Article
Waldmann
(Ed: Ganzinger, McAllester, Voronkov)
[McAllester, Voronkov]
1999Cancellative Superposition Decides the Theory of Divisible Torsion-Free Abelian Groups
In: Proceedings of the 6th International Conference on Logic for Programming and Automated Reasoning (LPAR-99), 131-147
Proceedings Article
Waldmann
(Ed: Goré, Leitsch, Nipkow)
[Goré, Leitsch, Nipkow]
2001Superposition and Chaining for Totally Ordered Divisible Abelian Groups (Extended Abstract)
In: Automated reasoning : First International Joint Conference, IJCAR 2001, 226-241
Proceedings Article
Waldmann
(Ed: Kirchner, Kirchner)
[Kirchner, Kirchner]
1998Superposition for Divisible Torsion-Free Abelian Groups
In: Proceedings of the 15th International Conference on Automated Deduction (CADE-98), 144-159
Proceedings Article
Waldmann
[-]
2002A New Input Technique for Accented Letters in Alphabetical Scripts
In: Proceedings of the 20th International Unicode Conference, C12
Proceedings Article
Waldmann
[-]
2002Cancellative Abelian Monoids and Related Structures in Refutational Theorem Proving (Part II)
In: Journal of Symbolic Computation [33], 831-861
Journal Article
Waldmann
[-]
2002Cancellative Abelian Monoids and Related Structures in Refutational Theorem Proving (Part I)
In: Journal of Symbolic Computation [33], 777-829
Journal Article
Waldmann
[-]
1998Extending reduction orderings to ACU-compatible reduction orderings
In: Information Processing Letters [67], 43-49
Journal Article
Waldmann
[-]
1997Cancellative Abelian Monoids in Refutational Theorem Proving
Universität des Saarlandes
Thesis - PhD thesis
Waldmann
[-]
1992Semantics of Order-Sorted Specifications
In: Theoretical Computer Science [94], 1-35
Journal Article
Wang
(Ed: Rolim)
[-]
1997Randomization and Approximation Techniques in Computer Science
In: Proceedings of the International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM-97), 209-225
Proceedings Article
Wang
[-]
1999Randomness, Stochasticity, and Approximation
In: Theory of Computing Systems [32], 517-529
Journal Article
Wang
[-]
1997NP-hard sets are superterse unless NP is small
In: Information Processing Letters [61], 1-6
Journal Article
Weidenbach
(Ed: Bajcsy)
[-]
1993Extending the Resolution Method with Sorts
In: Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI '93), 60-65
Proceedings Article
Weidenbach
(Ed: Bibel, Schmitt)
[Bibel, Schmitt]
1998Sorted Unification and Tree Automata
In: Automated Deduction - A Basis for Applications, 291-320
Part of a Book
Weidenbach
(Ed: Broda, D'Agostino, )
[-]
1994First-Order Tableaux with Sorts
In: TABLEAUX-'94, 3rd Workshop on Theorem Proving with Analytic Tableaux and Related Methods, 247-261
Proceedings Article
Weidenbach
(Ed: Fiedler, Gorny, Grass, Hölldobler, Hotz, Kerner, Reischuk)
[Fiedler, Gorny, Grass, Hoelldobler, Hotz, Kerner, Reischuk]
1998Rechnen in sortierter Prädikatenlogik
In: Ausgezeichnete Informatikdissertationen 1997, 183-197
Part of a Book
Weidenbach
(Ed: Ganzinger)
[-]
1999Towards an Automatic Analysis of Security Protocols in First-Order Logic
In: Proceedings of the 16th International Conference on Automated Deduction (CADE-16), 378-382
Proceedings Article
Weidenbach
(Ed: Hermann, Salzer)
[Hermann, Salzer]
1996Sorted Unification and Its Application to Automated Theorem Proving
In: Proceedings of the CADE-13 Workshop: Term Schematizations and Their Applications, 67-76
Proceedings Article
Weidenbach
(Ed: Kunze, Stoyan)
[-]
1994Sorts, Resolution, Tableaux and Propositional Logic
In: KI-94 Workshops: Extended Abstracts, 315-316
Proceedings Article
Weidenbach
(Ed: McRobbie, Slaney)
[McRobbie, Slaney]
1996Unification in Pseudo-Linear Sort Theories is Decidable
In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), 343-357
Proceedings Article
Weidenbach
(Ed: Ohlbach)
[-]
1993A New Sorted Logic
In: GWAI-92: Advances in Artificial Inteligence, Proceedings 16th German Workshop on Artificial Intelligence, 43-54
Proceedings Article
Weidenbach
(Ed: Robinson, Voronkov)
[Robinson, Voronkov]
2001Combining Superposition, Sorts and Splitting
In: Handbook of Automated Reasoning, 1965-2013
Part of a Book
Weidenbach
(Ed: Schulz, Kepser)
[Schulz, Kepser]
1996Unification in Sort Theories
In: Proceedings of the 10th International Workshop on Unification, UNIF'96, 16-25
Proceedings Article
Weidenbach
[-]
2000Entscheidbarkeitsprobleme für monadische (Horn)Klauselklassen
Universität des Saarlandes, Naturwissenschaftlich-Technische Fakultät
Thesis - Habilitation thesis
Weidenbach
[-]
1999SPASS V0.95TPTP
In: Journal of Automated Reasoning [23], 21-21
Journal Article
Weidenbach
[-]
1997SPASS Version 0.49
In: Journal of Automated Reasoning [18], 247-252
Journal Article
Weidenbach
[-]
1996Computational Aspects of a First-Order Logic with Sorts
Universität des Saarlandes
Thesis - PhD thesis
Weidenbach
[-]
1996Unification in Sort Theories and its Applications
In: Annals of Mathematics and Artificial Intelligence [18], 261-293
Journal Article
Weidenbach
[-]
1995First-Order Tableaux with Sorts
In: Journal of the Interest Group in Pure and Applied Logics [3], 887-906
Journal Article
Weidenbach, Afshordel, Brahm, Cohrs, Engel, Keen, Theobalt, Topić
(Ed: Ganzinger)
[-]
1999System Description: SPASS Version 1.0.0
In: Proceedings of the 16th International Conference on Automated Deduction (CADE-16), 314-318
Proceedings Article
Weidenbach, Brahm, Hillenbrand, Keen, Theobalt, Topić
(Ed: Voronkov)
[-]
2002Attachment IconSPASS Version 2.0
In: Automated deduction, CADE-18 : 18th International Conference on Automated Deduction, 275-279
Proceedings Article
Weidenbach, Gaede, Rock
(Ed: McRobbie, Slaney)
[Gaede, Rock, McRobbie, Slaney]
1996SPASS & FLOTTER, Version 0.42
In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), 141-145
Proceedings Article
Weidenbach, Meyer, Cohrs, Engel, Keen
[-]
1998SPASS V0.77
In: Journal of Automated Reasoning [21], 113-113
Journal Article
Werner, Bockmayr, Krischer
(Ed: Beierle)
[-]
1993A Concept for the Implementation of LSE Narrowing
In: 9.~Workshop Logische Programmierung, ?
Proceedings Article
Werner, Bockmayr, Krischer
(Ed: Levi, Rodríguez-Artalejo)
[Werner, Krischer]
1994How to realize LSE narrowing
In: Proceedings of the 4th International Conference on Algebraic and Logic Programming (ALP'94), 59-76
Proceedings Article
Werner, Bockmayr, Krischer
(Ed: Mück)
[-]
1993How to Realize LSE Narrowing
In: Proceedings of the 2nd International Workshop on Functional/Logic Programming, ?-?
Proceedings Article
Werner, Bockmayr, Krischer
[-]
1993How to Realize LSE NarrowingReport
Werner, Bockmayr, Krischer
[Werner, Krischer]
1998How to realize LSE narrowing
In: New Generation Computing [16], 397-434
Journal Article
Weydert
(Ed: Benferhat, Besnard)
[-]
2001Rankings we prefer: a minimal construction semantics for default reasoning
In: Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU-01), 616-627
Proceedings Article
Weydert
(Ed: Besnard, Hanks)
[Besnard, Hanks]
1995Defaults and Infinitesimals. Defeasible inference by nonarchimedean entropy maximization
In: Proceedings of the 11th Conference on Uncertainty in Artificial Intelligence (UAI 95), 540-547
Proceedings Article
Weydert
(Ed: Brewka, Witteveen, Schaub)
[Brewka, Witteveen, Schaub]
2001Rankings we prefer: a rational minimal construction semantics for default reasoning
In: Proceedings of the 5th Dutch-German Workshop on Nonmonotonic Reasoning Techniques and their Applications (DGNMR-01), 1-12
Proceedings Article
Weydert
(Ed: Clarke, Kruse, Moral)
[-]
1993Plausible Inference for Default Conditionals
In: Symbolic and Quantitative Approaches to Reasoning and Uncertainty: Proceedings of the European Conference ECSQARU '93, 356-363
Proceedings Article
Weydert
(Ed: Cohn, Schubert, Shapiro)
[Cohn, Schubert, Shapiro]
1998System JZ : How to build a canonical ranking model of a default knowledge base
In: Proceedings of the 6th International Conference on Principles of Knowledge Representation and Reasoning (KR-98), 190-201
Proceedings Article
Weydert
(Ed: Cunningham, Gabbay)
[Cunningham, Gabbay]
2000Rankings in flux
In: Proceedings of the 3rd International Conference on Formal and Applied Practical Reasoning (FAPR-00), 37-48
Proceedings Article
Weydert
(Ed: de Leon, Wallin, Hulth)
[de Leon, Wallin, Hulth]
1999JZBR - Iterated Belief Change for Conditional Ranking Constraints
In: Spinning Ideas - Electronic Essays Dedicated to Peter Gaerdenfors on His Fiftieth Birthday, 1-11
Part of a Book
Weydert
(Ed: Delgrande, Truszczynski)
[Delgrande, Truszczynski]
1998Minimal information entailment : A preliminary account
In: Proceedings of the 7th International Workshop on Nonmonotonic Reasoning (Workshop on Formal Aspects and Applications of Nonmonotonic Reasoning), 64-72
Proceedings Article
Weydert
(Ed: Froideveaux, Kohlas)
[Froideveaux, Kohlas]
1995Numeric Defaults. About an expressive first-order framework for reasoning with infinitesimal probabilities
In: Symbolic and Quantitative Approaches to Reasoning and Uncertainty (ECSQARU 95), 420-427
Proceedings Article
Weydert
(Ed: Fuhrmann, Rott)
[Fuhrmann, Rott]
1996Doxastic Normality Logic: A Qualitative Probabilistic Modal Framework for Defaults and Belief
In: Logic, Action, and Information, 152-171
Part of a Book
Weydert
(Ed: Gabbay, Kruse, Nonnengart)
[Gabbay, Kruse]
1997Rational Default Quantifier Logic
In: Proceedings of the 1st International Joint Conference on Qualitative and Quantitative Practical Reasoning (ESQARU-FAPR-97), 589-600
Proceedings Article
Weydert
(Ed: Gabbay, Ohlbach)
[Gabbay, Ohlbach]
1996System J - Revision Entailment: Default Reasoning through Ranking Measure Updates
In: Practical Reasoning - International Conference on Formal and Applied Practical Reasoning, FAPR'96, 637-649
Proceedings Article
Weydert
(Ed: Horn)
[Horn]
2000How to revise ranked probabilities
In: Proceedings of the 14th European Conference on Artificial Intelligence (ECAI-00), 38-42
Proceedings Article
Weydert
(Ed: Lakemeyer, Nebel)
[-]
1994Hyperrational Conditionals
In: Foundations of Knowledge Representation and Reasoning, 310-332
Proceedings Article
Weydert
(Ed: Nejdl)
[-]
1993Default Quantifiers: About Plausible Reasoning in First-Order Contexts
In: Working Notes of the Dutch/German Workshop on Nonmonotonic Reasoning Techniques and their Applications, ?
Proceedings Article
Weydert
(Ed: Niemelä)
[Niemelä]
1996Default Quantifier Logic
In: Proceedings of the ECAI'96 Workshop on Integrating Nonmonotonicity into Automated Reasoning Systems, -
Proceedings Article
Weydert
(Ed: Rott, Albert, Brewka, Witteveen)
[Rott, Albert, Brewka, Witteveen]
1999JZBR - Iterated Belief Change for Conditional Ranking Constraints
In: Proceedings of the 4th Dutch-German Workshop on Nonmonotonic Reasoning Techniques and their Applications (DGNMR-99), 57-66
Proceedings Article
Weydert
(Ed: Wachsmuth, Rollinger, Brauer)
[Wachsmuth, Rollinger, Brauer]
1995Default Entailment. A preferential construction semantics for defeasible inference
In: Advances in Artificial Intelligence: Proceedings of the 19th German Annual Conference on Artificial Intelligence, 173-184
Proceedings Article
Weydert
(Ed: Weydert, Brewka, Witteveen)
[Brewka, Witteveen]
1997Qualitative Entropy Maximization - A preliminary report
In: Proceedings of the 3rd Dutch/German Workshop on Nonmonotonic Reasoning Techniques and their Applications (DGNMR-97), 63-72
Proceedings Article
Weydert
[-]
2001Defaults, Logic and Probability - A theoretical perspective
In: KI - Künstliche Intelligenz [4/01], 44-49
Journal Article
Weydert
[-]
2000Thoughts on Evolving Science and Belief
In: Proceedings of the Workshop "Scientific Reasoning in AI and Philosophy of Science" at the 14th European Conference on Artificial Intelligence (ECAI-00), 62-69
Proceedings Article
Weydert
[-]
1998Some Notes on Nonmonotonic Probabilistic InferenceMiscellaneous
Weydert
[Lopez de Mantaraz, Poole]
1994General Belief Measures
In: Proceedings of the 10th Conference on Uncertainty in Artificial Intelligence, 575-582
Proceedings Article
Weydert, Brewka, Witteveen (ed.)
(Ed: Weydert, Brewka, Witteveen)
[Brewka, Witteveen]
1997Proceedings of the 3rd Dutch/German Workshop on Nonmonotonic Reasoning Techniques and their Applications (DGNMR-97)Proceedings
Weydert, van der Torre
(Ed: John Bell)
[van der Torre]
1999Risk parameters for utilitarian desires
In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-99), Workshop on Practial Reasoning and Rationality, 48-54
Proceedings Article
Weydert, van der Torre
(Ed: Lang)
[Lang]
1998Goals, desires, utilities and preferences
In: Proceedings of the ECAI-98 Workshop : Decision theory meets artificial intelligence - qualitative and quantitative approaches, 57-64
Proceedings Article
Wies
[-]
2004Attachment IconSymbolic Shape Analysis
Universität des Saarlandes
Thesis - Masters thesis
Wies, Kuncak, Lam, Podelski, Rinard
(Ed: Emerson, Namjoshi)
[-]
2006Attachment IconField Constraint Analysis
In: Verification, Model Checking, and Abstract Interpretation : 7th International Conference, VMCAI 2006, 157-173
Proceedings Article
Wu
(Ed: Gao, Wang)
[Gao, Wang]
2000First-Order Polynomial based Theorem Proving
In: Mathematics Mechanizations and Applications, 273-294
Part of a Book
Wu, Liu
[Liu]
1998Well-Behaved Inference Rules for First-Order Theorem Proving
In: Journal of Automated Reasoning [21], 381-400
Journal Article
Wu, Lu
(Ed: Li)
[Lu]
1998CWA in Multi-Valued Logics
In: Proceedings of the 3rd Asian Symposium on Computer Mathematics (ASCM-98), 259-270
Proceedings Article
Wu, Tan, Li
[Tan, Li]
1998An Algebraic Method to Decide the Deduction Problem in Many-Valued Logics
In: Journal of Applied Non-Classical Logics [8], 353-360
Journal Article
Xia, Yang
[-]
2002An Algorithm for Isolating the Real Solutions of Semi-algebraic Systems
In: Journal of Symbolic Computation [34], 461-477
Journal Article
Yoshida, Bundy, Green, Walsh, Basin
(Ed: Cohn)
[Yoshida, Green, Walsh]
1994Coloured Rippling: An Extension of a Theorem Proving Heuristic
In: Proceedings of the 12th European Conference on Artificial Intelligence (ECAI'94), 85-89
Proceedings Article
Yuan, Billington, Freiheit
[-]
2005Attachment IconAn Abstract Model of Routing in Mobile Ad Hoc Networks
In: Sixth Workshop and Tutorial on Practical Use of Coloured Petri Nets and the CPN Tools, 137-156
Proceedings Article
Zeyer
[-]
1997Eine Beobachtungs-Logik für modulare Sprachen
Universität des Saarlandes
Thesis - PhD thesis

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