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: 1. Author,Editor - 2. by Group - 3. by Names Including [Non Members]

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

#YearTitleType
1
Hide details for Abdelwaheb, Basin, Podelski [Abdelwaheb, Basin]Abdelwaheb, Basin, Podelski [Abdelwaheb, Basin]
1998LISA: A Specification Language Based on WS2S
In: Proceedings of the 11th International Workshop on Computer Science Logic (CSL-97), 18-34
Proceedings Article
1
Hide details for Afshordel, Hillenbrand, Weidenbach [Nieuwenhuis, Voronkov]Afshordel, Hillenbrand, Weidenbach [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
1
Hide details for Ahrendt, Baumgartner, de Nivelle (ed.) [Ahrendt, Baumgartner]Ahrendt, Baumgartner, de Nivelle (ed.) [Ahrendt, Baumgartner]
2006IJCAR'06 Workshop : Disproving'06: Non-Theorems, Non-Validity, Non-ProvabilityElectronic Proceedings
1
Hide details for Althaus [-]Althaus [-]
1998Berechnung optimaler Steinerbäume in der Ebene
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Anderson, Basin [-]Anderson, Basin [-]
1995Deriving and Applying Logic Program Transformers
In: Algorithms, Concurrency and Knowledge (1995 Asian Computing Science Conference), 301-318
Proceedings Article
1
Hide details for Anderson, Basin [Anderson]Anderson, Basin [Anderson]
2000Program Development Schemata as Derived Rules
In: Journal of Symbolic Computation [30], 5-36
Journal Article
1
Hide details for Antoy, Echahed, Hanus [Antoy, Echahed]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
1
Hide details for Areces, de Rijke, de Nivelle [Areces, de Rijke]Areces, de Rijke, de Nivelle [Areces, de Rijke]
2001Resolution in modal, description and hybrid logic
In: Journal of Logic and Computation [11], 717-736
Journal Article
1
Hide details for Argon, Delzanno, Mukhopadhyay, Podelski [Argon, Delzanno]Argon, Delzanno, Mukhopadhyay, Podelski [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
1
Hide details for Autexier [-]Autexier [-]
1996Heuristiken zum Beweisen von Gleichungen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Avenhaus, Hillenbrand, Löchner [Avenhaus, Löchner, Avenhaus, Löchner]Avenhaus, Hillenbrand, Löchner [Avenhaus, 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
1
Hide details for Ayari [-]Ayari [-]
1995Attachment IconA Reinterpretation of the Deductive Tableaux System in Higher-Order Logic
Universität des Saarlandes
Thesis - Masters thesis
2
Hide details for Ayari, Basin [-]Ayari, Basin [-]
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
1995Interpretation of the Deductive Tableau in HOL
In: Proceedings of the First Isabelle Users Workshop, 91-100
Proceedings Article
1
Hide details for Ayari, Basin [Ayari]Ayari, Basin [Ayari]
2001A Higher-order Interpretation of Deductive Tableau
In: Journal of Symbolic Computation [31], 487-520
Journal Article
1
Hide details for Baader, Ohlbach [-]Baader, Ohlbach [-]
1995A Multi-Dimensional Terminological Knowledge Representation Language
In: Journal of Applied Non-Classical Logics [5], 153-198
Journal Article
1
Hide details for Bach [-]Bach [-]
1996Attachment IconStatic analysis of functional programs via Linear Logic
Universität des Saarlandes
Thesis - Masters thesis
10
Hide details for Bachmair, Ganzinger [-]Bachmair, Ganzinger [-]
1998Equational Reasoning in Saturation-Based Theorem Proving
In: Automated Deduction: A Basis for Applications, 353-397
Part of a Book
1998Strict Basic Superposition
In: Proceedings of the 15th International Conference on Automated Deduction (CADE-98), 160-174
Proceedings Article
1995Associative-Commutative Superposition
In: Proceedings of the 4th International Workshop on Conditional and Typed Rewrite Systems (CTRS-94), 1-14
Proceedings Article
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
1994Ordered Chaining for Total Orderings
In: Proceedings of the 12th International Conference on Automated Deduction (CADE-12), 435-450
Proceedings Article
1994Rewrite-based equational theorem proving with selection and simplification
In: Journal of Logic and Computation [4], 217-247
Journal Article
1994Rewrite Techniques for Transitive Relations
In: Proceedings of the 9th IEEE Symposium on Logic in Computer Science, 384-393
Proceedings Article
1992Non-Clausal Resolution and Superposition with Selection and Redundancy Criteria
In: Logic Programming and Automated Reasoning, 273-284
Proceedings Article
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
1991Perfect model semantics for logic programs with equality
In: Proceedings International Conference on Logic Programming '91, 645-659
Proceedings Article
1
Hide details for Bachmair, Ganzinger [Bachmair]Bachmair, Ganzinger [Bachmair]
1998Ordered Chaining Calculi for First-Order Theories of Transitive Relations
In: Journal of the ACM [45], 1007-1049
Journal Article
1
Hide details for Bachmair, Ganzinger [Robinson, Voronkov]Bachmair, Ganzinger [Robinson, Voronkov]
2001Attachment IconResolution Theorem Proving
In: Handbook of Automated Reasoning, 19-99
Part of a Book
1
Hide details for Bachmair, Ganzinger, Lynch, Snyder [-]Bachmair, Ganzinger, Lynch, Snyder [-]
1992Basic Paramodulation and Superposition
In: Proceedings of the 11th International Conference on Automated Deduction (CADE-11), 462-476
Proceedings Article
1
Hide details for Bachmair, Ganzinger, Lynch, Snyder [Lynch, Snyder]Bachmair, Ganzinger, Lynch, Snyder [Lynch, Snyder]
1995Basic Paramodulation
In: Information and Computation [121], 172-192
Journal Article
1
Hide details for Bachmair, Ganzinger, Stuber [-]Bachmair, Ganzinger, Stuber [-]
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
1
Hide details for Bachmair, Ganzinger, Voronkov [-]Bachmair, Ganzinger, Voronkov [-]
1998Elimination of Equality via Transformation with Ordering Constraints
In: Proceedings of the 15th International Conference on Automated Deduction (CADE-98), 175-190
Proceedings Article
2
Hide details for Bachmair, Ganzinger, Waldmann [-]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
1992Theorem proving for hierarchic first-order theories
In: Algebraic and Logic Programming, 420-434
Proceedings Article
1
Hide details for Bachmair, Ganzinger, Waldmann [Bachmair, Gottlob, Leitsch, Mundici]Bachmair, Ganzinger, Waldmann [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
1
Hide details for Bachmair, Ganzinger, Waldmann [Bachmair]Bachmair, Ganzinger, Waldmann [Bachmair]
1993Set Constraints are the Monadic Class
In: Eighth Annual IEEE Symposium on Logic in Computer Science, 75-83
Proceedings Article
1
Hide details for Backes [-]Backes [-]
2005Programmanalyse des XRTL Zwischencodes
Universität des Saarlandes
Thesis - PhD thesis
2
Hide details for Backes, Wetzel [Wetzel]Backes, Wetzel [Wetzel]
2001Lattice Basis Reduction with Dynamic Approximation
In: Proceedings of the 4th Workshop On Algorithm Engineering (WAE-2000), 63-73
Proceedings Article
2000New Results on Lattice Basis Reduction in Practice
In: Proceedings of the 4th International Algorithmic Number Theory Symposium (ANTS-IV), 135-152
Proceedings Article
1
Hide details for Ball, Podelski, Rajamani [Ball, Rajamani]Ball, Podelski, Rajamani [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
1
Hide details for Barnett, Basin, Hesketh [-]Barnett, Basin, Hesketh [-]
1993A Recursion Planning Analysis of Inductive Completion
In: Annals of Mathematics and Artificial Intelligence [8], 363-381
Journal Article
5
Hide details for Barth [-]Barth [-]
1995Logic-based 0-1 constraint programmingBook
1995Logic-based 0-1 Constraint Solving in Constraint Logic Programming
Fachbereich Informatik, Universität des Saarlandes, Germany
Thesis - PhD thesis
1994Simplifying Clausal Satisfiability Problems
In: Proceedings of the 1st International Conference on Constraints in Computational Logics (CCL'94), 19-33
Proceedings Article
1993A Complete Symbolic 0-1 Constraint Solver
In: 3rd Workshop on Constraint Logic Programming (WCLP '93), ?
Proceedings Article
1993Linear 0-1 Inequalities and Extended Clauses
In: Proceedings~4th International~Conference on Logic Programming and Automated Reasoning LPAR '93, 40-51
Proceedings Article
6
Hide details for Barth, Bockmayr [-]Barth, Bockmayr [-]
1997PLAM: ProLog and Algebraic Modelling
In: Proceedings of the 5th International Conference on the Practical Application of Prolog, 73-82
Proceedings Article
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
1995Finite domain and cutting plane techniques in CLP($\cal PB$)
In: Proceedings of the Twelfth International Conference on Logic Programming, 133-147
Proceedings Article
1995Pseudo-Boolean Constraint Logic Programming
In: Computational Logic. The Newsletter of the European Network in Computational Logic [2], 52-53
Journal Article
1994Global Consistency in CLP($\cal PB$)
In: Proceedings of the 10th Workshop Logic Programming WLP'94, 4
Proceedings Article
1993Solving 0-1 Problems in CLP($\cal PB$)
In: Proceedings 9th Conference on Artificial Intelligence for Applications (CAIA), 263-269
Proceedings Article
1
Hide details for Barth, Bockmayr [Barth]Barth, Bockmayr [Barth]
1998Modelling Discrete Optimisation Problems in Constraint Logic Programming
In: Annals of Operations Research [81], 467-496
Journal Article
1
Hide details for Barth, Kleine Büning, Weidenbach [Kleine Büning]Barth, Kleine Büning, Weidenbach [Kleine Büning]
1995Workshop CPL Computational Propositional Logic
In: KI-95 Activities: Workshops, Posters, Demos, 71-72
Proceedings Article
5
Hide details for Basin [-]Basin [-]
1995Thema der Antrittsvorlesung: MONA - Ein Werkzeug zur Systemverifikation und -entwicklung
Universität des Saarlandes
Thesis - Habilitation thesis
1994A Term Equality Problem Equivalent to Graph Isomorphism
In: Information Processing Letters [51], 61-66
Journal Article
1994Generalized Rewriting in Type Theory
In: Journal of Information Processing and Cybernetics [30], 249-259
Journal Article
1994IsaWhelk: Whelk Interpreted in Isabelle
In: Proceedings of the 11th International Conference on Logic Programming (ICLP'94), 741-741
Proceedings Article
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
1
Hide details for Basin, Brown, Leeser [-]Basin, Brown, Leeser [-]
1991Formally Verified Synthesis of Combinational CMOS Circuits
In: Integration: The Intern. Journal of VLSI Design [11], 235-250
Journal Article
1
Hide details for Basin, Bundy, Kraan, Matthews [-]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
1
Hide details for Basin, Constable [-]Basin, Constable [-]
1993Metalogical Frameworks
In: Logical Environments, 1-29
Part of a Book
1
Hide details for Basin, Friedrich [-]Basin, Friedrich [-]
1999Modeling a Hardware Synthesis Methodology in Isabelle
In: Formal Methods in Systems Design [15], 99-122
Journal Article
1
Hide details for Basin, Friedrich [von Wright, Grundy, Harrison]Basin, Friedrich [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
1
Hide details for Basin, Ganzinger [-]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
1
Hide details for Basin, Ganzinger [Basin]Basin, Ganzinger [Basin]
2001Attachment IconAutomated Complexity Analysis Based on Ordered Resolution
In: Journal of the ACM [48], 70-109
Journal Article
1
Hide details for Basin, Giunchiglia, Kaufmann (ed.) [Giunchiglia, Kaufmann]Basin, Giunchiglia, Kaufmann (ed.) [Giunchiglia, Kaufmann]
1994Proceedings of the Workshop on Correctness and Metatheoretic Extensibility of Automated Reasoning SystemsReport
1
Hide details for Basin, Giunchiglia, Traverso [-]Basin, Giunchiglia, Traverso [-]
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
1
Hide details for Basin, Howe [-]Basin, Howe [-]
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
1
Hide details for Basin, Kaufmann [-]Basin, Kaufmann [-]
1991The Boyer-Moore Prover and Nuprl: An Experimental Comparison
In: Logical Frameworks, 90-119
Proceedings Article
2
Hide details for Basin, Klarlund [Klarlund]Basin, Klarlund [Klarlund]
1998Automata Based Symbolic Reasoning in Hardware Verification
In: Formal Methods in Systems Design [13], 255-288
Journal Article
1995Hardware Verification using Monadic Second-Order Logic
In: Proceedings of the 7th International Conference on Computer-Aided Verification (CAV '95), 31-41
Proceedings Article
1
Hide details for Basin, Krieg-Brückner [Astesiano, Kreowski, Krieg-Brückner]Basin, 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
2
Hide details for Basin, Matthews [-]Basin, Matthews [-]
1996Adding Metatheoretic facilities to First-order Theories
In: Journal of Logic and Computation [6], 835-849
Journal Article
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
1
Hide details for Basin, Matthews [Gabbay, Guenthner]Basin, Matthews [Gabbay, Guenthner]
2002Logical Frameworks
In: Handbook of Philosophical Logic, 89-164
Part of a Book
1
Hide details for Basin, Matthews [McRobbie, Slaney]Basin, Matthews [McRobbie, Slaney]
1996Structuring metatheory on inductive definitions
In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), 171-185
Proceedings Article
6
Hide details for Basin, Matthews, Viganò [-]Basin, Matthews, Viganò [-]
1998Natural Deduction for Non-Classical Logics
In: Studia Logica [60], 119-160
Journal Article
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
1997Labelled Propositional Modal Logics: Theory and Practice
In: Journal of Logic and Computation [7], 685-717
Journal Article
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
1996A Topography of Labelled Modal Logics
In: Frontiers of Combining Systems (First International Workshop, Munich, March 1996), 75-92
Part of a Book
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
2
Hide details for Basin, Matthews, Viganò [Basin, Viganò]Basin, Matthews, Viganò [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
1998Labelled Modal Logics: quantifiers
In: Journal of Logic, Language and Information [7], 237-263
Journal Article
2
Hide details for Basin, Walsh [-]Basin, Walsh [-]
1993Difference Unification
In: Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI-93), 116-122
Proceedings Article
1992Difference Matching
In: Proceedings of the11th International Conference on Automated Deduction (CADE-11), 295-309
Proceedings Article
3
Hide details for Basin, Walsh [Walsh]Basin, Walsh [Walsh]
1996A Calculus for and Termination of Rippling
In: Automated mathematical induction, 147-180
Part of a Book
1996A Calculus for and Termination of Rippling
In: Journal of Automated Reasoning [16], 147-180
Journal Article
1994Termination Orderings for Rippling
In: Proceedings of the 12th International Conference On Automated Deduction (CADE-12), 466-483
Proceedings Article
4
Hide details for Baumeister [-]Baumeister [-]
1999Attachment IconRelations between Abstract Datatypes modeled as Abstract Datatypes
Universität des Saarlandes
Thesis - PhD thesis
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
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
1990Attachment IconÜber die Stabilität parameterisierter algebraischer Spezifikationen
Universität Dortmund
Thesis - Masters thesis
1
Hide details for Baumgartner, Burchardt [Burchardt, Alferes, Leite]Baumgartner, Burchardt [Burchardt, Alferes, Leite]
2004Logic Programming Infrastructure for Inferences on FrameNet
In: Logics in artificial intelligence : 9th European Conference, JELIA 2004, 591-603
Proceedings Article
1
Hide details for Baumgartner, Fuchs, Tinelli [Tinelli, Schulz, Tammet, Sutcliffe]Baumgartner, Fuchs, Tinelli [Tinelli, 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
1
Hide details for Baumgartner, Fuchs, Tinelli [Tinelli]Baumgartner, Fuchs, Tinelli [Tinelli]
2006Implementing the Model Evolution Calculus
In: International Journal on Artificial Intelligence Tools [15], 21-52
Journal Article
1
Hide details for Baumgartner, Furbach [Furbach, Hutter, Stephan]Baumgartner, Furbach [Furbach, 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
1
Hide details for Baumgartner, Furbach, Gross-Hardt, Kleemann [Furbach, Gross-Hardt, Kleemann, Biundo, Frühwirth, Palm]Baumgartner, Furbach, Gross-Hardt, Kleemann [Furbach, Gross-Hardt, Kleemann, 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
1
Hide details for Baumgartner, Furbach, Gross-Hardt, Kleemann [Furbach, Gross-Hardt, Kleemann, Seipel, Hanus, Geske, BartensteinBaumgartner, Furbach, Gross-Hardt, Kleemann [Furbach, Gross-Hardt, Kleemann, 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
1
Hide details for Baumgartner, Furbach, Gross-Hardt, Sinner [Furbach, Gross-Hardt, Sinner]Baumgartner, Furbach, Gross-Hardt, Sinner [Furbach, Gross-Hardt, Sinner]
2004Living Book -- Deduction, Slicing, and Interaction
In: Journal of Automated Reasoning [32], 259-286
Journal Article
1
Hide details for Baumgartner, Furbach, Yahya [Furbach, Yahya]Baumgartner, Furbach, Yahya [Furbach, Yahya]
2005Automated Reasoning, Knowledge Representation and Management
In: KI - Künstliche Intelligenz [1], 5-11
Journal Article
1
Hide details for Baumgartner, Grabowski, Oevel, Melis [Grabowski, Oevel, Melis]Baumgartner, Grabowski, Oevel, Melis [Grabowski, Oevel, Melis]
2004In2Math - Interaktive Mathematik- und Informatikgrundausbildung
In: Softwaretechnik-Trends [24], 36-45
Journal Article
1
Hide details for Baumgartner, Mediratta [Mediratta, Sasikumar, Vakil, Kavitha]Baumgartner, Mediratta [Mediratta, 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
1
Hide details for Baumgartner, Suchanek [-]Baumgartner, Suchanek [-]
2005Attachment IconModel-Generation Theorem Proving for First-Order Logic OntologiesUnpublished/Draft
1
Hide details for Baumgartner, Tinelli [Tinelli, Nieuwenhuis]Baumgartner, Tinelli [Tinelli, Nieuwenhuis]
2005The Model Evolution Calculus with Equality
In: Automated deduction - CADE-20 : 20th International Conference on Automated Deduction, 392-408
Proceedings Article
1
Hide details for Becker [-]Becker [-]
1994Attachment IconEffiziente Subsumption in Deduktionssystemen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Ben-Amram, Lee [Ben-Amram]Ben-Amram, Lee [Ben-Amram]
2007Program termination analysis in polynomial time
In: ACM Transactions on Programming Languages and Systems [29], 5:1-37
Journal Article
1
Hide details for Bertling, Ganzinger, Schäfers, Nieuwenhuis, Orejas [-]Bertling, Ganzinger, Schäfers, Nieuwenhuis, Orejas [-]
1993Completion Subsystem
In: Program Development by Specification and Transformation, The PROSPECTRA Methodology, Language Family, and System, 460-494
Part of a Book
1
Hide details for Beyer, Henzinger, Majumdar, Rybalchenko [Beyer, Henzinger, Majumdar, Cook, Podelski]Beyer, Henzinger, Majumdar, Rybalchenko [Beyer, Henzinger, Majumdar, Cook, Podelski]
2007Invariant Synthesis for Combined Theories
In: Verification, Model Checking, and Abstract Interpretation : 8th International Conference, VMCAI 2007, 378-394
Proceedings Article
1
Hide details for Beyer, Henzinger, Majumdar, Rybalchenko [Beyer, Henzinger, Majumdar, Ferrante, McKinley]Beyer, Henzinger, Majumdar, Rybalchenko [Beyer, Henzinger, Majumdar, 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
1
Hide details for Bezem, Hendriks, de Nivelle [Bezem, Hendriks]Bezem, Hendriks, de Nivelle [Bezem, Hendriks]
2002Automated Proof Construction in Type Theory using Resolution
In: Journal of Automated Reasoning [29], 253-275
Journal Article
1
Hide details for Blackburn, Tzakova [Blackburn, Boros, Greiner]Blackburn, Tzakova [Blackburn, Boros, Greiner]
1998A Hybrid Concept Language
In: Proceedings of the 5th International Symposium on Artificial Intelligence and Mathematics, ?
Proceedings Article
4
Hide details for Blackburn, Tzakova [Blackburn]Blackburn, Tzakova [Blackburn]
1999Hybrid Languages and Temporal Logic
In: Logic Journal of the IGPL [7], 27-54
Journal Article
1998Hybrid Completeness
In: Logic Journal of the IGPL [6], 625-650
Journal Article
1998Hybrid Languages and Temporal Logic (Full Version)Report
1998Hybridizing Concept Languages
In: Annals of Mathematics and Artificial Intelligence [24], 23-49
Journal Article
1
Hide details for Blanchet, Podelski [-]Blanchet, Podelski [-]
2005Verification of Cryptographic Protocols: Tagging Enforces Termination
In: Theoretical Computer Science [333], 67-90
Journal Article
1
Hide details for Blanchet, Podelski [Gordon]Blanchet, Podelski [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
11
Hide details for Bockmayr [-]Bockmayr [-]
1996Gleichheit und Constraints in der Logikprogrammierung
Universität des Saarlandes
Thesis - Habilitation thesis
1995Solving pseudo-Boolean constraints
In: Constraint Programming: Basics and Trends, 22-38
Proceedings Article
1994Cutting planes in constraint logic programming (Abstract)
In: Proceedings of the 3rd International Symposium Artificial Intelligence and Mathematics,
Proceedings Article
1994Using Strong Cutting Planes in Constraint Logic Programming (Extended Abstract)
In: Operations Research '93, 18th Symposium on Operations Research, 47-49
Proceedings Article
19930-1 Constraints and 0-1 Optimization
In: 3rd Workshop on Constraint Logic Programming (WCLP '93), ?
Proceedings Article
1993Conditional Narrowing Modulo a Set of Equations
In: Applicable Algebra in Engineering, Communication and Computing [4], 147-168
Journal Article
1993Embedding OR Techniques in Constraint Logic Programming
In: Operations Research '92. 17th Symposium on Operations Research, 252-254
Proceedings Article
1993Logic Programming with Pseudo-Boolean Constraints
In: Constraint Logic Programming---Selected Research, 327-350
Proceedings Article
1992A Theoretical Basis for Constraint Logic and Functional Programming
In: Proc.~1st African Conference on Research in Computer Science, 793-804
Proceedings Article
1992Algebraic and Logical Aspects of Unification
In: Proc.~1st Workshop on Word Equations and Related Topics, 171-180
Proceedings Article
1992Model-Theoretic Aspects of Unification
In: Proceedings of the 1st Workshop on Word Equations and Related Topics, 181-196
Proceedings Article
1
Hide details for Bockmayr [Hanus, Lloyd, Moreno Navarro]Bockmayr [Hanus, Lloyd, Moreno Navarro]
1996Constraints in functional logic programming (Abstract)
In: Integration of functional and logic languages, 4
Proceedings Article
1
Hide details for Bockmayr, Barth, Kasper [Steinbach]Bockmayr, Barth, Kasper [Steinbach]
1996Methods and Tools for Pseudo-Boolean Problems
In: 2. Workshop Boolesche Probleme, 105-109
Proceedings Article
1
Hide details for Bockmayr, Brzoska, Deussen, Varsek [-]Bockmayr, Brzoska, Deussen, Varsek [-]
1991KA-Prolog: Erweiterungen einer logischen Programmiersprache und ihre effiziente Implementierung
In: Informatik--Forschung und Entwicklung [6], 128-140
Journal Article
1
Hide details for Bockmayr, Dimopoulos [Frank, Sabin, Frank, Sabin]Bockmayr, Dimopoulos [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
1
Hide details for Bockmayr, Eisenbrand [Bockmayr]Bockmayr, Eisenbrand [Bockmayr]
2001Cutting planes and the elementary closure in fixed dimension
In: Mathematics of Operations Research [26], 304-312
Journal Article
1
Hide details for Bockmayr, Eisenbrand, Hartmann, Schulz [Hartmann, Schulz]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
1
Hide details for Bockmayr, Kasper [-]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
1
Hide details for Bockmayr, Kasper [Geske, Simonis]Bockmayr, Kasper [Geske, Simonis]
1996Pseudo-Boolean and Finite Domain Constraint Programming: A Case Study
In: Deklarative Constraint Programmierung, 29-41
Proceedings Article
1
Hide details for Bockmayr, Krischer, Werner [Krischer, Werner]Bockmayr, Krischer, Werner [Krischer, Werner]
1995Narrowing strategies for arbitrary canonical systems
In: Fundamenta Informaticae [24], 125-155
Journal Article
1
Hide details for Bockmayr, Radermacher [-]Bockmayr, Radermacher [-]
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
1
Hide details for Bockmayr, Weispfenning [Robinson, Voronkov, Weispfenning]Bockmayr, Weispfenning [Robinson, Voronkov, Weispfenning]
2001Solving numerical constraints
In: Handbook of Automated Reasoning, 751-842
Part of a Book
1
Hide details for Bockmayr, Werner [Werner]Bockmayr, Werner [Werner]
1995LSE narrowing for decreasing conditional term rewrite systems
In: Conditional Term Rewriting Systems CTRS'94, 51-70
Proceedings Article
1
Hide details for Booth [-]Booth [-]
2001The lexicographic closure as a revision process
In: Journal of Applied Non-Classical Logics [11], 35-58
Journal Article
1
Hide details for Booth [Baral, Truszczynski]Booth [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
1
Hide details for Bozkurt [-]Bozkurt [-]
1995Strategien für Resolutionsbeweiser in Logik höherer Stufe
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Bozzano, Delzanno, Martelli, Mascardi, Zini [Apt, Marek, Truszczynski, Warren, Bozzano, Martelli, Mascardi, ZiBozzano, Delzanno, Martelli, Mascardi, Zini [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
1
Hide details for Bozzano, Delzanno, Martelli, Mascardi, Zini [Bozzano, Martelli, Mascardi, Zini]Bozzano, Delzanno, Martelli, Mascardi, Zini [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
1
Hide details for Brafman, Hoffmann [Brafman, Zilberstein, Koehler, Koenig]Brafman, Hoffmann [Brafman, 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
2
Hide details for Brahm [-]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
2006Attachment IconEine integrierte Publikationsverwaltung am Beispiel des Max-Planck-Instituts für InformatikMiscellaneous
1
Hide details for Brahm, Pitz [Pitz]Brahm, Pitz [Pitz]
1990Parkwächter
In: c't Magazin für computer technik [-], 252-253
Journal Article
1
Hide details for Brinker [-]Brinker [-]
2000Geometrisches Schließen mit SPASS
Universität des Saarlandes
Thesis - Masters thesis
2
Hide details for Brink, Britz, Schmidt [Brink, Britz]Brink, Britz, Schmidt [Brink, Britz]
1994Peirce Algebras
In: Formal Aspects of Computing [6], 339-358
Journal Article
1994Peirce Algebras: Extended Abstract
In: Proceedings of the 3rd International Conference on Algebraic Methodology and Software Technology (AMAST '93), 163-166
Proceedings Article
1
Hide details for Brink, Gabbay, Ohlbach [Brink]Brink, Gabbay, Ohlbach [Brink]
1994Towards Automating Duality
In: Journal of Computers and Mathematics with Applications [29], 73-90
Journal Article
1
Hide details for Brink, Rewitzky, Schmidt [Brink, Rewitzky]Brink, Rewitzky, Schmidt [Brink, Rewitzky]
1991Autodescriptivity: Beware!
In: The Computer Journal [34], 380-381
Journal Article
1
Hide details for Buchmann, Eisenbrand [Buchmann]Buchmann, Eisenbrand [Buchmann]
1999On Factor Refinement in Number Fields
In: Mathematics of Computation [68], 345-350
Journal Article
1
Hide details for Bugliesi, Delzanno, Liquori, Martelli [Bugliesi, Liquori, Martelli]Bugliesi, Delzanno, Liquori, Martelli [Bugliesi, Liquori, Martelli]
2000Object Calculi in Linear Logic
In: Journal of Logic and Computation [10], 75-104
Journal Article
1
Hide details for Bundy, Lombart [Lombart]Bundy, Lombart [Lombart]
1995Relational Rippling: a General Approach
In: Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95), 175-181
Proceedings Article
1
Hide details for Cantu, Bundy, Smaill, Basin [Cantu, Bundy, Smaill, Srivas, Camilleri]Cantu, Bundy, Smaill, Basin [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
1
Hide details for Chadha, Plaisted [-]Chadha, Plaisted [-]
1993On the mechanical derivation of loop invariants
In: Journal of Symbolic Computation [15], 705-744
Journal Article
1
Hide details for Chadha, Plaisted [Chadha]Chadha, Plaisted [Chadha]
1994Correctness of unification without occur check in Prolog
In: Journal of Logic Programming [18], 99-122
Journal Article
3
Hide details for Charatonik [-]Charatonik [-]
2002Direktionale Typen in der Logischen Programmierung
Universität des Saarlandes
Thesis - Habilitation thesis
1998An Undecidable Fragment of the Theory of Set Constraints
In: Information Processing Letters [68], 147-151
Journal Article
1998Set Constraints in Some Equational Theories
In: Information and Computation [142], 40-75
Journal Article
1
Hide details for Charatonik [Smolka]Charatonik [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
1
Hide details for Charatonik, Amadio [Amadio, Brim, Jancar, Kretinsky, Kucera]Charatonik, Amadio [Amadio, 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
1
Hide details for Charatonik, Dal Zilio, Gordon, Mukhopadhyay, Talbot [Dal Zilio, Gordon, Honsell, Miculan]Charatonik, Dal Zilio, Gordon, Mukhopadhyay, Talbot [Dal Zilio, Gordon, 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
1
Hide details for Charatonik, Dal Zilio, Gordon, Mukhopadhyay, Talbot [Dal Zilio, Gordon, Mukhopadhyay, Talbot]Charatonik, Dal Zilio, Gordon, Mukhopadhyay, Talbot [Dal Zilio, Gordon, Mukhopadhyay, Talbot]
2003Model checking mobile ambients
In: Theoretical Computer Science [308], 277-331
Journal Article
1
Hide details for Charatonik, Dal Zilio, Gordon, Mukhopadhyay, Talbot [Dal Zilio, Gordon, Talbot]Charatonik, Dal Zilio, Gordon, Mukhopadhyay, Talbot [Dal Zilio, Gordon, Talbot]
2001The Complexity of Model Checking Mobile AmbientsReport
1
Hide details for Charatonik, Georgieva, Maier [Charatonik, Georgieva, Ong]Charatonik, Georgieva, Maier [Charatonik, Georgieva, 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
1
Hide details for Charatonik, Gordon, Talbot [Gordon, Talbot, Le Métayer]Charatonik, Gordon, Talbot [Gordon, Talbot, 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
1
Hide details for Charatonik, McAllester, Niwinski, Podelski, Walukiewicz [McAllester, Niwinski, Walukiewicz, Pratt]Charatonik, McAllester, Niwinski, Podelski, Walukiewicz [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
1
Hide details for Charatonik, Mukhopadhyay, Podelski [Cortesi]Charatonik, Mukhopadhyay, Podelski [Cortesi]
2002Compositional Termination Analysis of Symbolic Forward Analysis
In: Verification, Model Checking, and Abstract Interpretation. Third International Workshop, VMCAI 2002, 109-125
Proceedings Article
1
Hide details for Charatonik, Mukhopadhyay, Podelski [Stuckey]Charatonik, Mukhopadhyay, Podelski [Stuckey]
2002Constraint-Based Infinite Model Checking and Tabulation for Stratified CLP
In: Logic Programming. 18th International Conference, ICLP 2002, 115-129
Proceedings Article
1
Hide details for Charatonik, Podelski [-]Charatonik, Podelski [-]
2002Set Constraints with Intersection
In: Information and Computation [179], 213-229
Journal Article
1
Hide details for Charatonik, Podelski [Freuder]Charatonik, Podelski [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
1
Hide details for Charatonik, Podelski [Levi]Charatonik, Podelski [Levi]
1998Directional Type Inference for Logic Programs
In: Proceedings of the 5th International Symposium in Static Analysis (SAS-98), 278-294
Proceedings Article
1
Hide details for Charatonik, Podelski [Nipkow]Charatonik, Podelski [Nipkow]
1998Co-definite Set Constraints
In: Proceedings of the 9th International Conference on Rewriting Techniques and Applications (RTA-98), 211-225
Proceedings Article
1
Hide details for Charatonik, Podelski [Steffen]Charatonik, Podelski [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
1
Hide details for Charatonik, Podelski [Winskel]Charatonik, Podelski [Winskel]
1997Set Constraints with Intersection
In: Proceedings of the Twelfth Annual IEEE Symposium on Logic in Computer Science (LICS-97), 362-372
Proceedings Article
1
Hide details for Charatonik, Podelski, Talbot [-]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
1
Hide details for Charatonik, Talbot [Talbot, Tison]Charatonik, Talbot [Talbot, Tison]
2002Atomic Set Constraints with Projection
In: Rewriting Techniques and Applications. 13th International Conference, RTA 2002, 311-325
Proceedings Article
1
Hide details for Charatonik, Talbot [Talbot]Charatonik, Talbot [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
1
Hide details for Chaudhuri, Dimopoulos, Zaroliagis [-]Chaudhuri, Dimopoulos, Zaroliagis [-]
1996On the Parallel Complexity of Acyclic Logic Programs
In: Parallel Processing Letters [6], 223-230
Journal Article
1
Hide details for Christen [-]Christen [-]
1997Attachment IconA Calculus of Simplification for Superposition
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Chu, Plaisted [Chu]Chu, Plaisted [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
1
Hide details for Claus, Hopf, Schwefel (ed.) [Claus, Schwefel]Claus, Hopf, Schwefel (ed.) [Claus, Schwefel]
1996Evolutionary Algorithms and their ApplicationReport
1
Hide details for Cook, Gotsman, Podelski, Rybalchenko, Vardi [Cook, Gotsman, Podelski, Vardi, Hofmann, Felleisen]Cook, Gotsman, Podelski, Rybalchenko, Vardi [Cook, Gotsman, Podelski, Vardi, 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
1
Hide details for Cook, Podelski, Rybalchenko [Coo , Ball, Jones]Cook, Podelski, Rybalchenko [Coo , Ball, Jones]
2006Terminator: Beyond Safety
In: Computer aided verification : 18th International Conference, CAV 2006, 415-418
Proceedings Article
1
Hide details for Cook, Podelski, Rybalchenko [Cook, Hankin, Siveroni]Cook, Podelski, Rybalchenko [Cook, Hankin, Siveroni]
2005Abstraction-refinement for Termination
In: Static analysis : 12th International Symposium, SAS 2005, 87-101
Proceedings Article
1
Hide details for Cook, Podelski, Rybalchenko [Cook, Podelski, Ferrante, McKinley]Cook, Podelski, Rybalchenko [Cook, Podelski, 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
1
Hide details for Cook, Podelski, Rybalchenko [Cook]Cook, Podelski, Rybalchenko [Cook]
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
1
Hide details for Cortier, Ganzinger, Jacquemard, Veanes [Cortier, Wiedermann, van Emde Boas, Nielsen]Cortier, Ganzinger, Jacquemard, Veanes [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
1
Hide details for Cunningham, Gabbay, Ohlbach [-]Cunningham, Gabbay, Ohlbach [-]
1991Towards the MEDLAR Framework
In: ESPRIT '91 Conference Proceedings, 822-841
Proceedings Article
1
Hide details for Cuntz, Freiheit, Kindler [Cuntz, Kindler, Nuettgens, Rump]Cuntz, Freiheit, Kindler [Cuntz, Kindler, 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
1
Hide details for Damm, Disch, Hungar, Pang, Pigorsch, Scholl, Waldmann, Wirtz [Damm, Disch, Hungar, Pang, Pigorsch, Scholl, WirDamm, Disch, Hungar, Pang, Pigorsch, Scholl, Waldmann, Wirtz [Damm, Disch, Hungar, Pang, Pigorsch, Scholl, Wirtz, 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
1
Hide details for Damm, Pinto, Ratschan [Damm, , Peled, Tsay]Damm, Pinto, Ratschan [Damm, , 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
1
Hide details for Daum, Maus, Schirmer, Seghir [Daum, Schirmer, Sutcliffe, Voronkov]Daum, Maus, Schirmer, Seghir [Daum, Schirmer, 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
2
Hide details for de Nivelle [-]de Nivelle [-]
2005Translation of Resolution Proofs into Short First-Order Proofs without Choice Axioms
In: Information and Computation [199], 24-54
Journal Article
2000Deciding the E-plus class by an a posteriori, liftable order
In: Annals of Pure and Applied Logic [88], 219-232
Journal Article
1
Hide details for de Nivelle [Baader]de Nivelle [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
1
Hide details for de Nivelle [Bradfield]de Nivelle [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
1
Hide details for de Nivelle [Faller, Kaufmann, Pauly]de Nivelle [Faller, Kaufmann, Pauly]
2000An Overview of Resolution Decision Procedures
In: Formalizing the Dynamics of Information, 115-130
Proceedings Article
1
Hide details for de Nivelle [Konev, Schmidt]de Nivelle [Konev, Schmidt]
2003Implementing the clausal normal form transformation with proof generation
In: Fourth Workshop on the Implementation of Logics, 69-83
Proceedings Article
1
Hide details for de Nivelle [Nieuwenhuis, Voronkov]de Nivelle [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
1
Hide details for de Nivelle, Areces, de Rijke [Areces, de Rijke]de Nivelle, Areces, de Rijke [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
1
Hide details for de Nivelle, Baumgartner, Fuchs, Tinelli [Baumgartner, Fuchs, Tinelli, Ahrendt, Baumgartner]de Nivelle, Baumgartner, Fuchs, Tinelli [Baumgartner, Fuchs, Tinelli, Ahrendt, Baumgartner]
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
1
Hide details for de Nivelle, Bezem, Hendriks [Bezem, Hendriks, McAllester]de Nivelle, Bezem, Hendriks [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
1
Hide details for de Nivelle, Blackburn, Bos, Kohlhase [Blackburn, Bos, Kohlhase]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
1
Hide details for de Nivelle, de Rijke [de Rijke, de Rijke]de Nivelle, de Rijke [de Rijke, de Rijke]
2003Deciding the Guarded Fragments by Resolution
In: Journal of Symbolic Computation [35], 21-58
Journal Article
1
Hide details for de Nivelle, Demri [Demri, Areces, Blackburn]de Nivelle, Demri [Demri, Areces, Blackburn]
2003Deciding Modal Logics through Relational Translations into GF2
In: Proceedings of the 3rd Methods for Modalities Workshop, 15-30
Proceedings Article
2
Hide details for de Nivelle, Demri [Demri]de Nivelle, Demri [Demri]
2005Deciding Regular Grammar Logics with Converse through First-Order Logic
In: Journal of Logic, Language and Information [14], 289-329
Journal Article
2003Deciding regular grammar logics with converse through first-order logicReport
1
Hide details for de Nivelle, Hustadt, Schmidt [Hustadt, Schmidt]de Nivelle, Hustadt, Schmidt [Hustadt, Schmidt]
2000Resolution-Based Methods for Modal Logics
In: Logic Journal of the IGPL [8], 265-292
Journal Article
1
Hide details for de Nivelle, Kazakov [-]de Nivelle, Kazakov [-]
2004Attachment IconResolution Decision Procedures for the Guarded Fragment with
Transitive Guards
Report
1
Hide details for de Nivelle, Meng [Meng, Furbach, Shankar]de Nivelle, Meng [Meng, 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
1
Hide details for de Nivelle, Meng [Meng]de Nivelle, Meng [Meng]
2006Geo 2006jMiscellaneous
1
Hide details for de Nivelle, Piskac [-]de Nivelle, Piskac [-]
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
1
Hide details for de Nivelle, Pratt-Hartmann [Pratt-Hartmann, Goré, Leitsch, Nipkow]de Nivelle, Pratt-Hartmann [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
1
Hide details for de Nivelle, Schulz (ed.) [Schulz]de Nivelle, Schulz (ed.) [Schulz]
2001Proceedings of the 2nd International Workshop on the Implementation of LogicsProceedings
1
Hide details for de Raedt, Jaeger, Lee, Mannila [de Raedt, Lee, Mannila]de Raedt, Jaeger, Lee, Mannila [de Raedt, 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
1
Hide details for Degtyarev, Gurevich, Narendran, Veanes, Voronkov [Degtyarev, Gurevich, Narendran, Voronkov, Nipkow]Degtyarev, Gurevich, Narendran, Veanes, Voronkov [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
1
Hide details for Degtyarev, Gurevich, Narendran, Veanes, Voronkov [Degtyarev, Gurevich, Narendran, Voronkov]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
1
Hide details for Delahaye, Jaume, Prevosto [Delahaye, Jaume]Delahaye, Jaume, Prevosto [Delahaye, Jaume]
2005Coq, un outil pour l'enseignement
In: Technique et Science Informatiques [24], 1139-1160
Journal Article
1
Hide details for Delzanno [-]Delzanno [-]
1998Specification of Term Rewriting in Linear Logic
In: Proceedings of Workshop on Proof-Search in Type-Theoretic Languages, ??
Proceedings Article
1
Hide details for Delzanno, Esparza, Podelski [Flum, Rodríguez-Artalejo, Esparza, Flum]Delzanno, Esparza, Podelski [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
1
Hide details for Delzanno, Galmiche, Martelli [Galmiche, Martelli]Delzanno, Galmiche, Martelli [Galmiche, Martelli]
1999A specification logic for concurrent object-oriented programming
In: Mathematical Structures in Computer Science [9], 253-286
Journal Article
2
Hide details for Delzanno, Podelski [-]Delzanno, Podelski [-]
2001Constraint-based Deductive Model Checking
In: International Journal on Software Tools for Technology Transfer (STTT) [3], 250-270
Journal Article
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
1
Hide details for Delzanno, Raskin [Raskin, Graf, Schwartzbach]Delzanno, Raskin [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
1
Hide details for Dimitrova [-]Dimitrova [-]
2006Model Checking with Abstraction Refinement for Well-Structured Systems
Universität des Saarlandes
Thesis - Masters thesis
3
Hide details for Dimopoulos [-]Dimopoulos [-]
1996On Computing Logic Programs
In: Journal of Automated Reasoning [17], 259-289
Journal Article
1994Classical Methods in Nonmonotonic Reasoning
In: Proceedings of the 8th International Symposium on Methodologies for Intelligent Systems (ISMIS'94), 500-510
Proceedings Article
1994The Computational Value of Joint Consistency
In: Logics in Artificial Intelligence: Proceedings of the JELIA'94, 50-65
Proceedings Article
1
Hide details for Dimopoulos, Magirou [Magirou]Dimopoulos, Magirou [Magirou]
1994A Graph Theoretic Approach to Default Logic
In: Information and Computation [112], 239-256
Journal Article
1
Hide details for Dimopoulos, Magirou, Papadimitriou [-]Dimopoulos, Magirou, Papadimitriou [-]
1993On Kernels, Defaults and Even Graphs
In: Annals of Mathematics and Artificial Intelligence,
Journal Article
1
Hide details for Domshlak, Hoffmann [Domshlak, Long, Smith, Borrajo, McCluskey]Domshlak, Hoffmann [Domshlak, 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
1
Hide details for Dräge, Finkbeiner, Podelski [Dräge, Finkbeiner, Valmari]Dräge, Finkbeiner, Podelski [Dräge, Finkbeiner, Valmari]
2006Directed Model Checking with Distance-Preserving Abstractions
In: Model checking software : 13th International SPIN Workshop, 19-34
Proceedings Article
1
Hide details for Dubois, Jaume, Pons, Prevosto [Dubois, Jaume, Pons, Juilland]Dubois, Jaume, Pons, Prevosto [Dubois, Jaume, Pons, 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
3
Hide details for Eisenbrand [-]Eisenbrand [-]
2001Short vectors of planar integral lattices via continued fractions
In: Information Processing Letters [79], 121-126
Journal Article
2000Gomory-Chvátal Cutting planes and the Elementary Closure of Polyhedra
Universität des Saarlandes
Thesis - PhD thesis
1999On the Membership Problem for the Elementary Closure of a Polyhedron
In: Combinatorica [19], 297-300
Journal Article
1
Hide details for Eisenbrand, Bockmayr [Bockmayr]Eisenbrand, Bockmayr [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
1
Hide details for Eisenbrand, Rinaldi, Ventura [, Ventura]Eisenbrand, Rinaldi, Ventura [, 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
2
Hide details for Eisenbrand, Rote [Rote]Eisenbrand, Rote [Rote]
2001Fast 2-variable integer programming
In: Proceedings of the 8th Conference on Integer and Combinatorial Optimization (IPCO-01), 78-89
Proceedings Article
2001Fast reduction of ternary quadratic forms
In: Proceedings of the 1st Conference on Lattices and Cryptography (CaLC-01), 99-111
Proceedings Article
1
Hide details for Eisenbrand, Schulz [Schulz, Cornuéjols, Burkard, Woeginger]Eisenbrand, Schulz [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
1
Hide details for Eisinger, Nonnengart, Präcklein [Eisinger, Bläsius, Bürckert, Präcklein]Eisinger, Nonnengart, Präcklein [Eisinger, Bläsius, Bürckert, Präcklein]
1992Termersetzungssysteme
In: Deduktionssysteme -- Automatisierung des logischen Denkens, 126-149
Part of a Book
1
Hide details for Eisinger, Ohlbach [-]Eisinger, Ohlbach [-]
1993Deduction Systems Based on Resolution
In: Handbook of Logic in Artificial Intelligence and Logic Programming, 184-271
Proceedings Article
1
Hide details for Eisinger, Ohlbach, Präcklein [-]Eisinger, Ohlbach, Präcklein [-]
1991Reduction Rules for Resolution Based Systems
In: Artificial Intelligence [50], 141-181
Journal Article
1
Hide details for Engel [-]Engel [-]
1996Attachment IconQuantifier Elimination in Second-Order Predicate Logic
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Esparza, Podelski [Esparza]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
3
Hide details for Fehrer [-]Fehrer [-]
1995A unifying logical framework for reason maintenance
Universität des Saarlandes
Thesis - PhD thesis
1994A Unifying Logical Framework for Reason Maintenance (Deliverable DI.1.2-3P)
In: Medlar II Report PPR2, 47-55
Proceedings Article
1993A Unifying Framework for Reason Maintenance
In: Symbolic and Quantitative Approaches to Reasoning and Uncertainty: Proceedings European Conference ECSQARU '93, 113-120
Proceedings Article
1
Hide details for Fehrer, Hustadt, Jaeger, Nonnengart, Ohlbach, Schmidt, Weidenbach, Weydert [Baader, Lenzerini, Nutt, Patel-SchFehrer, Hustadt, Jaeger, Nonnengart, Ohlbach, Schmidt, Weidenbach, Weydert [Baader, Lenzerini, Nutt, Patel-Schneider]
1994Description Logics for Natural Language Processing
In: International Workshop on Description Logics '94, 80-84
Proceedings Article
1
Hide details for Fermüller, Leitsch, Hustadt, Tammet [Robinson, Voronkov, Fermüller, Leitsch, Tammet]Fermüller, Leitsch, Hustadt, Tammet [Robinson, Voronkov, Fermüller, Leitsch, Tammet]
2001Resolution Decision Procedures
In: Handbook of Automated Reasoning, 1793-1849
Part of a Book
1
Hide details for Firozabadhi, van der Torre [Firozabadhi]Firozabadhi, van der Torre [Firozabadhi]
1998Towards a formal analysis of control systems
In: Proceedings of the 13th European Conference on Artificial Intelligence (ECAI-98), 317-318
Proceedings Article
1
Hide details for Fischmann [-]Fischmann [-]
1999On Applications of Decidable Object-Oriented Type Theory
Universität des Saarlandes
Thesis - Masters thesis
2
Hide details for Frank, Basin [Frank]Frank, Basin [Frank]
1998Search in Games with Incomplete Information: A Case Study Using Bridge Card Play
In: Artificial Intelligence [100], 87-123
Journal Article
1996Search in Games with Incomplete Information: A Case Study Using Bridge Card PlayReport
1
Hide details for Frank, Basin, Bundy [-]Frank, Basin, Bundy [-]
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
1
Hide details for Freiheit, Luuk, Münch, Sijanski, Zangl [Luuk, Münch, Sijanski, Zangl]Freiheit, Luuk, Münch, Sijanski, Zangl [Luuk, Münch, Sijanski, Zangl]
2006Lexecute: Visualisation and representation of legal procedures
In: Digital Evidence Journal [3], 17-27
Journal Article
1
Hide details for Freiheit, Münch, Schöttle, Sijanski, Zangl [Münch, Schöttle, Sijanski, Zangl]Freiheit, Münch, Schöttle, Sijanski, Zangl [Münch, Schöttle, Sijanski, Zangl]
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
1
Hide details for Freiheit, Zangl [Zangl, Remenyi]Freiheit, Zangl [Zangl, Remenyi]
2006Model-based user-interface management for public services
In: 6th European Conference on e-Government, 141-151
Proceedings Article
1
Hide details for Friedrich [-]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
1
Hide details for Furbach, Ganzinger, Hasegawa, Kapur (ed.) [Furbach, Hasegawa, Kapur]Furbach, Ganzinger, Hasegawa, Kapur (ed.) [Furbach, Hasegawa, Kapur]
2000DeductionProceedings
1
Hide details for Gabbay, Kruse, Nonnengart, Ohlbach (ed.) [Gabbay, Kruse]Gabbay, Kruse, Nonnengart, Ohlbach (ed.) [Gabbay, Kruse]
1997Qualitative and Quantitative Practical ReasoningBook
1
Hide details for Gabbay, Ohlbach (ed.) [-]Gabbay, Ohlbach (ed.) [-]
1994Temporal Logic: Proceedings of the 1st International Conference on Temporal LogicProceedings
3
Hide details for Gabbay, Ohlbach [-]Gabbay, Ohlbach [-]
1992From a Hilbert Calculus to its Model Theoretic Semantics
In: Proc.~4th Annual UK Conference on Logic Programming (APULK '92), 218-252
Proceedings Article
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
1992Quantifier Elimination in Second-Order Predicate Logic
In: South African Computer Journal [7], 35-43
Journal Article
1
Hide details for Gaede [-]Gaede [-]
1995Attachment IconSuperposition Extended with Sorts
Universität Kaiserslautern
Thesis - Masters thesis
1
Hide details for Gaillourdet, Hillenbrand, Löchner, Spies [Gaillourdet, Löchner, Spies, Baader, Baader]Gaillourdet, Hillenbrand, Löchner, Spies [Gaillourdet, Löchner, Spies, Baader, Baader]
2003Attachment IconThe New WALDMEISTER Loop at Work
In: Automated deduction, CADE-19 : 19th International Conference on Automated Deduction, 317-321
Proceedings Article
1
Hide details for Gamkrelidze [-]Gamkrelidze [-]
2001Attachment IconEinige Optimierungsmethoden hierarchischer Schaltkreise
Universität des Saarlandes
Thesis - PhD thesis
2
Hide details for Ganzinger (ed.) [-]Ganzinger (ed.) [-]
1999Proceedings of the 16th International Conference on Automated Deduction (CADE-16)Proceedings
1996Rewriting Techniques and Applications, 7th International Conference, RTA-96Proceedings
6
Hide details for Ganzinger [-]Ganzinger [-]
2001Efficient deductive methods for program analysis
In: ACM SIGPLAN Notices [36], 102-103
Journal Article
1998Preface
In: Theoretical Computer Science [208], 1
Journal Article
1996Saturation-based theorem proving (abstract)
In: Automata, Languages and Programming: International Colloquium (ICALP-23), 1-3
Proceedings Article
1994The Saturate SystemUnpublished/Draft
1991A completion procedure for conditional equations
In: Journal of Symbolic Computation [11], 51-81
Journal Article
1991Order-Sorted Completion: The Many-Sorted Way
In: Theoretical Computer Science [89], 3-32
Journal Article
1
Hide details for Ganzinger [Danvy, Filinski]Ganzinger [Danvy, Filinski]
2001Bottom-Up Deduction with Deletion and Priorities
In: Programs as Data Objects (PADO-01) : Second Symposium PADO 2001, 276-277
Proceedings Article
1
Hide details for Ganzinger [Voronkov]Ganzinger [Voronkov]
2002Attachment IconShostak Light
In: Automated deduction, CADE-18 : 18th International Conference on Automated Deduction, 332-346
Proceedings Article
1
Hide details for Ganzinger [Williams]Ganzinger [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
1
Hide details for Ganzinger, de Nivelle [Longo]Ganzinger, de Nivelle [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
1
Hide details for Ganzinger, Hagen, Nieuwenhuis, Oliveras, Tinelli [Hagen, Nieuwenhuis, Oliveras, Tinelli, Alur, Peled]Ganzinger, Hagen, Nieuwenhuis, Oliveras, Tinelli [Hagen, Nieuwenhuis, Oliveras, Tinelli, Alur, Peled]
2004DPLL(T): Fast Decision Procedures
In: Computer aided verification : 16th International Conference, CAV 2004, 175-188
Proceedings Article
1
Hide details for Ganzinger, Hillenbrand, Waldmann [Baader]Ganzinger, Hillenbrand, Waldmann [Baader]
2003Attachment IconSuperposition modulo a Shostak Theory
In: Automated Deduction, CADE-19 : 19th International Conference on Automated Deduction, 182-196
Proceedings Article
1
Hide details for Ganzinger, Hustadt, Meyer, Schmidt [Zakharyaschev, Segerberg, de Rijke, Wansing]Ganzinger, Hustadt, Meyer, Schmidt [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
1
Hide details for Ganzinger, Jacquemard, Veanes [Hsiang, Ohori]Ganzinger, Jacquemard, Veanes [Hsiang, Ohori]
1998Rigid Reachability
In: Proceedings of the 4th Asian Computing Science Conference on Advances in Computing Science (ASIAN-98), 4-21
Proceedings Article
1
Hide details for Ganzinger, Jacquemard, Veanes [Jacquemard, Veanes]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
1
Hide details for Ganzinger, Korovin [Kolaitis]Ganzinger, Korovin [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
2
Hide details for Ganzinger, Korovin [Korovin, Hermann, Voronkov]Ganzinger, Korovin [Korovin, Hermann, Voronkov]
2006Theory Instantiation
In: 13th Conference on Logic for Programming Artificial Intelligence Reasoning (LPAR'06), 497-511
Proceedings Article
2006Theory Instantiation
In: Logic for Programming, Artificial Intelligence, and Reasoning : 13th International Conference, LPAR 2006, 497-511
Proceedings Article
1
Hide details for Ganzinger, Korovin [Marcinkowski, Tarlecki]Ganzinger, Korovin [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
1
Hide details for Ganzinger, McAllester [McAllester, Goré, Leitsch, Nipkow]Ganzinger, McAllester [McAllester, 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
1
Hide details for Ganzinger, McAllester [McAllester, Stuckey]Ganzinger, McAllester [McAllester, Stuckey]
2002Attachment IconLogical Algorithms
In: Logic Programming. 18th International Conference, ICLP 2002, 209-223
Proceedings Article
1
Hide details for Ganzinger, McAllester, Voronkov (ed.) [McAllester, Voronkov]Ganzinger, McAllester, Voronkov (ed.) [McAllester, Voronkov]
1999Proceedings of the 6th International Conference on Logic for Programming and Automated Reasoning (LPAR-99)Proceedings
1
Hide details for Ganzinger, Meyer, Veanes [Longo]Ganzinger, Meyer, Veanes [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
1
Hide details for Ganzinger, Meyer, Weidenbach [McCune]Ganzinger, Meyer, Weidenbach [McCune]
1997Soft Typing for Ordered Resolution
In: Proceedings of the 14th International Conference on Automated Deduction (CADE-14), 321-335
Proceedings Article
1
Hide details for Ganzinger, Nieuwenhuis [Nieuwenhuis, Comon, Marché, Treinen]Ganzinger, Nieuwenhuis [Nieuwenhuis, Comon, Marché, Treinen]
2001Attachment IconConstraints and Theorem Proving
In: Contraints in Computational Logics, International Summer School (CCL-99), 159-201
Proceedings Article
1
Hide details for Ganzinger, Nieuwenhuis, Nivela [Nieuwenhuis, Nivela, Goré, Leitsch, Nipkow]Ganzinger, Nieuwenhuis, Nivela [Nieuwenhuis, Nivela, Goré, Leitsch, Nipkow]
2001Attachment IconContext trees
In: Automated reasoning : First International Joint Conference, IJCAR 2001, 242-256
Proceedings Article
1
Hide details for Ganzinger, Nieuwenhuis, Nivela [Nieuwenhuis, Nivela]Ganzinger, Nieuwenhuis, Nivela [Nieuwenhuis, Nivela]
2004Attachment IconFast Term Indexing with Coded Context Trees
In: Journal of Automated Reasoning [32], 103-120
Journal Article
1
Hide details for Ganzinger, Sofronie-Stokkermans [-]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
2
Hide details for Ganzinger, Sofronie-Stokkermans, Waldmann [-]Ganzinger, Sofronie-Stokkermans, Waldmann [-]
2006Modular Proof Systems for Partial Functions with Evans Equality
In: Information and Computation [204], 1453-1492
Journal Article
2004Modular Proof Systems for Partial Functions with Weak Equality
In: Automated reasoning : Second International Joint Conference, IJCAR 2004, 168-182
Proceedings Article
1
Hide details for Ganzinger, Stuber [-]Ganzinger, Stuber [-]
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
2
Hide details for Ganzinger, Stuber [Stuber]Ganzinger, Stuber [Stuber]
2005Superposition with equivalence reasoning and delayed clause normal form transformation
In: Information and Computation [199], 3-23
Journal Article
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
2
Hide details for Ganzinger, Waldmann [-]Ganzinger, Waldmann [-]
1996Theorem Proving in Cancellative Abelian Monoids (Extended Abstract)
In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), 388-402
Proceedings Article
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
1
Hide details for Georgieva, Hustadt, Schmidt [Georgieva, Hustadt, Schmidt, Horrocks, Tessaris]Georgieva, Hustadt, Schmidt [Georgieva, Hustadt, Schmidt, 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
1
Hide details for Georgieva, Hustadt, Schmidt [Georgieva, Hustadt, Schmidt, Voronkov]Georgieva, Hustadt, Schmidt [Georgieva, Hustadt, Schmidt, Voronkov]
2002A New Clausal Class Decidable by Hyperresolution
In: Automated deduction, CADE-18 : 18th International Conference on Automated Deduction, 260-274
Proceedings Article
1
Hide details for Georgieva, Hustadt, Schmidt [Georgieva, Hustadt, Schmidt]Georgieva, Hustadt, Schmidt [Georgieva, Hustadt, Schmidt]
2002A New Clausal Class Decidable by HyperresolutionReport
1
Hide details for Georgieva, Maier [Georgieva, Aichernig, Beckert]Georgieva, Maier [Georgieva, Aichernig, Beckert]
2005Description Logics for Shape Analysis
In: Third IEEE International Conference on Software Engineering and Formal Methods (SEFM 2005), 321-330
Proceedings Article
1
Hide details for Gerber [-]Gerber [-]
1995Entwicklung eines Algorithmus zur effizienten Anfragebeantwortung für eine terminologische Wissensrepräsentationssprache
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Göbel, Maier [Göbel, Ganzha, Mayr, Vorozhtsov]Göbel, Maier [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
1
Hide details for Goncharov, Harizanov, Knight, Morozov, Romina [Goncharov, Harizanov, Knight, Morozov]Goncharov, Harizanov, Knight, Morozov, Romina [Goncharov, Harizanov, Knight, Morozov]
2005On automorphic tuples of elements in computable models
In: Siberian Mathematical Journal [46], 405-412
Journal Article
1
Hide details for Goranko, Hustadt, Schmidt, Vakarelov [Goranko, Hustadt, Vakarelov, Berghammer, Möller, Struth]Goranko, Hustadt, Schmidt, Vakarelov [Goranko, Hustadt, Vakarelov, 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
4
Hide details for Graf [-]Graf [-]
1995Substitution Tree Indexing
In: Proceedings of the 6th International Conference on Rewriting Techniques and Applications (RTA-95), 117-131
Proceedings Article
1995Term Indexing
Universität des Saarlandes
Thesis - PhD thesis
1994Extended Path-Indexing
In: Proceedings of the 12th International Conference on Automated Deduction (CADE-12), 514-528
Proceedings Article
1992Unification Using Dynamic Sorts
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Graf [Carbonell, Siekmann]Graf [Carbonell, Siekmann]
1996Term IndexingBook
1
Hide details for Graf [McRobbie, Slaney]Graf [McRobbie, Slaney]
1996Path indexing for AC-theories
In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), 718-732
Proceedings Article
1
Hide details for Graf, Meyer [-]Graf, Meyer [-]
1996Advanced indexing operations on substitution trees
In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), 553-567
Proceedings Article
1
Hide details for Grenner [-]Grenner [-]
2001Die Erzeugung von Schnittebenen mit maximalem Verletzungsgrad und deren Einsatz im Branch-and-Cut Verfahren
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Gurevich, Veanes [Gurevich]Gurevich, Veanes [Gurevich]
1999Logic with Equality: Partisan Corroboration and Shifted Pairing
In: Information and Computation [152], 205-235
Journal Article
1
Hide details for Hagemann [-]Hagemann [-]
2005Formalisierung der Arithmetik
Universität Göttingen
Thesis - other
1
Hide details for Hähnle, Kerber, Weidenbach [Hähnle, Kerber]Hähnle, Kerber, Weidenbach [Hähnle, Kerber]
1996Common Syntax of the DFG-Schwerpunktprogramm ``Deduktion''Report
16
Hide details for Hanus [-]Hanus [-]
1995Analysis of Residuating Logic Programs
In: Journal of Logic Programming [24], 219-245
Journal Article
1995Compile-Time Analysis of Nonlinear Constraints in CLP(R)
In: New Generation Computing [13], 155-186
Journal Article
1995On Extra Variables in (Equational) Logic Programming
In: Proceedings of the Twelfth International Conference on Logic Programming, 665-679
Proceedings Article
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
1994Lazy Unification with Simplification
In: Proceedings of the 5th European Symposium on Programming Languages and Systems (ESOP'94), 272-286
Proceedings Article
1994The Integration of Functions into Logic Programming: From Theory to Practice
In: Journal of Logic Programming [19 & 20], 583-628
Journal Article
1994Thema der Antrittsvorlesung: Deklarative Programmierparadigmen und ihre Integration
Universität des Saarlandes
Thesis - Habilitation thesis
1993Analysis of Nonlinear Constraints in CLP($\calR$)
In: Proceedings of the 10th International Conference on Logic Programming (ICLP '93), 83-99
Proceedings Article
1993Towards the Global Optimization of Functional Logic Programs
In: Proc.~Workshop on Global Compilation, International Logic
Programming Symposium, 83-97
Proceedings Article
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
1992Incremental Rewriting in Narrowing Derivations
In: Proceedings of the 3rd International Conference on Algebraic and Logic Programming (ALP-92), 228-243
Proceedings Article
1992Logic Programming with Type Specifications
In: Types in Logic Programming, 91-140
Part of a Book
1992On the Completeness of Residuation
In: Proceedings of the 1992 Joint International Conference and Symposium on Logic Programming, 192-206
Proceedings Article
1991Efficient Implementation of Narrowing and Rewriting
In: Proc. Intern. Workshop on Processing Declarative Knowledge, 344-365
Proceedings Article
1991Horn Clause Programs with Polymorphic Types: Semantics and Resolution
In: Theoretical Computer Science [89], 63-106
Journal Article
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
1
Hide details for Hanus, Josephs [Josephs]Hanus, Josephs [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
1
Hide details for Hanus, Zartmann [-]Hanus, Zartmann [-]
1994Mode Analysis of Functional Logic Programs
In: Proceedings of the 1st International Static Analysis Symposium (SAS'94), 26-42
Proceedings Article
1
Hide details for Hillenbrand [Dahn, Vigneron]Hillenbrand [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
1
Hide details for Hillenbrand [Sattler]Hillenbrand [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
1
Hide details for Hillenbrand, Löchner [Löchner, Schulz]Hillenbrand, Löchner [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
1
Hide details for Hillenbrand, Löchner [Löchner, Voronkov]Hillenbrand, Löchner [Löchner, Voronkov]
2002Attachment IconThe Next WALDMEISTER Loop
In: Automated deduction, CADE-18 : 18th International Conference on Automated Deduction, 486-500
Proceedings Article
1
Hide details for Hillenbrand, Podelski, Topić [-]Hillenbrand, Podelski, Topić [-]
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
1
Hide details for Hillenbrand, Topic, Weidenbach [Ahrendt]Hillenbrand, Topic, Weidenbach [Ahrendt]
2006Sudokus as Logical Puzzles
In: Proceedings of the Third Workshop on Disproving, 2-12
Electronic Proceedings Article
1
Hide details for Hoenicke, Maier [Hoenicke, Fitzgerald, Hayes, Tarlecki]Hoenicke, Maier [Hoenicke, 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
3
Hide details for Hoffmann [-]Hoffmann [-]
2005Where Ignoring Delete Lists Works: Local Search Topology in Planning Benchmarks
In: Journal of Artificial Intelligence Research [24], 685-758
Journal Article
2003The Metric-FF Planning System: Translating ``Ignoring Delete Lists'' To Numeric State Variables
In: Journal of Artificial Intelligence Research [20], 51
Journal Article
2003Utilizing Problem Structure in Planning: A Local Search ApproachBook
1
Hide details for Hoffmann [Edelkamp]Hoffmann [Edelkamp]
2005The Deterministic Part of IPC-4: An Overview
In: Journal of Artificial Intelligence Research [24], 519 - 579
Journal Article
1
Hide details for Hoffmann [Kupferschmid, Kaelbling]Hoffmann [Kupferschmid, Kaelbling]
2005A Covering Problem for Hypercubes
In: Proceedings of the 19th International Joint Conference on Artificial Intelligence, 579-580
Poster
1
Hide details for Hoffmann [Thiebaux, Nebel]Hoffmann [Thiebaux, Nebel]
2005In Defense of PDDL Axioms
In: Artificial Intelligence [168], 38-69
Journal Article
1
Hide details for Hoffmann, Brafman [Brafman, Biundo, Meyers, Rajan]Hoffmann, Brafman [Brafman, 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
1
Hide details for Hoffmann, Brafman [Brafman]Hoffmann, Brafman [Brafman]
2006Conformant planning via heuristic forward search: A new approach
In: Artificial Intelligence [170], 507-541
Journal Article
1
Hide details for Hoffmann, Geffner [Geffner, Giunchiglia, Muscettola, Nau]Hoffmann, Geffner [Geffner, Giunchiglia, Muscettola, Nau]
2003Branching Matters: Alternative Branching in Graphplan
In: 13th International Conference on Automated Planning and Scheduling (ICAPS-13), 22-31
Proceedings Article
1
Hide details for Hoffmann, Gomes, Selman [Gomes, Selman, Long, Smith, Borrajo, McCluskey]Hoffmann, Gomes, Selman [Gomes, Selman, 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
1
Hide details for Hoffmann, Porteous, Sebastia [Porteous, Sebastia]Hoffmann, Porteous, Sebastia [Porteous, Sebastia]
2004Ordered Landmarks in Planning
In: Journal of Artificial Intelligence Research [22], 215-278
Journal Article
1
Hide details for Hoffmann, Sabharwal, Domshlak [Sabharwal, Domshlak, Long, Smith, Borrajo, McCluskey]Hoffmann, Sabharwal, Domshlak [Sabharwal, Domshlak, 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
2
Hide details for Hopf [-]Hopf [-]
2001Photomaskenlayout für eine 3D-Grauton-Lithographie als kombinatorisches Optimierungsproblem
Universität des Saarlandes
Thesis - PhD thesis
1994Genetic Algorithms within the Framework of Evolutionary ComputationMiscellaneous
2
Hide details for Hopf [Claus, Schwefel]Hopf [Claus, Schwefel]
1996Optimizing Photo Mask Layout for Grey-tone LithographyReport
1996Optimizing Photo Mask Layout for Grey-tone LithographyReport
1
Hide details for Hopf [Steele]Hopf [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
1
Hide details for Hopf, Klawonn [Klawonn, Kruse, Palm, Gebhardt]Hopf, Klawonn [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
1
Hide details for Hopf, Klawonn [Klawonn]Hopf, Klawonn [Klawonn]
1993Selbstlernende Fuzzy-Controller auf der Basis Genetischer Algorithmen
In: Fuzzy-Systeme '93 / Management unsicherer Informationen, 21-27
Proceedings Article
1
Hide details for Hopf, Rau [Jamshidi, Fathi, Pierrot]Hopf, Rau [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
8
Hide details for Hustadt [-]Hustadt [-]
1999Resolution-Based Decision Procedures for Subclasses of First-Order Logic
Universität des Saarlandes
Thesis - PhD thesis
1994A Multi-Modal Logic for Stereotyping
In: Proceedings of the 4th International Conference on User Modeling UM94, 87-92
Proceedings Article
1994Common and Mutual Belief for Agent Modeling
In: KI-94 Workshops: Extended Abstracts, 123-124
Proceedings Article
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
1994Do we need the closed-world assumption in knowledge representation?
In: KI-94 Workshops: Extended Abstracts, 293-294
Proceedings Article
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
1993Abductive Disjunctive Logic Programming
In: ICLP '93 Postconference Workshop on Abductive Reasoning, ?
Proceedings Article
1993Automated Support for the Development of Non-classical Logics
In: Workshop: Modellierung epistemischer Propositionen, KI '93,
Proceedings Article
1
Hide details for Hustadt [Laux, Wansing]Hustadt [Laux, Wansing]
1995Introducing Epistemic Operators into a Description Logic
In: Knowledge and Belief in Philosophie and Artificial Intelligence, 65-85
Part of a Book
1
Hide details for Hustadt, Nonnengart [Rowles, Liu, Foo]Hustadt, Nonnengart [Rowles, Liu, Foo]
1993Modalities in Knowledge Representation
In: Proc. of the 6th Australian Joint Conference on Artificial Intelligence (AI '93), 249-254
Proceedings Article
3
Hide details for Hustadt, Schmidt [-]Hustadt, Schmidt [-]
1999An Empirical Analysis of Modal Theorem Provers
In: Journal of Applied Non-Classical Logics [9], 479-522
Journal Article
1999Maslov's Class K Revisited
In: Proceedings of the 16th International Conference on Automated Deduction (CADE-16), 172-186
Proceedings Article
1997On Evaluating Decision Procedures for Modal Logics
In: Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (IJCAI-97), 202-207
Proceedings Article
1
Hide details for Hustadt, Schmidt [de Swart]Hustadt, Schmidt [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
1
Hide details for Hustadt, Schmidt [Dean]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
1
Hide details for Hustadt, Schmidt, Weidenbach [de Swart]Hustadt, Schmidt, Weidenbach [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
1
Hide details for Iturrioz, Sofronie-Stokkermans [Iturrioz, Orlowska, Turunen]Iturrioz, Sofronie-Stokkermans [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
1
Hide details for Jacobs [-]Jacobs [-]
2004Attachment IconInstance Generation Methods for Automated Reasoning
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Jacobs, Sofronie-Stokkermans [-]Jacobs, Sofronie-Stokkermans [-]
2007Applications of hierarchical reasoning in the verification of complex systems
In: Electronic Notes in Theoretical Computer Science [??],
Electronic Journal Article
1
Hide details for Jacobs, Sofronie-Stokkermans [Cook, Sebastiani]Jacobs, Sofronie-Stokkermans [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
1
Hide details for Jacobs, Waldmann [Beckert]Jacobs, Waldmann [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
1
Hide details for Jacquemard, Meyer, Weidenbach [Jacquemard, Nipkow]Jacquemard, Meyer, Weidenbach [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
16
Hide details for Jaeger [-]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
2002Probabilistic Decision Graphs
Universität des Saarlandes
Thesis - Habilitation thesis
2002Attachment IconRelational Bayesian Networks: a Survey
In: Electronic Transactions on Artificial Intelligence [6],
Electronic Journal Article
2001Attachment IconAutomatic Derivation of Probabilistic Inference Rules
In: International Journal of Approximate Reasoning [28], 1-22
Journal Article
2001Attachment IconComplex Probabilistic Modeling with Recursive Relational Bayesian Networks
In: Annals of Mathematics and Artificial Intelligence [32], 179-220
Journal Article
2000Attachment IconOn the complexity of inference about probabilistic relational models
In: Artificial Intelligence [117], 297-308
Journal Article
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
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
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
1997Attachment IconRelational Bayesian Networks
In: Proceedings of the 13th Conference of Uncertainty in Artificial Intelligence (UAI-13), 266-273
Proceedings Article
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
1995Default Reasoning about Probabilities
Universität des Saarlandes
Thesis - PhD thesis
1995Minimum Cross-Entropy Reasoning: A Statistical Justification
In: Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95), 1847-1852
Proceedings Article
1994A Logic for Default Reasoning About Probabilities
In: Proceedings of the 10th Conference on Uncertainty in Artificial Intelligence (UAI'94), 352-359
Proceedings Article
1994Probabilistic Reasoning in Terminological Logics
In: Principles of Knowledge Representation an Reasoning: Proceedings of the 4th International Conference (KR94), 305-316
Proceedings Article
1993Circumscription: Completeness Reviewed
In: Artificial Intelligence [60], 293-301
Journal Article
1
Hide details for Jaeger [Fawcett, Mishra]Jaeger [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
1
Hide details for Jaeger [Kwiatkowska]Jaeger [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
1
Hide details for Jaeger [Nebel]Jaeger [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
1
Hide details for Jaeger [Nielsen, Zhang]Jaeger [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
1
Hide details for Jaeger, Mannila, Weydert [Ng]Jaeger, Mannila, Weydert [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
1
Hide details for Jaulin, Ratschan, Hardouin [Jaulin, Hardouin]Jaulin, Ratschan, Hardouin [Jaulin, Hardouin]
2004Set Computation for Nonlinear Control
In: Reliable Computing [10], 1-26
Journal Article
1
Hide details for Jensen, Podelski (ed.) [Jensen]Jensen, Podelski (ed.) [Jensen]
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
1
Hide details for Jensen, Podelski [Jensen]Jensen, Podelski [Jensen]
2006Tools and algorithms for the construction and analysis of systems
In: International Journal on Software Tools for Technology Transfer [8], 177-179
Journal Article
1
Hide details for Johann, Socher-Ambrosius [Johann]Johann, Socher-Ambrosius [Johann]
1994Solving Simplificating Ordering Constraints
In: Proceedings of the 1st International Conference on Constraints in Computational Logics (CCL'94), 352-367
Proceedings Article
1
Hide details for Jung [-]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
1
Hide details for Kasper [-]Kasper [-]
1998A Unifying Logical Framework for Integer Linear Programming and Finite Domain Constraint Programming
Universität des Saarlandes
Thesis - PhD thesis
2
Hide details for Kazakov [-]Kazakov [-]
2006Attachment IconSaturation-Based Decision Procedures For Extensions Of The Guarded Fragment
Universität des Saarlandes
Thesis - PhD thesis
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
1
Hide details for Kazakov [Alferes, Leite]Kazakov [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
1
Hide details for Kazakov, de Nivelle [Basin, Rusinowitch]Kazakov, de Nivelle [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
1
Hide details for Kazakov, de Nivelle [Calvanese, De Giacomo, Franconi]Kazakov, de Nivelle [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
1
Hide details for Klotzki [-]Klotzki [-]
1995Wiedemann-Algorithmus zur Lösung dünnbesetzter Gleichungssysteme über Fp
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Korovin [-]Korovin [-]
2003Knuth-Bendix orders in automated deduction and term rewriting
University of Manchester
Thesis - PhD thesis
1
Hide details for Korovin, Voronkov [Voronkov, Baader]Korovin, Voronkov [Voronkov, Baader]
2003Attachment IconAC-compatible Knuth-Bendix Order
In: Automated deduction, CADE-19 : 19th International Conference on Automated Deduction, 47-59
Proceedings Article
1
Hide details for Korovin, Voronkov [Voronkov, Kolaitis, Voronkov, Kolaitis]Korovin, Voronkov [Voronkov, 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
2
Hide details for Korovin, Voronkov [Voronkov]Korovin, Voronkov [Voronkov]
2005Knuth-Bendix constraint solving is NP-complete
In: ACM Transactions on Computational Logic [6], 361-388
Journal Article
2003Orienting rewrite rules with the Knuth-Bendix order
In: Information and Computation [183], 165-186
Journal Article
2
Hide details for Kraan, Basin, Bundy [-]Kraan, Basin, Bundy [-]
1993Logic Program Synthesis via Proof Planning
In: International Workshop on Logic Program Synthesis and Transformation (LOPSTR '92), 1-14
Proceedings Article
1993Middle-Out Reasoning for Logic Program Synthesis
In: Proc.~10th Intern. Conference on Logic Programing (ICLP '93), 441-455
Proceedings Article
2
Hide details for Kraan, Basin, Bundy [Kraan, Bundy]Kraan, Basin, Bundy [Kraan, Bundy]
1996Middle-Out Reasoning for Synthesis and Induction
In: Automated mathematical induction, 113-145
Part of a Book
1996Middle-out reasoning for synthesis and induction
In: Journal of Automated Reasoning [16], 113-145
Journal Article
1
Hide details for Krischer, Bockmayr [-]Krischer, Bockmayr [-]
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
12
Hide details for Krishna Rao [-]Krishna Rao [-]
2000Some characteristics of strong innermost normalization
In: Theoretical Computer Science [239], 141-164
Journal Article
2000Some classes of prolog programs inferable from positive data
In: Theoretical Computer Science [241], 211-223
Journal Article
1998Modular Aspects of term graph rewriting
In: Theoretical Computer Science [208], 59-86
Journal Article
1997A framework for incremental learning of logic programs
In: Theoretical Computer Science [185], 191-213
Journal Article
1996A class of Prolog programs inferable from positive data
In: Algorithmic Learning Theory, 272-284
Proceedings Article
1996Completeness results for basic narrowing in non-copying implementations
In: Logic Programming, 393-407
Proceedings Article
1996Learning Prolog programs from examples
In: Knowledge Based Computer Systems, 19-30
Proceedings Article
1996Modularity of termination in term graph rewriting
In: Rewriting Techniques and Applications, 230-244
Proceedings Article
1996Relating confluence, innermost-confluence and outermost-confluence properties of term rewriting systems
In: Acta Informatica [33], 595-606
Journal Article
1996Some characteristics of strong innermost normalization
In: Algebraic Methodology and Software Technology, 5th International Conference, AMAST '96, 406-420
Proceedings Article
1995Incremental Learning of Logic Programs
In: Proceedings of International Workshop on Algorithmic Learning Theory, 95-109
Proceedings Article
1995Modular Proofs for Completeness of hierarchical term rewriting systems
In: Theoretical Computer Science [151], 487-512
Journal Article
1
Hide details for Krishna Rao [Mosses, Nielsen, Schwartzbach]Krishna Rao [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
1
Hide details for Krishna Rao [Wiedermann, Hájek]Krishna Rao [Wiedermann, Hájek]
1995Graph reducibility of term rewriting systems
In: Proceedings of Mathematical Foundations of Computer Science, 371-381
Proceedings Article
1
Hide details for Krishna Rao, Shyamasundar [Shyamasundar]Krishna Rao, Shyamasundar [Shyamasundar]
1995Unification-free Execution of Well-moded Prolog Programs
In: Proc. of International Static Analysis Symposium, 243-260
Proceedings Article
1
Hide details for Kupferschmid, Hoffmann, Dierks, Behrmann [Kupferschmid, Dierks, Behrmann, Valmari]Kupferschmid, Hoffmann, Dierks, Behrmann [Kupferschmid, Dierks, Behrmann, Valmari]
2006Adapting an AI Planning Heuristic for Directed Model Checking
In: Model checking software : 13th International SPIN Workshop, 35-52
Proceedings Article
2
Hide details for Lang, van der Torre, Weydert [Lang, van der Torre]Lang, van der Torre, Weydert [Lang, van der Torre]
2002Utilitarian Desires
In: Autonomous Agents and Multi-Agent Systems [5], 329-363
Journal Article
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
2
Hide details for Lee [-]Lee [-]
2009Ranking functions for size-change termination
In: ACM Transactions on Programming Languages and Systems [31], 10:1-10:42
Journal Article
2004Size-change Termination AnalyzerUnpublished/Draft
2
Hide details for Lee, Plaisted [Lee]Lee, Plaisted [Lee]
1994Problem solving by searching for models with a theorem prover
In: Artificial Intelligence [69], 205-233
Journal Article
1994Use of replace rules in theorem proving
In: Methods of Logic in Computer Science [1], 217-240
Journal Article
1
Hide details for Letz, Stenz [Letz, Cialdea Mayer, Pirri]Letz, Stenz [Letz, 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
1
Hide details for Letz, Weidenbach [Letz]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
1
Hide details for Leven [-]Leven [-]
1998Integrating Clausal Decision Procedures in a Tactic Based Theorem Prover
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Levy, Veanes [Levy]Levy, Veanes [Levy]
2000On the Undecidability of Second-Order Unification
In: Information and Computation [159], 125-150
Journal Article
1
Hide details for Lilith, Billington, Freiheit [Lilith, Billington]Lilith, Billington, Freiheit [Lilith, Billington]
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
1
Hide details for Löchner, Hillenbrand [Löchner]Löchner, Hillenbrand [Löchner]
2002Attachment IconA Phytography of WALDMEISTER
In: AI Communications [15], 127-133
Journal Article
1
Hide details for Lu, Wu [Lu]Lu, Wu [Lu]
2000On Theorem proving in Annotated Logics
In: Journal of Applied Non-Classical Logics [10], 121-143
Journal Article
3
Hide details for Madden [-]Madden [-]
1995Program improvement by proof planning
In: Proceedings of British Colloquium on Theoretical Computer Science (BCTCS 11),
Proceedings Article
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
1992Automated Program Transformation Through Proof Transformation
In: Proceedings of the 11th International Conference on Automated Deduction (CADE-11), 446-460
Proceedings Article
1
Hide details for Madden, Bundy [Bundy]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
1
Hide details for Madden, Bundy, Smaill [Bundy, Smaill]Madden, Bundy, Smaill [Bundy, Smaill]
1999Recursive Program Optimization Through Inductive Synthesis Proof Transformation
In: Journal of Automated Reasoning [22], 65-115
Journal Article
1
Hide details for Madden, Green [Green]Madden, Green [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
3
Hide details for Maier [-]Maier [-]
2004Attachment IconIntuitionistic LTL and a New Characterization of Safety and LivenessReport
2003Attachment IconA Lattice-Theoretic Framework For Circular Assume-Guarantee Reasoning
Universität des Saarlandes
Thesis - PhD thesis
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
1
Hide details for Maier [Gordon]Maier [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
1
Hide details for Maier [Marcinkowski, Tarlecki]Maier [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
1
Hide details for Maier [Orejas, Spirakis, van Leeuwen]Maier [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
2
Hide details for Makinson, van der Torre [Makinson]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
2000Input-output logics
In: Journal of Philosophical Logic [29], 383-408
Journal Article
1
Hide details for Malkis, Podelski, Rybalchenko [Barkaoui, Cavalcanti, Cerone]Malkis, Podelski, Rybalchenko [Barkaoui, Cavalcanti, Cerone]
2006Thread-Modular Verification is Cartesian Abstract Interpretation
In: Theoretical Aspects of Computing - ICTAC 2006 : Third International Colloquium, 183-197
Proceedings Article
1
Hide details for Malkis, Podelski, Rybalchenko [Gopalakrishnan, O'Leary]Malkis, Podelski, Rybalchenko [Gopalakrishnan, O'Leary]
2006Attachment IconThread-Modular Verification and Cartesian AbstractionUnpublished/Draft
5
Hide details for Matthews [-]Matthews [-]
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
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
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
1994A Theory and its Metatheory in $FS_0$
In: What is a logical system?, 329-354
Part of a Book
1992Reflection in a Logical System
In: Proc.~IMSA '92 Workshop on Reflection and Meta-Level Architecture, 178-183
Proceedings Article
2
Hide details for Matthews, Basin [Basin]Matthews, Basin [Basin]
2000Structuring Metatheory on Inductive Definitions
In: Information and Computation [162], 80-95
Journal Article
1998Scoped Metatheorems
In: Electronic Notes in Computer Science [15], 1-14
Journal Article
1
Hide details for Matthews, Simpson [Simpson]Matthews, Simpson [Simpson]
1996Reflection using the derivability conditions
In: Logic and Algebra, 603-616
Part of a Book
1
Hide details for Matthews, Smaill, Basin [-]Matthews, Smaill, Basin [-]
1993Experience with $FS_0$ as a Framework Theory
In: Logical Environments, 61-82
Part of a Book
1
Hide details for Meter [-]Meter [-]
2009Just a test entry
In: Booktitle, 1001-1010
Proceedings Article
2
Hide details for Meyer [-]Meyer [-]
1999Soft Typing for Clausal Inference Systems
Universität des Saarlandes
Thesis - PhD thesis
1996Attachment IconParallel Unit Resulting Resolution
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Meyer, Faber, Rybalchenko [Meyer, Faber, Barkaoui, Cavalcanti, Cerone]Meyer, Faber, Rybalchenko [Meyer, Faber, Barkaoui, Cavalcanti, Cerone]
2006Model checking Duration Calculus: a practical approach
In: Theoretical Aspects of Computing - ICTAC 2006 : Third International Colloquium, 332-346
Proceedings Article
1
Hide details for Mohr [-]Mohr [-]
1995Resolution-Based Calculi for Modal Logics
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Mukhopadhyay [-]Mukhopadhyay [-]
2001Attachment IconA Uniform Constraint-based Framework for the Verification of Infinite State Systems
Universität des Saarlandes
Thesis - PhD thesis
2
Hide details for Mukhopadhyay, Podelski [-]Mukhopadhyay, Podelski [-]
2001Accurate Widenings and Boundedness Properties of Timed Systems
In: Perspectives of System Informatics: 4th International Andrei Ershov Memorial Conference, 79-94
Proceedings Article
2000Model Checking for Timed Logic Processes
In: Proceedings of the 1st International Conference on Computational Logic, 598-612
Proceedings Article
1
Hide details for Mukhopadhyay, Podelski [Koenig, Holte]Mukhopadhyay, Podelski [Koenig, Holte]
2002An Algebraic Framework for Abstract Model Checking
In: Abstraction, reformulation, and approximation : 5th International Symposium, SARA 2002, 152-169
Proceedings Article
1
Hide details for Mukhopadhyay, Podelski [Ramakrishnan]Mukhopadhyay, Podelski [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
1
Hide details for Mukhopadhyay, Podelski [Ramanujam, Raman]Mukhopadhyay, Podelski [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
1
Hide details for Müller, Niehren, Podelski [Müller, Niehren, Bidoit, Dauchet]Müller, Niehren, Podelski [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
1
Hide details for Müller, Niehren, Podelski [Müller, Niehren, Smolka]Müller, Niehren, Podelski [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
1
Hide details for Müller, Niehren, Podelski [Müller, Niehren]Müller, Niehren, Podelski [Müller, Niehren]
2000Ordering Constraints over Feature Trees
In: Constraints [5], 7-41
Journal Article
1
Hide details for Naumann [-]Naumann [-]
1997Integration des automatischen Beweisers SPASS in die mathematische Assistenzumgebung OMEGA
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Nielson, Seidl [Seidl]Nielson, Seidl [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
1
Hide details for Nieuwenhuis, Hillenbrand, Riazanov, Voronkov [Nieuwenhuis, Riazanov, Voronkov, Goré, Leitsch, Nipkow]Nieuwenhuis, Hillenbrand, Riazanov, Voronkov [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
1
Hide details for Nivat, Podelski [Nivat]Nivat, Podelski [Nivat]
1997Minimal Ascending and Descending Tree Automata
In: SIAM Journal on Computing [26], 39-58
Journal Article
3
Hide details for Nonnengart [-]Nonnengart [-]
2001Strong SkolemizationUnpublished/Draft
1998Modal Frame Characterization by Way of Auxiliary Modalities
In: Logic Journal of the IGPL [6], 875-899
Journal Article
1995A Resolution-Based Calculus for Temporal Logics
Universität des Saarlandes
Thesis - PhD thesis
1
Hide details for Nonnengart [Bajcsy]Nonnengart [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
1
Hide details for Nonnengart [MacNish, Pearce, Pereira]Nonnengart [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
1
Hide details for Nonnengart [McRobbie, Slaney]Nonnengart [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
1
Hide details for Nonnengart, Ohlbach [Bläsius, Bürckert]Nonnengart, Ohlbach [Bläsius, Bürckert]
1992Modal- und Temporallogik
In: Deduktionssysteme - Automatisierung des logischen Denkens, 239-284
Part of a Book
1
Hide details for Nonnengart, Ohlbach, Gabbay [Ohlbach, Gabbay]Nonnengart, Ohlbach, Gabbay [Ohlbach, Gabbay]
2001Encoding two-valued non-classical logics in classic logic
In: Handbook of Automated Reasoning, 1403-1486
Part of a Book
1
Hide details for Nonnengart, Ohlbach, Szalas [Szalas, Ohlbach]Nonnengart, Ohlbach, Szalas [Szalas, Ohlbach]
2001Quantifier Elimination for Second-Order Predicate LogicUnpublished/Draft
1
Hide details for Nonnengart, Rock, Weidenbach [Rock, Kirchner, Kirchner]Nonnengart, Rock, Weidenbach [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
1
Hide details for Nonnengart, Szalas [Szalas, Orlowska]Nonnengart, Szalas [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
1
Hide details for Nonnengart, Weidenbach [Robinson, Voronkov]Nonnengart, Weidenbach [Robinson, Voronkov]
2001Computing small clause normal forms
In: Handbook of Automated Reasoning, 335-367
Part of a Book
8
Hide details for Ohlbach [-]Ohlbach [-]
1995Boolean Algebras with Functions - Correspondence, Completeness and Quantifier EliminationUnpublished/Draft
1995Clause Killer TransformationsUnpublished/Draft
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
1993Thema der Antrittsvorlesung: Transformation logischer Systeme
Universität des Saarlandes
Thesis - Habilitation thesis
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
1992Logic Engineering: Konstruktion von Logiken
In: KI [3], 34-38
Journal Article
1991Semantics Based Translation Methods for Modal Logics
In: Journal of Logic and Computation [1], 691-746
Journal Article
1988A Resolution Calculus for Modal Logics
Universität Kaiserslautern
Thesis - PhD thesis
1
Hide details for Ohlbach [McRobbie, Slaney]Ohlbach [McRobbie, Slaney]
1996SCAN-Elimination of Predicate Quantifiers
In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), 161-165
Proceedings Article
1
Hide details for Ohlbach [Voronkov]Ohlbach [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
1
Hide details for Ohlbach, Herzig [-]Ohlbach, Herzig [-]
1991Parameter Structures for Parametrized Modal Operators
In: Proc.~Intern.~Joint Conference on Artificial Intelligence (IJCAI'91), 512-517
Proceedings Article
1
Hide details for Ohlbach, Koehler [Koehler]Ohlbach, Koehler [Koehler]
1996Reasoning about Sets via Atomic DecompositionReport
1
Hide details for Ohlbach, Schmidt [-]Ohlbach, Schmidt [-]
1997Functional Translation and Second-Order Frame Properties of Modal Logics
In: Journal of Logic and Computation [7], 581-603
Journal Article
1
Hide details for Ohlbach, Schmidt, Hustadt [Borgida, Lenzerini, Nardi, Nebel]Ohlbach, Schmidt, Hustadt [Borgida, Lenzerini, Nardi, Nebel]
1995Symbolic Arithmetical Reasoning with Qualified Number Restrictions
In: Proceedings of International Workshop on Description Logics'95, 89-95
Proceedings Article
1
Hide details for Ohlbach, Schmidt, Hustadt [Wansing]Ohlbach, Schmidt, Hustadt [Wansing]
1996Translating Graded Modalities into Predicate Logic
In: Proof Theory of Modal Logic, 253-291
Part of a Book
1
Hide details for Ohlbach, Siekmann [-]Ohlbach, Siekmann [-]
1991The Markgraf Karl Refutation Procedure
In: Computational Logic, Essays in Honor of Alan Robinson, 41-112
Proceedings Article
1
Hide details for Ohlbach, Weidenbach [-]Ohlbach, Weidenbach [-]
1995A Note on Assumptions about Skolem Functions
In: Journal of Automated Reasoning [15], 267-275
Journal Article
1
Hide details for Pacholski, Podelski [Pacholski, Smolka]Pacholski, Podelski [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
1
Hide details for Piskac [-]Piskac [-]
2005Formal Correctness of Result Checking for Priority Queues
Universität des Saarlandes
Thesis - Masters thesis
2
Hide details for Plaisted [-]Plaisted [-]
1994The Search Efficiency of Theorem Proving Strategies
In: Proceedings of the 12th International Conference on Automated Deduction (CADE-12), 57-71
Proceedings Article
1993Equational Reasoning and Term Rewriting Systems
In: Handbook of Logic in Artificial Intelligence and Logic Programming, 273-364
Proceedings Article
1
Hide details for Pnueli, Podelski, Rybalchenko [Pnueli, Halbwachs, Zuck]Pnueli, Podelski, Rybalchenko [Pnueli, 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
1
Hide details for Podelski (ed.) [-]Podelski (ed.) [-]
1995Constraint Programming: Basics and Trends
In: Constraint Programming: Basics and Trends, 328
Proceedings
2
Hide details for Podelski [-]Podelski [-]
1998Thema der Antrittsvorlesung: Alte Resultate aus der Automatentheorie
Universität des Saarlandes
Thesis - Habilitation thesis
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
1
Hide details for Podelski [Leuschel]Podelski [Leuschel]
2004Introduction to the Special Issue on Verification and Computational Logic
In: Theory and Practice of Logic Programming (TPLP) [4], 541-751
Journal Article
1
Hide details for Podelski [Palsberg]Podelski [Palsberg]
2000Model Checking as Constraint Solving
In: Proceedings of the 7th International Symposium on Static Analysis (SAS-00), 221-237
Proceedings Article
1
Hide details for Podelski [Zuck, Attie, Cortesi, Mukhopadhyay]Podelski [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
1
Hide details for Podelski, Ball, Rajamani [Ball, Rajamani, Ball, Rajamani]Podelski, Ball, Rajamani [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
1
Hide details for Podelski, Ball, Rajamani [Ball, Rajamani, Kaoen, Stevens]Podelski, Ball, Rajamani [Ball, Rajamani, 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
1
Hide details for Podelski, Charatonik, Müller [Müller, Swierstra]Podelski, Charatonik, Müller [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
2
Hide details for Podelski, Rybalchenko [-]Podelski, Rybalchenko [-]
2007Transition Predicate Abstraction and Fair Termination
In: ACM Transactions on Programming Languages and Systems [29], 30
Journal Article
2004Transition Invariants
In: Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, LICS 2004, 32-41
Proceedings Article
1
Hide details for Podelski, Rybalchenko [Levi, Steffen]Podelski, Rybalchenko [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
1
Hide details for Podelski, Rybalchenko [Palsberg, Abadi]Podelski, Rybalchenko [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
1
Hide details for Podelski, Rybalchenko [Podelski]Podelski, Rybalchenko [Podelski]
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
1
Hide details for Podelski, Rybalchenko, Cook [Cook]Podelski, Rybalchenko, Cook [Cook]
2005Counterexample-Guided Abstraction Refinement for TerminationUnpublished/Draft
1
Hide details for Podelski, Schaefer, Wagner [-]Podelski, Schaefer, Wagner [-]
2004Attachment IconSummaries for While Programs with RecursionReport
1
Hide details for Podelski, Schaefer, Wagner [Sagiv]Podelski, Schaefer, Wagner [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
2
Hide details for Podelski, Smolka [-]Podelski, Smolka [-]
1995Operational Semantics of Constraint Logic Programming with Coroutining
In: Proceedings of the 12th International Conference on Logic Programming, 449-463
Proceedings Article
1995Situated Simplification
In: Proceedings of the First International Conference on Principles and Practice of Constraint Programming (CP'95), 328-344
Proceedings Article
1
Hide details for Podelski, Smolka [Smolka]Podelski, Smolka [Smolka]
1997Situated Simplification
In: Theoretical Computer Science [173], 235-252
Journal Article
1
Hide details for Podelski, Wagner [Hespanha, Tiwari]Podelski, Wagner [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
2
Hide details for Podelski, Wagner [Podelski]Podelski, Wagner [Podelski]
2007Attachment IconA Method and a Tool for Automatic Verification of Region Stability for Hybrid SystemsReport
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
1
Hide details for Podelski, Wies [Hankin, Siveroni]Podelski, Wies [Hankin, Siveroni]
2005Boolean Heaps
In: Static analysis : 12th International Symposium, SAS 2005, 268-283
Proceedings Article
1
Hide details for Prevosto [Coquand, Lombardi, Roy]Prevosto [Coquand, Lombardi, Roy]
2006Certified mathematical hierarchies: the FoCal system.
In: Proceedings of the MAP (Mathematics, Algorithms, Proofs) Workshop,
Electronic Proceedings Article
1
Hide details for Prevosto, Boulmé [Boulmé, Urzyczyn]Prevosto, Boulmé [Boulmé, Urzyczyn]
2005Proof Contexts with Late Binding
In: Typed Lambda Calculi and Applications: 7th International Conference, TLCA 2005, 325-339
Proceedings Article
1
Hide details for Prevosto, Waldmann [Prevosto, Sutcliffe, Schmidt, Schulz]Prevosto, Waldmann [Prevosto, Sutcliffe, Schmidt, Schulz]
2006SPASS+T
In: ESCoR: FLoC'06 Workshop on Empirically Successful Computerized Reasoning, 18-33
Proceedings Article
1
Hide details for Rahman, Rückert, Fischmann [Rahman, Rückert]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
2
Hide details for Ratschan [-]Ratschan [-]
2006Efficient Solving of Quantified Inequality Constraints over the Real Numbers
In: ACM Transactions on Computational Logic [7], 723-748
Journal Article
2004Convergent Approximate Solving of First-order Constraints by Approximate Quantifiers
In: ACM Transactions on Computational Logic [5], 264-281
Journal Article
1
Hide details for Ratschan [Dolzmann, Seidl, Sturm]Ratschan [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
1
Hide details for Ratschan [Rossi]Ratschan [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
2
Hide details for Ratschan, She [-]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
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
1
Hide details for Ratschan, She [Calmet, Ida, Wang]Ratschan, She [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
1
Hide details for Ratschan, Smaus [Smaus, Cassandras, Giua, Seatzu, Zaytoon]Ratschan, Smaus [Smaus, 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
1
Show details for Ratschan, Vehi [Bittanti]Ratschan, Vehi [Bittanti]

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