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: 4. BibTeX Citation Keys

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

BibTeX cite keyAuthor/EditorYearTitleType
Abdu95Ayari, Abdelwaheb1995Attachment IconA Reinterpretation of the Deductive Tableaux System in Higher-Order Logic
Universität des Saarlandes
Thesis - Masters thesis
AbduBasin-TACAS96Ayari, Abdelwaheb
Basin, David A.
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
AfshordelHillenbrandWeidenbach01Afshordel, Bijan
Hillenbrand, Thomas
Weidenbach, Christoph
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
Althaus-Diplom98Althaus, Ernst1998Berechnung optimaler Steinerbäume in der Ebene
Universität des Saarlandes
Thesis - Masters thesis
AmadioCharatonik2002Charatonik, Witold
Amadio, Roberto
2002On Name Generation and Set-Based Analysis in the Dolev-Yao Model
In: CONCUR 2002 - Concurrency Theory. 13th International Conference, 499-514
Proceedings Article
Anderson&BasinAnderson, Penny
Basin, David A.
1995Deriving and Applying Logic Program Transformers
In: Algorithms, Concurrency and Knowledge (1995 Asian Computing Science Conference), 301-318
Proceedings Article
AntoyEchahedHanus94aAntoy, Sergio
Echahed, Rachid
Hanus, Michael
1994A Needed Narrowing Strategy
In: Proceedings of the 21st ACM Symposium on Principles of Programming Languages (POPL'94), 268-279
Proceedings Article
ArecesRijkeNivelle02Areces, Carlos
de Rijke, Maarten
de Nivelle, Hans
2001Resolution in modal, description and hybrid logic
In: Journal of Logic and Computation [11], 717-736
Journal Article
ArgonEtAlSofSem2001Argon, Pablo
Delzanno, Giorgio
Mukhopadhyay, Supratik
Podelski, Andreas
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
AutexierDipl96Autexier, Serge1996Heuristiken zum Beweisen von Gleichungen
Universität des Saarlandes
Thesis - Masters thesis
AvenhausHillenbrandLoechner2003Avenhaus, Jürgen
Hillenbrand, Thomas
Löchner, Bernd
2003Attachment IconOn Using Ground Joinable Equations in Equational Theorem Proving
In: Journal of Symbolic Computation [36], 217-233
Journal Article
AyariBasin2001Ayari, Abdelwaheb
Basin, David A.
2001A Higher-order Interpretation of Deductive Tableau
In: Journal of Symbolic Computation [31], 487-520
Journal Article
BaaderOhlbach95Baader, Franz
Ohlbach, Hans Jürgen
1995A Multi-Dimensional Terminological Knowledge Representation Language
In: Journal of Applied Non-Classical Logics [5], 153-198
Journal Article
Bach96Bach, Alexander1996Attachment IconStatic analysis of functional programs via Linear Logic
Universität des Saarlandes
Thesis - Masters thesis
Bachmair-et-al-92-cadeBachmair, Leo
Ganzinger, Harald
Lynch, Christopher
Snyder, Wayne
1992Basic Paramodulation and Superposition
In: Proceedings of the 11th International Conference on Automated Deduction (CADE-11), 462-476
Proceedings Article
Bachmair-et-al-95-icBachmair, Leo
Ganzinger, Harald
Lynch, Christopher
Snyder, Wayne
1995Basic Paramodulation
In: Information and Computation [121], 172-192
Journal Article
BachmairGanzinger-01-harBachmair, Leo
Ganzinger, Harald
2001Attachment IconResolution Theorem Proving
In: Handbook of Automated Reasoning, 19-99
Part of a Book
BachmairGanzinger-91-ctrsBachmair, Leo
Ganzinger, Harald
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
BachmairGanzinger-91-iclpBachmair, Leo
Ganzinger, Harald
1991Perfect model semantics for logic programs with equality
In: Proceedings International Conference on Logic Programming '91, 645-659
Proceedings Article
BachmairGanzinger-92-lparBachmair, Leo
Ganzinger, Harald
1992Non-Clausal Resolution and Superposition with Selection and Redundancy Criteria
In: Logic Programming and Automated Reasoning, 273-284
Proceedings Article
BachmairGanzinger-94-cadeBachmair, Leo
Ganzinger, Harald
1994Ordered Chaining for Total Orderings
In: Proceedings of the 12th International Conference on Automated Deduction (CADE-12), 435-450
Proceedings Article
BachmairGanzinger-94-cclBachmair, Leo
Ganzinger, Harald
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
BachmairGanzinger-94-jlcBachmair, Leo
Ganzinger, Harald
1994Rewrite-based equational theorem proving with selection and simplification
In: Journal of Logic and Computation [4], 217-247
Journal Article
BachmairGanzinger-94-licsBachmair, Leo
Ganzinger, Harald
1994Rewrite Techniques for Transitive Relations
In: Proceedings of the 9th IEEE Symposium on Logic in Computer Science, 384-393
Proceedings Article
BachmairGanzinger-95-ctrsBachmair, Leo
Ganzinger, Harald
1995Associative-Commutative Superposition
In: Proceedings of the 4th International Workshop on Conditional and Typed Rewrite Systems (CTRS-94), 1-14
Proceedings Article
BachmairGanzinger-98-cadeBachmair, Leo
Ganzinger, Harald
1998Strict Basic Superposition
In: Proceedings of the 15th International Conference on Automated Deduction (CADE-98), 160-174
Proceedings Article
BachmairGanzinger-98-jacmBachmair, Leo
Ganzinger, Harald
1998Ordered Chaining Calculi for First-Order Theories of Transitive Relations
In: Journal of the ACM [45], 1007-1049
Journal Article
BachmairGanzinger-98-sppdBachmair, Leo
Ganzinger, Harald
1998Equational Reasoning in Saturation-Based Theorem Proving
In: Automated Deduction: A Basis for Applications, 353-397
Part of a Book
BachmairGanzingerStuber-95-compassBachmair, Leo
Ganzinger, Harald
Stuber, Jürgen
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
BachmairGanzingerVoronkov-98-cadeBachmair, Leo
Ganzinger, Harald
Voronkov, Andrei
1998Elimination of Equality via Transformation with Ordering Constraints
In: Proceedings of the 15th International Conference on Automated Deduction (CADE-98), 175-190
Proceedings Article
BachmairGanzingerWaldmann-92-alpBachmair, Leo
Ganzinger, Harald
Waldmann, Uwe
1992Theorem proving for hierarchic first-order theories
In: Algebraic and Logic Programming, 420-434
Proceedings Article
BachmairGanzingerWaldmann-93-kgsBachmair, Leo
Ganzinger, Harald
Waldmann, Uwe
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
BachmairGanzingerWaldmann-93-licsBachmair, Leo
Ganzinger, Harald
Waldmann, Uwe
1993Set Constraints are the Monadic Class
In: Eighth Annual IEEE Symposium on Logic in Computer Science, 75-83
Proceedings Article
BachmairGanzingerWaldmann-94-aaeccBachmair, Leo
Ganzinger, Harald
Waldmann, Uwe
1994Refutational Theorem Proving for Hierarchic First-Order Theories
In: Applicable Algebra in Engineering, Communication and Computing (AAECC) [5], 193-212
Journal Article
BackesDiss2005Backes, Werner2005Programmanalyse des XRTL Zwischencodes
Universität des Saarlandes
Thesis - PhD thesis
BallPodelskiRajamaniTACAS2000Ball, Thomas
Podelski, Andreas
Rajamani, Sriram K.
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
BarnettBasinHesketh92aBarnett, Richard
Basin, David A.
Hesketh, Jane
1993A Recursion Planning Analysis of Inductive Completion
In: Annals of Mathematics and Artificial Intelligence [8], 363-381
Journal Article
Barth-95bBarth, Peter1995Logic-based 0-1 constraint programmingBook
Barth-DissBarth, Peter1995Logic-based 0-1 Constraint Solving in Constraint Logic Programming
Fachbereich Informatik, Universität des Saarlandes, Germany
Thesis - PhD thesis
Barth93bBarth, Peter1993Linear 0-1 Inequalities and Extended Clauses
In: Proceedings~4th International~Conference on Logic Programming and Automated Reasoning LPAR '93, 40-51
Proceedings Article
Barth93cBarth, Peter1993A Complete Symbolic 0-1 Constraint Solver
In: 3rd Workshop on Constraint Logic Programming (WCLP '93), ?
Proceedings Article
Barth94aBarth, Peter1994Simplifying Clausal Satisfiability Problems
In: Proceedings of the 1st International Conference on Constraints in Computational Logics (CCL'94), 19-33
Proceedings Article
BarthBockmayr-ICLP95Barth, Peter
Bockmayr, Alexander
1995Finite domain and cutting plane techniques in CLP($\cal PB$)
In: Proceedings of the Twelfth International Conference on Logic Programming, 133-147
Proceedings Article
BarthBockmayr93aBarth, Peter
Bockmayr, Alexander
1993Solving 0-1 Problems in CLP($\cal PB$)
In: Proceedings 9th Conference on Artificial Intelligence for Applications (CAIA), 263-269
Proceedings Article
BarthBockmayr94Barth, Peter
Bockmayr, Alexander
1994Global Consistency in CLP($\cal PB$)
In: Proceedings of the 10th Workshop Logic Programming WLP'94, 4
Proceedings Article
BarthBockmayr95eBarth, Peter
Bockmayr, Alexander
1995Pseudo-Boolean Constraint Logic Programming
In: Computational Logic. The Newsletter of the European Network in Computational Logic [2], 52-53
Journal Article
BarthBockmayr96aBarth, Peter
Bockmayr, Alexander
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
BarthBockmayr97aBarth, Peter
Bockmayr, Alexander
1997PLAM: ProLog and Algebraic Modelling
In: Proceedings of the 5th International Conference on the Practical Application of Prolog, 73-82
Proceedings Article
BarthBockmayr98Barth, Peter
Bockmayr, Alexander
1998Modelling Discrete Optimisation Problems in Constraint Logic Programming
In: Annals of Operations Research [81], 467-496
Journal Article
Basin90bBasin, David A.
Kaufmann, Matt
1991The Boyer-Moore Prover and Nuprl: An Experimental Comparison
In: Logical Frameworks, 90-119
Proceedings Article
Basin91aBasin, David A.
Howe, D.
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
Basin91bBasin, David A.
Giunchiglia, Fausto
Traverso, P.
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
Basin91cBasin, David A.
Brown, G. M.
Leeser, M. E.
1991Formally Verified Synthesis of Combinational CMOS Circuits
In: Integration: The Intern. Journal of VLSI Design [11], 235-250
Journal Article
Basin92aBasin, David A.
Walsh, Toby
1992Difference Matching
In: Proceedings of the11th International Conference on Automated Deduction (CADE-11), 295-309
Proceedings Article
Basin93aBasin, David A.
Constable, Robert L.
1993Metalogical Frameworks
In: Logical Environments, 1-29
Part of a Book
Basin93dBasin, David A.1994IsaWhelk: Whelk Interpreted in Isabelle
In: Proceedings of the 11th International Conference on Logic Programming (ICLP'94), 741-741
Proceedings Article
Basin94aBasin, David A.
Walsh, Toby
1994Termination Orderings for Rippling
In: Proceedings of the 12th International Conference On Automated Deduction (CADE-12), 466-483
Proceedings Article
Basin94cBasin, David A.1994A Term Equality Problem Equivalent to Graph Isomorphism
In: Information Processing Letters [51], 61-66
Journal Article
Basin96cBasin, David A.
Matthews, Seán
Viganò, Luca
1996A Topography of Labelled Modal Logics
In: Frontiers of Combining Systems (First International Workshop, Munich, March 1996), 75-92
Part of a Book
Basin96dBasin, David A.
Matthews, Seán
Viganò, Luca
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
Basin96xKraan, Ina
Basin, David A.
Bundy, Alan
1996Middle-Out Reasoning for Synthesis and Induction
In: Automated mathematical induction, 113-145
Part of a Book
Basin96yBasin, David A.
Walsh, Toby
1996A Calculus for and Termination of Rippling
In: Automated mathematical induction, 147-180
Part of a Book
Basin97aBasin, David A.
Matthews, Seán
Viganò, Luca
1997Labelled Propositional Modal Logics: Theory and Practice
In: Journal of Logic and Computation [7], 685-717
Journal Article
Basin97bBasin, David A.
Matthews, Seán
Viganò, Luca
1998Labelled Modal Logics: quantifiers
In: Journal of Logic, Language and Information [7], 237-263
Journal Article
Basin97cBasin, David A.
Matthews, Seán
Viganò, Luca
1998Natural Deduction for Non-Classical Logics
In: Studia Logica [60], 119-160
Journal Article
Basin97dBasin, David A.
Matthews, Seán
Viganò, Luca
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
Basin98aBasin, David A.
Matthews, Seán
Viganò, Luca
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
BasinAbdu95Ayari, Abdelwaheb
Basin, David A.
1995Interpretation of the Deductive Tableau in HOL
In: Proceedings of the First Isabelle Users Workshop, 91-100
Proceedings Article
BasinAnderson00Anderson, Penny
Basin, David A.
2000Program Development Schemata as Derived Rules
In: Journal of Symbolic Computation [30], 5-36
Journal Article
BasinBundyKraanMatthews93cBasin, David A.
Bundy, Alan
Kraan, Ina
Matthews, Seán
1993A Framework for Program Development Based on Schematic Proof
In: Proc. 7th Intern.~Workshop on Software Specification and Design, 162-171
Proceedings Article
BasinFriedrich96Basin, David A.
Friedrich, Stefan
1996Modeling a hardware synthesis methodology in Isabelle
In: Theorem Proving in Higher Order Logics. 9th International Conference, TPHOLs'96, 33-50
Proceedings Article
BasinFriedrichVeritasBasin, David A.
Friedrich, Stefan
1999Modeling a Hardware Synthesis Methodology in Isabelle
In: Formal Methods in Systems Design [15], 99-122
Journal Article
BasinGanzinger-01-jacmBasin, David A.
Ganzinger, Harald
2001Attachment IconAutomated Complexity Analysis Based on Ordered Resolution
In: Journal of the ACM [48], 70-109
Journal Article
BasinGanzinger96aBasin, David A.
Ganzinger, Harald
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
BasinHabil1995Basin, David A.1995Thema der Antrittsvorlesung: MONA - Ein Werkzeug zur Systemverifikation und -entwicklung
Universität des Saarlandes
Thesis - Habilitation thesis
BasinKlarlund95Basin, David A.
Klarlund, Nils
1995Hardware Verification using Monadic Second-Order Logic
In: Proceedings of the 7th International Conference on Computer-Aided Verification (CAV '95), 31-41
Proceedings Article
BasinKlarlund98Basin, David A.
Klarlund, Nils
1998Automata Based Symbolic Reasoning in Hardware Verification
In: Formal Methods in Systems Design [13], 255-288
Journal Article
BasinLOPSTR94Basin, David A.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
BasinMatthews93dBasin, David A.
Matthews, Seán
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
BasinMatthews96aBasin, David A.
Matthews, Seán
1996Adding Metatheoretic facilities to First-order Theories
In: Journal of Logic and Computation [6], 835-849
Journal Article
BasinMatthews96bBasin, David A.
Matthews, Seán
1996Structuring metatheory on inductive definitions
In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), 171-185
Proceedings Article
BasinMatthews98aMatthews, Seán
Basin, David A.
2000Structuring Metatheory on Inductive Definitions
In: Information and Computation [162], 80-95
Journal Article
BasinMatthews98bMatthews, Seán
Basin, David A.
1998Scoped Metatheorems
In: Electronic Notes in Computer Science [15], 1-14
Journal Article
BasinMatthewsHPLBasin, David A.
Matthews, Sean
2002Logical Frameworks
In: Handbook of Philosophical Logic, 89-164
Part of a Book
BasinMatthewsVigano97cBasin, David A.
Matthews, Seán
Viganò, Luca
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
BasinMetaBasin, Giunchiglia, Kaufmann (ed.)1994Proceedings of the Workshop on Correctness and Metatheoretic Extensibility of Automated Reasoning SystemsReport
BasinTTRewriteBasin, David A.1994Generalized Rewriting in Type Theory
In: Journal of Information Processing and Cybernetics [30], 249-259
Journal Article
BasinWalsh93bBasin, David A.
Walsh, Toby
1993Difference Unification
In: Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI-93), 116-122
Proceedings Article
BasinWalshJAR96Basin, David A.
Walsh, Toby
1996A Calculus for and Termination of Rippling
In: Journal of Automated Reasoning [16], 147-180
Journal Article
Baumeister1990Baumeister, Hubert1990Attachment IconÜber die Stabilität parameterisierter algebraischer Spezifikationen
Universität Dortmund
Thesis - Masters thesis
Baumeister91aBaumeister, Hubert1991Unifying 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
Baumeister95Baumeister, Hubert1995Relations 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
BaumeisterDiss99Baumeister, Hubert1999Attachment IconRelations between Abstract Datatypes modeled as Abstract Datatypes
Universität des Saarlandes
Thesis - PhD thesis
BaumgartnerSuchanek2005Baumgartner, Peter
Suchanek, Fabian
2005Attachment IconModel-Generation Theorem Proving for First-Order Logic OntologiesUnpublished/Draft
Baumgartner:Burchardt:LPFrameNet:JELIA:2004Baumgartner, Peter
Burchardt, Aljoscha
2004Logic Programming Infrastructure for Inferences on FrameNet
In: Logics in artificial intelligence : 9th European Conference, JELIA 2004, 591-603
Proceedings Article
Baumgartner:etal:AR-KR-Management:KI:2005Baumgartner, Peter
Furbach, Ulrich
Yahya, Adnan
2005Automated Reasoning, Knowledge Representation and Management
In: KI - Künstliche Intelligenz [1], 5-11
Journal Article
Baumgartner:etal:Darwin:ESFOR:2004Baumgartner, Peter
Fuchs, Alexander
Tinelli, Cesare
2004Darwin: A Theorem Prover for the Model Evolution Calculus
In: Proceedings of the 1st Workshop on Empirically Successful First Order Reasoning (ESFOR'04), 1-24
Proceedings Article
Baumgartner:etal:Darwin:IJAIT:2006Baumgartner, Peter
Fuchs, Alexander
Tinelli, Cesare
2006Implementing the Model Evolution Calculus
In: International Journal on Artificial Intelligence Tools [15], 21-52
Journal Article
Baumgartner:etal:in2math:swtechnik:2004Baumgartner, Peter
Grabowski, Barbara
Oevel, Walter
Melis, Erica
2004In2Math - Interaktive Mathematik- und Informatikgrundausbildung
In: Softwaretechnik-Trends [24], 36-45
Journal Article
Baumgartner:EtAl:LivingBook:JAR:2004Baumgartner, Peter
Furbach, Ulrich
Gross-Hardt, Margret
Sinner, Alex
2004Living Book -- Deduction, Slicing, and Interaction
In: Journal of Automated Reasoning [32], 259-286
Journal Article
Baumgartner:etal:ModelBasedSchemaReasoning:KI:2004Baumgartner, Peter
Furbach, Ulrich
Gross-Hardt, Margret
Kleemann, Thomas
2004Model Based Deduction for Database Schema Reasoning
In: KI 2004: Advances in Artificial Intelligence: 27th Annual German Conference on AI, KI 2004, 168-182
Proceedings Article
Baumgartner:Furbach:LivingBooksStrangeThings:JS60:2004Baumgartner, Peter
Furbach, Ulrich
2005Living Books, Automated Deduction and other Strange Things
In: Mechanizing Mathematical Reasoning: Techniques, Tools and Applications - Essays in honour of Jörg H. Siekmann, 255-274
Part of a Book
Baumgartner:Mediratta:ASPPlanningBidirectional:KBCS:2004Baumgartner, Peter
Mediratta, Anupam
2004Improving Stable Models Based Planning by Bidirectional Search
In: Proceedings of the 5th International Conference on Knowledge Based Computer Systems (KBCS 2004), 404-413
Proceedings Article
Baumgartner:Tinelli:ModelEvolutionCalculusEquality:CADE:2005Baumgartner, Peter
Tinelli, Cesare
2005The Model Evolution Calculus with Equality
In: Automated deduction - CADE-20 : 20th International Conference on Automated Deduction, 392-408
Proceedings Article
BaWe2000aBackes, Werner
Wetzel, Susanne
2000New Results on Lattice Basis Reduction in Practice
In: Proceedings of the 4th International Algorithmic Number Theory Symposium (ANTS-IV), 135-152
Proceedings Article
BaWe2000bBackes, Werner
Wetzel, Susanne
2001Lattice Basis Reduction with Dynamic Approximation
In: Proceedings of the 4th Workshop On Algorithm Engineering (WAE-2000), 63-73
Proceedings Article
BE2001Bockmayr, Alexander
Eisenbrand, Friedrich
2001Cutting planes and the elementary closure in fixed dimension
In: Mathematics of Operations Research [26], 304-312
Journal Article
BE98Buchmann, Johannes
Eisenbrand, Friedrich
1999On Factor Refinement in Number Fields
In: Mathematics of Computation [68], 345-350
Journal Article
Becker94Becker, Joachim1994Attachment IconEffiziente Subsumption in Deduktionssystemen
Universität des Saarlandes
Thesis - Masters thesis
BEHS98Bockmayr, Alexander
Eisenbrand, Friedrich
Hartmann, Mark
Schulz, Andreas S.
1999On the Chvátal Rank of Polytopes in the 0/1 Cube
In: Discrete Applied Mathematics [98], 21-27
Journal Article
BenAmramLee2007Ben-Amram, Amir M.
Lee, Chin Soon
2007Program termination analysis in polynomial time
In: ACM Transactions on Programming Languages and Systems [29], 5:1-37
Journal Article
Bertling-et-al-93Bertling, Hubert
Ganzinger, Harald
Schäfers, Renate
Nieuwenhuis, Robert
Orejas, Fernando
1993Completion Subsystem
In: Program Development by Specification and Transformation, The PROSPECTRA Methodology, Language Family, and System, 460-494
Part of a Book
BlanchetPodelski2005Blanchet, Bruno
Podelski, Andreas
2005Verification of Cryptographic Protocols: Tagging Enforces Termination
In: Theoretical Computer Science [333], 67-90
Journal Article
Bockmayr92aBockmayr, Alexander1992Algebraic and Logical Aspects of Unification
In: Proc.~1st Workshop on Word Equations and Related Topics, 171-180
Proceedings Article
Bockmayr92bBockmayr, Alexander1992Model-Theoretic Aspects of Unification
In: Proceedings of the 1st Workshop on Word Equations and Related Topics, 181-196
Proceedings Article
Bockmayr92cBockmayr, Alexander1992A Theoretical Basis for Constraint Logic and Functional Programming
In: Proc.~1st African Conference on Research in Computer Science, 793-804
Proceedings Article
Bockmayr93aBockmayr, Alexander1993Embedding OR Techniques in Constraint Logic Programming
In: Operations Research '92. 17th Symposium on Operations Research, 252-254
Proceedings Article
Bockmayr93bBockmayr, Alexander1993Logic Programming with Pseudo-Boolean Constraints
In: Constraint Logic Programming---Selected Research, 327-350
Proceedings Article
Bockmayr93cBockmayr, Alexander1993Conditional Narrowing Modulo a Set of Equations
In: Applicable Algebra in Engineering, Communication and Computing [4], 147-168
Journal Article
Bockmayr93dBockmayr, Alexander1994Using Strong Cutting Planes in Constraint Logic Programming (Extended Abstract)
In: Operations Research '93, 18th Symposium on Operations Research, 47-49
Proceedings Article
Bockmayr93hBockmayr, Alexander19930-1 Constraints and 0-1 Optimization
In: 3rd Workshop on Constraint Logic Programming (WCLP '93), ?
Proceedings Article
Bockmayr94cBockmayr, Alexander1994Cutting planes in constraint logic programming (Abstract)
In: Proceedings of the 3rd International Symposium Artificial Intelligence and Mathematics,
Proceedings Article
Bockmayr95aBockmayr, Alexander1995Solving pseudo-Boolean constraints
In: Constraint Programming: Basics and Trends, 22-38
Proceedings Article
Bockmayr96aBockmayr, Alexander1996Constraints in functional logic programming (Abstract)
In: Integration of functional and logic languages, 4
Proceedings Article
BockmayrBarthKasper96Bockmayr, Alexander
Barth, Peter
Kasper, Thomas
1996Methods and Tools for Pseudo-Boolean Problems
In: 2. Workshop Boolesche Probleme, 105-109
Proceedings Article
BockmayrBrzoskaDeussenVarsek91aBockmayr, Alexander
Brzoska, C.
Deussen, P.
Varsek, I.
1991KA-Prolog: Erweiterungen einer logischen Programmiersprache und ihre effiziente Implementierung
In: Informatik--Forschung und Entwicklung [6], 128-140
Journal Article
BockmayrDimopoulos98Bockmayr, Alexander
Dimopoulos, Yannis
1998Mixed Integer Programming Models for Planning Problems
In: Proceedings of the Workshop on Constraint Problem Reformulation (CP-98), 1-6
Proceedings Article
BockmayrEisenbrand2000Eisenbrand, Friedrich
Bockmayr, Alexander
2000Combining logic and optimization in cutting plane theory
In: Proceedings of the Workshop on Frontiers of Combining Systems (FROCOS-2000), 1-17
Proceedings Article
BockmayrKasper96Bockmayr, Alexander
Kasper, Thomas
1996Pseudo-Boolean and Finite Domain Constraint Programming: A Case Study
In: Deklarative Constraint Programmierung, 29-41
Proceedings Article
BockmayrKasper98Bockmayr, Alexander
Kasper, Thomas
1998Branch-and-Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
In: INFORMS Journal on Computing [10], 287-300
Journal Article
BockmayrKrischerWerner94Bockmayr, Alexander
Krischer, Stefan
Werner, Andreas
1995Narrowing strategies for arbitrary canonical systems
In: Fundamenta Informaticae [24], 125-155
Journal Article
BockmayrRadermacher93eBockmayr, Alexander
Radermacher, F. J.
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
BockmayrWeispfenning01Bockmayr, Alexander
Weispfenning, V.
2001Solving numerical constraints
In: Handbook of Automated Reasoning, 751-842
Part of a Book
BockmayrWerner94Bockmayr, Alexander
Werner, Andreas
1995LSE narrowing for decreasing conditional term rewrite systems
In: Conditional Term Rewriting Systems CTRS'94, 51-70
Proceedings Article
bockmayr_habil_96Bockmayr, Alexander1996Gleichheit und Constraints in der Logikprogrammierung
Universität des Saarlandes
Thesis - Habilitation thesis
Booth-janclBooth, Richard2001The lexicographic closure as a revision process
In: Journal of Applied Non-Classical Logics [11], 35-58
Journal Article
Booth2000Booth, Richard2000Attachment IconThe lexicographic closure as a revision process
In: Proceedings of the 8th International Workshop on Non-Monotonic Reasoning (NMR 2000), ?
Electronic Proceedings Article
BozkurtDiplSiek1995Bozkurt, Ahmet1995Strategien für Resolutionsbeweiser in Logik höherer Stufe
Universität des Saarlandes
Thesis - Masters thesis
BP-Fossacs03Blanchet, Bruno
Podelski, Andreas
2003Verification of Cryptographic Protocols: Tagging Enforces Termination
In: Foundations of software science and computation structures : 6th International Conference, FOSSACS 2003, 136-152
Proceedings Article
BPR-STTT03Podelski, Andreas
Ball, Tom
Rajamani, Sriram K.
2003Boolean and Cartesian Abstraction for Model Checking C Programs
In: International Journal on Software Tools for Technology Transfer (STTT) [5], 1-15
Journal Article
BPR-Tacas03Podelski, Andreas
Ball, Tom
Rajamani, Sriram K.
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
BrafmanHoffmann2004Brafman, Ronen
Hoffmann, Jörg
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
Brahm2013Brahm, Uwe2013Möglichkeiten des Groupware-Einsatzes im Umfeld des Wissenschaftlerarbeitsplatzes am Beispiel des Max-Planck-Instituts für Informatik
Universität des Saarlandes
Thesis - Masters thesis
BrahmPitz1990Brahm, Uwe
Pitz, Werner
1990Parkwächter
In: c't Magazin für computer technik [-], 252-253
Journal Article
BrahmPresentation20060912Brahm, Uwe2006Attachment IconEine integrierte Publikationsverwaltung am Beispiel des Max-Planck-Instituts für InformatikMiscellaneous
BrinkBritzSchmidt94Brink, Chris
Britz, Katarina
Schmidt, Renate A.
1994Peirce Algebras
In: Formal Aspects of Computing [6], 339-358
Journal Article
BrinkBritzSchmidt94bBrink, Chris
Britz, Katarina
Schmidt, Renate A.
1994Peirce Algebras: Extended Abstract
In: Proceedings of the 3rd International Conference on Algebraic Methodology and Software Technology (AMAST '93), 163-166
Proceedings Article
Brinker2000Brinker, Christof2000Geometrisches Schließen mit SPASS
Universität des Saarlandes
Thesis - Masters thesis
BrinkGabbayOhlbach94Brink, Chris
Gabbay, Dov M.
Ohlbach, Hans Jürgen
1994Towards Automating Duality
In: Journal of Computers and Mathematics with Applications [29], 73-90
Journal Article
BrinkRewitzkySchmidt91aBrink, Chris
Rewitzky, I. M.
Schmidt, Renate A.
1991Autodescriptivity: Beware!
In: The Computer Journal [34], 380-381
Journal Article
CantuBundySmaillBasin96Cantu, Francisco
Bundy, Alan
Smaill, Alan
Basin, David A.
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
CDGMT01Charatonik, Witold
Dal Zilio, Silvano
Gordon, Andrew Donald
Mukhopadhyay, Supratik
Talbot, Jean-Marc
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
CDGMT2001-techrepCharatonik, Witold
Dal Zilio, Silvano
Gordon, Andrew Donald
Mukhopadhyay, Supratik
Talbot, Jean-Marc
2001The Complexity of Model Checking Mobile AmbientsReport
Charatonik-ESOP00Charatonik, Witold2000Directional Type Checking for Logic Programs: Beyond Discriminative Types
In: Proceedings of the 8th European Symposium on Programming (ESOP-00), 72-87
Proceedings Article
Charatonik-IPL98Charatonik, Witold1998An Undecidable Fragment of the Theory of Set Constraints
In: Information Processing Letters [68], 147-151
Journal Article
Charatonik2002habilCharatonik, Witold2002Direktionale Typen in der Logischen Programmierung
Universität des Saarlandes
Thesis - Habilitation thesis
Charatonik98Charatonik, Witold1998Set Constraints in Some Equational Theories
In: Information and Computation [142], 40-75
Journal Article
CharatonikDGMT2003Charatonik, Witold
Dal Zilio, Silvano
Gordon, Andrew Donald
Mukhopadhyay, Supratik
Talbot, Jean-Marc
2003Model checking mobile ambients
In: Theoretical Computer Science [308], 277-331
Journal Article
CharatonikGeorgievaMaier2005Charatonik, Witold
Georgieva, Lilia
Maier, Patrick
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
CharatonikGT2002Charatonik, Witold
Gordon, Andrew Donald
Talbot, Jean-Marc
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
CharatonikMNPW-LICS98Charatonik, Witold
McAllester, David
Niwinski, Damian
Podelski, Andreas
Walukiewicz, Igor
1998The Horn Mu-calculus
In: Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science (LICS-98), 58-69
Proceedings Article
CharatonikMP2002Charatonik, Witold
Mukhopadhyay, Supratik
Podelski, Andreas
2002Compositional Termination Analysis of Symbolic Forward Analysis
In: Verification, Model Checking, and Abstract Interpretation. Third International Workshop, VMCAI 2002, 109-125
Proceedings Article
CharatonikMP2002aCharatonik, Witold
Mukhopadhyay, Supratik
Podelski, Andreas
2002Constraint-Based Infinite Model Checking and Tabulation for Stratified CLP
In: Logic Programming. 18th International Conference, ICLP 2002, 115-129
Proceedings Article
CharatonikPodelski-cp96Charatonik, Witold
Podelski, Andreas
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
CharatonikPodelski-RTA98Charatonik, Witold
Podelski, Andreas
1998Co-definite Set Constraints
In: Proceedings of the 9th International Conference on Rewriting Techniques and Applications (RTA-98), 211-225
Proceedings Article
CharatonikPodelski-SAS98Charatonik, Witold
Podelski, Andreas
1998Directional Type Inference for Logic Programs
In: Proceedings of the 5th International Symposium in Static Analysis (SAS-98), 278-294
Proceedings Article
CharatonikPodelski-tacas98Charatonik, Witold
Podelski, Andreas
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
CharatonikPodelskiLICS97Charatonik, Witold
Podelski, Andreas
1997Set Constraints with Intersection
In: Proceedings of the Twelfth Annual IEEE Symposium on Logic in Computer Science (LICS-97), 362-372
Proceedings Article
CharatonikPodelskiTalbot-POPL00Charatonik, Witold
Podelski, Andreas
Talbot, Jean-Marc
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
CharatonikTalbot-csl01Charatonik, Witold
Talbot, Jean-Marc
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
CharatonikTalbot2002Charatonik, Witold
Talbot, Jean-Marc
2002Atomic Set Constraints with Projection
In: Rewriting Techniques and Applications. 13th International Conference, RTA 2002, 311-325
Proceedings Article
ChaudhuriDimopoulosZaroliagis-PPL96Chaudhuri, Shiva
Dimopoulos, Yannis
Zaroliagis, Christos
1996On the Parallel Complexity of Acyclic Logic Programs
In: Parallel Processing Letters [6], 223-230
Journal Article
chpl:93cChadha, Ritu
Plaisted, David A.
1993On the mechanical derivation of loop invariants
In: Journal of Symbolic Computation [15], 705-744
Journal Article
chpl:94aChu, Heng
Plaisted, David A.
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
chpl:94bChadha, Ritu
Plaisted, David A.
1994Correctness of unification without occur check in Prolog
In: Journal of Logic Programming [18], 99-122
Journal Article
Christen97Christen, Michael1997Attachment IconA Calculus of Simplification for Superposition
Universität des Saarlandes
Thesis - Masters thesis
CookPodelskiRybal2006Cook, Byron
Podelski, Andreas
Rybalchenko, Andrey
2006Terminator: Beyond Safety
In: Computer aided verification : 18th International Conference, CAV 2006, 415-418
Proceedings Article
CookPodelskiRybalchenkoSAS2005Cook, Byron
Podelski, Andreas
Rybalchenko, Andrey
2005Abstraction-refinement for Termination
In: Static analysis : 12th International Symposium, SAS 2005, 87-101
Proceedings Article
Cortier-et-al-99Cortier, V.
Ganzinger, Harald
Jacquemard, Florent
Veanes, Margus
1999Decidable fragments of simultaneous rigid reachability
In: Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP-99), 250-260
Proceedings Article
CPintersectionJCharatonik, Witold
Podelski, Andreas
2002Set Constraints with Intersection
In: Information and Computation [179], 213-229
Journal Article
CPR05:TerminatorPodelski, Andreas
Rybalchenko, Andrey
Cook, Byron
2005Counterexample-Guided Abstraction Refinement for TerminationUnpublished/Draft
CP:95TCSPodelski, Andreas
Smolka, Gert
1997Situated Simplification
In: Theoretical Computer Science [173], 235-252
Journal Article
CunninghamGabbayOhlbach91aCunningham, J.
Gabbay, Dov M.
Ohlbach, Hans Jürgen
1991Towards the MEDLAR Framework
In: ESPRIT '91 Conference Proceedings, 822-841
Proceedings Article
DammDischHungarPangPigorschSchollWaldmannWirtz2006Damm, Werner
Disch, Stefan
Hungar, Hardi
Pang, Jun
Pigorsch, Florian
Scholl, Christoph
Waldmann, Uwe
Wirtz, Boris
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
DammRatschan2005aDamm, Werner
Pinto, Guilherme
Ratschan, Stefan
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
DelahayeJaumePrevosto2005Delahaye, David
Jaume, Mathieu
Prevosto, Virgile
2005Coq, un outil pour l'enseignement
In: Technique et Science Informatiques [24], 1139-1160
Journal Article
Delzanno1998Delzanno, Giorgio1998Specification of Term Rewriting in Linear Logic
In: Proceedings of Workshop on Proof-Search in Type-Theoretic Languages, ??
Proceedings Article
DelzannoBLM1999Bugliesi, Michele
Delzanno, Giorgio
Liquori, Luigi
Martelli, Maurizio
2000Object Calculi in Linear Logic
In: Journal of Logic and Computation [10], 75-104
Journal Article
DelzannoBMMZ1999Bozzano, Marco
Delzanno, Giorgio
Martelli, Maurizio
Mascardi, Viviana
Zini, Floriano
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
DelzannoBMMZb1999Bozzano, Marco
Delzanno, Giorgio
Martelli, Maurizio
Mascardi, Viviana
Zini, Floriano
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
DelzannoEsparzaPodelski99Delzanno, Giorgio
Esparza, Javier
Podelski, Andreas
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
DelzannoGM1999Delzanno, Giorgio
Galmiche, Didier
Martelli, Maurizio
1999A specification logic for concurrent object-oriented programming
In: Mathematical Structures in Computer Science [9], 253-286
Journal Article
DelzannoRaskinTACAS2000Delzanno, Giorgio
Raskin, Jean-François
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
deNivelle1999directde Nivelle, Hans
Areces, Carlos
de Rijke, Maarten
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
deNivelle2000de Nivelle, Hans2000Deciding the E-plus class by an a posteriori, liftable order
In: Annals of Pure and Applied Logic [88], 219-232
Journal Article
deNivelle2000ade Nivelle, Hans
Bezem, Marc
Hendriks, Dimitri
2000Automated Proof Construction in Type Theory Using Resolution
In: Proceedings of the 17th International Conference on Automated Deduction (CADE-17), 148-163
Proceedings Article
deNivelle2000bde Nivelle, Hans2000An Overview of Resolution Decision Procedures
In: Formalizing the Dynamics of Information, 115-130
Proceedings Article
deNivelle2000cde Nivelle, Hans
Hustadt, Ullrich
Schmidt, Renate A.
2000Resolution-Based Methods for Modal Logics
In: Logic Journal of the IGPL [8], 265-292
Journal Article
deNivelle2001de Nivelle, Hans
Pratt-Hartmann, Ian
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
deNivelle2001lparde Nivelle, Hans2001Splitting 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
deNivelle2001slpde Nivelle, Hans
Blackburn, Patrick
Bos, Johan
Kohlhase, Michael
2001Inference and Computational Semantics
In: Studies in Linguistics and Philosophy, Computing Meaning [77], 11-28
Journal Article
deNivelle2002ade Nivelle, Hans2002Extraction 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
deNivelle2002bBezem, Marc
Hendriks, Dimitri
de Nivelle, Hans
2002Automated Proof Construction in Type Theory using Resolution
In: Journal of Automated Reasoning [29], 253-275
Journal Article
deNivelle2003ade Nivelle, Hans
de Rijke, Maarten
2003Deciding the Guarded Fragments by Resolution
In: Journal of Symbolic Computation [35], 21-58
Journal Article
deNivelle2003bde Nivelle, Hans2003Translation 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
deNivelle2003cde Nivelle, Hans2003Implementing the clausal normal form transformation with proof generation
In: Fourth Workshop on the Implementation of Logics, 69-83
Proceedings Article
deNivelle2005ade Nivelle, Hans2005Translation of Resolution Proofs into Short First-Order Proofs without Choice Axioms
In: Information and Computation [199], 24-54
Journal Article
deNivelle2006aAhrendt, Baumgartner, de Nivelle (ed.)2006IJCAR'06 Workshop : Disproving'06: Non-Theorems, Non-Validity, Non-ProvabilityElectronic Proceedings
deNivelle2006bde Nivelle, Hans
Baumgartner, Peter
Fuchs, Alexander
Tinelli, Cesare
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
deNivelleDemri2003ade Nivelle, Hans
Demri, Stéphane
2003Deciding regular grammar logics with converse through first-order logicReport
deNivelleDemri2003cde Nivelle, Hans
Demri, Stéphane
2003Deciding Modal Logics through Relational Translations into GF2
In: Proceedings of the 3rd Methods for Modalities Workshop, 15-30
Proceedings Article
deNivelleDemri2005de Nivelle, Hans
Demri, Stéphane
2005Deciding Regular Grammar Logics with Converse through First-Order Logic
In: Journal of Logic, Language and Information [14], 289-329
Journal Article
deNivelleMeng2006ade Nivelle, Hans
Meng, Jia
2006Geometric Resolution: A Proof Procedure Based on Finite Model Search
In: Automated reasoning : Third International Joint Conference, IJCAR 2006, 303-317
Proceedings Article
deNivelleMeng2006bde Nivelle, Hans
Meng, Jia
2006Geo 2006jMiscellaneous
DeNivellePiskac2005ade Nivelle, Hans
Piskac, Ruzica
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
deNivelleSchulz2001de Nivelle, Schulz (ed.)2001Proceedings of the 2nd International Workshop on the Implementation of LogicsProceedings
deRJaeLeeMan02de Raedt, Luc
Jaeger, Manfred
Lee, Sau Dan
Mannila, Heikki
2002Attachment IconA Theory of Inductive Query Answering
In: Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM'02), 123-130
Proceedings Article
DGNVV98aDegtyarev, Anatoli
Gurevich, Yuri
Narendran, Paliath
Veanes, Margus
Voronkov, Andrei
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
DGNVV99Degtyarev, Anatoli
Gurevich, Yuri
Narendran, Paliath
Veanes, Margus
Voronkov, Andrei
2000Decidability and Complexity of Simultaneous Rigid E-unification with One Variable and Related Results
In: Theoretical Computer Science [243], 167-184
Journal Article
dim92Dimopoulos, Yannis
Magirou, Vangelis
1994A Graph Theoretic Approach to Default Logic
In: Information and Computation [112], 239-256
Journal Article
dim94aDimopoulos, Yannis1994Classical Methods in Nonmonotonic Reasoning
In: Proceedings of the 8th International Symposium on Methodologies for Intelligent Systems (ISMIS'94), 500-510
Proceedings Article
dim94cDimopoulos, Yannis1994The Computational Value of Joint Consistency
In: Logics in Artificial Intelligence: Proceedings of the JELIA'94, 50-65
Proceedings Article
Dimitrova2006Dimitrova, Rayna2006Model Checking with Abstraction Refinement for Well-Structured Systems
Universität des Saarlandes
Thesis - Masters thesis
Dimopoulos-93-mpii226-2-Dimopoulos, Yannis
Magirou, Vangelis
Papadimitriou, Christos
1993On Kernels, Defaults and Even Graphs
In: Annals of Mathematics and Artificial Intelligence,
Journal Article
DMSSISAMC2005Daum, Matthias
Maus, Stefan
Schirmer, Norbert
Seghir, Mohammed Nassim
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
Domopoulos96Dimopoulos, Yannis1996On Computing Logic Programs
In: Journal of Automated Reasoning [17], 259-289
Journal Article
DomshlakHoffmann2006Domshlak, Carmel
Hoffmann, Jörg
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
DP-STTT01Delzanno, Giorgio
Podelski, Andreas
2001Constraint-based Deductive Model Checking
In: International Journal on Software Tools for Technology Transfer (STTT) [3], 250-270
Journal Article
Eisenbrand1999Eisenbrand, Friedrich1999On the Membership Problem for the Elementary Closure of a Polyhedron
In: Combinatorica [19], 297-300
Journal Article
Eisenbrand2000Eisenbrand, Friedrich2000Gomory-Chvátal Cutting planes and the Elementary Closure of Polyhedra
Universität des Saarlandes
Thesis - PhD thesis
Eisenbrand2001Eisenbrand, Friedrich2001Short vectors of planar integral lattices via continued fractions
In: Information Processing Letters [79], 121-126
Journal Article
EisenSchulz1999Eisenbrand, Friedrich
Schulz, Andreas S.
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
EisingerNonnengartPraecklein92Eisinger, Norbert
Nonnengart, Andreas
Präcklein, Axel
1992Termersetzungssysteme
In: Deduktionssysteme -- Automatisierung des logischen Denkens, 126-149
Part of a Book
EisingerOhlbach93Eisinger, Norbert
Ohlbach, Hans Jürgen
1993Deduction Systems Based on Resolution
In: Handbook of Logic in Artificial Intelligence and Logic Programming, 184-271
Proceedings Article
EisingerOhlbachPraecklein91aEisinger, Norbert
Ohlbach, Hans Jürgen
Präcklein, Axel
1991Reduction Rules for Resolution Based Systems
In: Artificial Intelligence [50], 141-181
Journal Article
Engel96Engel, Thorsten1996Attachment IconQuantifier Elimination in Second-Order Predicate Logic
Universität des Saarlandes
Thesis - Masters thesis
ER2001Eisenbrand, Friedrich
Rote, Günter
2001Fast 2-variable integer programming
In: Proceedings of the 8th Conference on Integer and Combinatorial Optimization (IPCO-01), 78-89
Proceedings Article
ER2001bEisenbrand, Friedrich
Rote, Günter
2001Fast reduction of ternary quadratic forms
In: Proceedings of the 1st Conference on Lattices and Cryptography (CaLC-01), 99-111
Proceedings Article
ERV02Eisenbrand, Friedrich
Rinaldi, Giovanni
Ventura, Paolo
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
EsparzaPodelskiPOPL00Esparza, Javier
Podelski, Andreas
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
Fehrer93aFehrer, Detlef1993A Unifying Framework for Reason Maintenance
In: Symbolic and Quantitative Approaches to Reasoning and Uncertainty: Proceedings European Conference ECSQARU '93, 113-120
Proceedings Article
Fehrer94aFehrer, Detlef1994A Unifying Logical Framework for Reason Maintenance (Deliverable DI.1.2-3P)
In: Medlar II Report PPR2, 47-55
Proceedings Article
FehrerDiss1995Fehrer, Detlef1995A unifying logical framework for reason maintenance
Universität des Saarlandes
Thesis - PhD thesis
Fehreretal94aFehrer, Detlef
Hustadt, Ullrich
Jaeger, Manfred
Nonnengart, Andreas
Ohlbach, Hans Jürgen
Schmidt, Renate A.
Weidenbach, Christoph
Weydert, Emil
1994Description Logics for Natural Language Processing
In: International Workshop on Description Logics '94, 80-84
Proceedings Article
firozabadhi:ecai98Firozabadhi, Babak Sadighi
van der Torre, Leendert W. N.
1998Towards a formal analysis of control systems
In: Proceedings of the 13th European Conference on Artificial Intelligence (ECAI-98), 317-318
Proceedings Article
fischm00aRahman, Shahid
Rückert, Helge
Fischmann, Matthias
1997Dialogues and Ontology, the Dialogical Approach to Free Logic
In: Logique et Analyse [160], 357-374
Journal Article
Fischmann-Diplom99Fischmann, Matthias1999On Applications of Decidable Object-Oriented Type Theory
Universität des Saarlandes
Thesis - Masters thesis
FrankBasin-98Frank, Ian
Basin, David A.
1998Search in Games with Incomplete Information: A Case Study Using Bridge Card Play
In: Artificial Intelligence [100], 87-123
Journal Article
FrankBasinBundy92aFrank, Ian
Basin, David A.
Bundy, Alan
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
Freiheit2005Freiheit, Jörn
Luuk, Marc
Münch, Susanne
Sijanski, Grozdana
Zangl, Fabrice
2006Lexecute: Visualisation and representation of legal procedures
In: Digital Evidence Journal [3], 17-27
Journal Article
Freiheit2005aYuan, Cong
Billington, Jonathan
Freiheit, Jörn
2005Attachment IconAn Abstract Model of Routing in Mobile Ad Hoc Networks
In: Sixth Workshop and Tutorial on Practical Use of Coloured Petri Nets and the CPN Tools, 137-156
Proceedings Article
Freiheit2005bFreiheit, Jörn
Münch, Susanne
Schöttle, Hendrik
Sijanski, Grozdana
Zangl, Fabrice
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
Freiheit2005cLilith, Nimrod
Billington, Jonathan
Freiheit, Jörn
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
Freiheit2005dSimon, Carlo
Freiheit, Jörn
Olbrich, Sebastian
2006Using BPEL processes defined by Event-driven Process Chains
In: 5. GI-Workshop "EPK 2006 - Geschäftsprozessmanagement mit Ereignisgesteuerten Prozessketten", 121-135
Proceedings Article
Freiheit2005eFreiheit, Jörn
Zangl, Fabrice
2006Model-based user-interface management for public services
In: 6th European Conference on e-Government, 141-151
Proceedings Article
Freiheit2005EPKCuntz, Nicolas
Freiheit, Jörn
Kindler, Ekkart
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
Friedrich-Diplom98Friedrich, Stefan1998Integration of a Decision Procedure for Second-Order Monadic Logic in a Higher-Order Logic Theorem Proving Environment
Universität des Saarlandes
Thesis - Masters thesis
Furbach:etal:OptimizingXPathDL:INAP:2004Baumgartner, Peter
Furbach, Ulrich
Gross-Hardt, Margret
Kleemann, Thomas
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
GabbayOhlbach92bGabbay, Dov M.
Ohlbach, Hans Jürgen
1992From a Hilbert Calculus to its Model Theoretic Semantics
In: Proc.~4th Annual UK Conference on Logic Programming (APULK '92), 218-252
Proceedings Article
GabbayOhlbach92cGabbay, Dov M.
Ohlbach, Hans Jürgen
1992Quantifier Elimination in Second-Order Predicate Logic
In: South African Computer Journal [7], 35-43
Journal Article
GabbayOhlbach92cKRGabbay, Dov M.
Ohlbach, Hans Jürgen
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
Gaede95-MastersthesisGaede, Bernd1995Attachment IconSuperposition Extended with Sorts
Universität Kaiserslautern
Thesis - Masters thesis
GaillourdetHillenbrandLoechner2003Gaillourdet, Jean-Marie
Hillenbrand, Thomas
Löchner, Bernd
Spies, Hendrik
2003Attachment IconThe New WALDMEISTER Loop at Work
In: Automated deduction, CADE-19 : 19th International Conference on Automated Deduction, 317-321
Proceedings Article
Gamkrelidze-Thesis-2001Gamkrelidze, Alexander2001Attachment IconEinige Optimierungsmethoden hierarchischer Schaltkreise
Universität des Saarlandes
Thesis - PhD thesis
GanHNOT-CAV-04Ganzinger, Harald
Hagen, George
Nieuwenhuis, Robert
Oliveras, Albert
Tinelli, Cesare
2004DPLL(T): Fast Decision Procedures
In: Computer aided verification : 16th International Conference, CAV 2004, 175-188
Proceedings Article
GanKor:ThInst:2006Ganzinger, Harald
Korovin, Konstantin
2006Theory Instantiation
In: 13th Conference on Logic for Programming Artificial Intelligence Reasoning (LPAR'06), 497-511
Proceedings Article
Ganzinger-01-licsGanzinger, Harald2001Attachment IconRelating Semantic and Proof-Theoretic Concepts for Polynomial Time Decidability of Uniform Word Problems
In: Proceedings of the 16th IEEE Symposium on Logic in Computer Science (LICS-01), 81-90
Proceedings Article
Ganzinger-02-cadeGanzinger, Harald2002Attachment IconShostak Light
In: Automated deduction, CADE-18 : 18th International Conference on Automated Deduction, 332-346
Proceedings Article
Ganzinger-91-jscGanzinger, Harald1991A completion procedure for conditional equations
In: Journal of Symbolic Computation [11], 51-81
Journal Article
Ganzinger-91-tcsGanzinger, Harald1991Order-Sorted Completion: The Many-Sorted Way
In: Theoretical Computer Science [89], 3-32
Journal Article
Ganzinger-94-satGanzinger, Harald1994The Saturate SystemUnpublished/Draft
Ganzinger-ed-cade-1999Ganzinger (ed.)1999Proceedings of the 16th International Conference on Automated Deduction (CADE-16)Proceedings
Ganzinger-et-al-00-AIMLGanzinger, Harald
Hustadt, Ullrich
Meyer, Christoph
Schmidt, Renate A.
2001Attachment IconA Resolution-Based Decision Procedure for Extensions of K4
In: Advances in Modal Logic, Volume 2, 225-246
Part of a Book
Ganzinger-et-al-01-DagstuhlFurbach, Ganzinger, Hasegawa, Kapur (ed.)2000DeductionProceedings
Ganzinger-SofronieStokkermans-Waldmann-ijcar-2004Ganzinger, Harald
Sofronie-Stokkermans, Viorica
Waldmann, Uwe
2004Modular Proof Systems for Partial Functions with Weak Equality
In: Automated reasoning : Second International Joint Conference, IJCAR 2004, 168-182
Proceedings Article
Ganzinger-Stuber-ic-05Ganzinger, Harald
Stuber, Jürgen
2005Superposition with equivalence reasoning and delayed clause normal form transformation
In: Information and Computation [199], 3-23
Journal Article
Ganzinger1999LPARGanzinger, McAllester, Voronkov (ed.)1999Proceedings of the 6th International Conference on Logic for Programming and Automated Reasoning (LPAR-99)Proceedings
Ganzinger2003aGanzinger, Harald2001Bottom-Up Deduction with Deletion and Priorities
In: Programs as Data Objects (PADO-01) : Second Symposium PADO 2001, 276-277
Proceedings Article
Ganzinger96-ICALP-23Ganzinger, Harald1996Saturation-based theorem proving (abstract)
In: Automata, Languages and Programming: International Colloquium (ICALP-23), 1-3
Proceedings Article
Ganzinger98Ganzinger, Harald1998Preface
In: Theoretical Computer Science [208], 1
Journal Article
GanzingerHillenbrandWaldmann2003Ganzinger, Harald
Hillenbrand, Thomas
Waldmann, Uwe
2003Attachment IconSuperposition modulo a Shostak Theory
In: Automated Deduction, CADE-19 : 19th International Conference on Automated Deduction, 182-196
Proceedings Article
GanzingerJacquemardVeanes-00-ijfcsGanzinger, Harald
Jacquemard, Florent
Veanes, Margus
2000Rigid Reachability: The Non-Symmetric Form of Rigid E-unification
In: International Journal of Foundations of Computer Science [11], 3-27
Journal Article
GanzingerJacquemardVeanes-98Ganzinger, Harald
Jacquemard, Florent
Veanes, Margus
1998Rigid Reachability
In: Proceedings of the 4th Asian Computing Science Conference on Advances in Computing Science (ASIAN-98), 4-21
Proceedings Article
GanzingerKorovin-03-licsGanzinger, Harald
Korovin, Konstantin
2003Attachment IconNew Directions in Instantiation-Based Theorem Proving
In: 18th Annual IEEE Symposium on Logic in Computer Science (LICS-03), 55-64
Proceedings Article
GanzingerMcAllester-01-ijcarGanzinger, Harald
McAllester, David
2001Attachment IconA new meta-complexity theorem for bottom-up logic programs
In: Automated reasoning : First International Joint Conference, IJCAR 2001, 514-528
Proceedings Article
GanzingerMcAllester-02-iclpGanzinger, Harald
McAllester, David
2002Attachment IconLogical Algorithms
In: Logic Programming. 18th International Conference, ICLP 2002, 209-223
Proceedings Article
GanzingerMeyerVeanes-99-licsGanzinger, Harald
Meyer, Christoph
Veanes, Margus
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
GanzingerMeyerWeidenbach-97-cadeGanzinger, Harald
Meyer, Christoph
Weidenbach, Christoph
1997Soft Typing for Ordered Resolution
In: Proceedings of the 14th International Conference on Automated Deduction (CADE-14), 321-335
Proceedings Article
GanzingerNieuwenhuis-01-cclGanzinger, Harald
Nieuwenhuis, Robert
2001Attachment IconConstraints and Theorem Proving
In: Contraints in Computational Logics, International Summer School (CCL-99), 159-201
Proceedings Article
GanzingerNieuwenhuisNivela-01-ijcarGanzinger, Harald
Nieuwenhuis, Robert
Nivela, Pilar
2001Attachment IconContext trees
In: Automated reasoning : First International Joint Conference, IJCAR 2001, 242-256
Proceedings Article
GanzingerNieuwenhuisNivela-03-jarGanzinger, Harald
Nieuwenhuis, Robert
Nivela, Pilar
2004Attachment IconFast Term Indexing with Coded Context Trees
In: Journal of Automated Reasoning [32], 103-120
Journal Article
GanzingerNivelle-99-licsGanzinger, Harald
de Nivelle, Hans
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
GanzingerRTA96Ganzinger (ed.)1996Rewriting Techniques and Applications, 7th International Conference, RTA-96Proceedings
GanzingerSofronie-Stokkermans-00-ismvlGanzinger, Harald
Sofronie-Stokkermans, Viorica
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
GanzingerStuber-2003-cadeGanzinger, Harald
Stuber, Jürgen
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
GanzingerStuber-92Ganzinger, Harald
Stuber, Jürgen
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
GanzingerWaldmann-92-ctrsGanzinger, Harald
Waldmann, Uwe
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
GanzingerWaldmann1996CADEGanzinger, Harald
Waldmann, Uwe
1996Theorem Proving in Cancellative Abelian Monoids (Extended Abstract)
In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), 388-402
Proceedings Article
Ganzinger:2001:EDMGanzinger, Harald2001Efficient deductive methods for program analysis
In: ACM SIGPLAN Notices [36], 102-103
Journal Article
GanzKor:InstEq:2004Ganzinger, Harald
Korovin, Konstantin
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
GeorgievaHustadtSchmidt02bGeorgieva, Lilia
Hustadt, Ullrich
Schmidt, Renate A.
2002A New Clausal Class Decidable by Hyperresolution
In: Automated deduction, CADE-18 : 18th International Conference on Automated Deduction, 260-274
Proceedings Article
GeorgievaHustadtSchmidt02cGeorgieva, Lilia
Hustadt, Ullrich
Schmidt, Renate A.
2002A New Clausal Class Decidable by HyperresolutionReport
GeorgievaHustadtSchmidt02dGeorgieva, Lilia
Hustadt, Ullrich
Schmidt, Renate A.
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
GeorgievaMaier2005Georgieva, Lilia
Maier, Patrick
2005Description Logics for Shape Analysis
In: Third IEEE International Conference on Software Engineering and Formal Methods (SEFM 2005), 321-330
Proceedings Article
Gerber-Mastersthesis95Gerber, Christian1995Entwicklung eines Algorithmus zur effizienten Anfragebeantwortung für eine terminologische Wissensrepräsentationssprache
Universität des Saarlandes
Thesis - Masters thesis
GK2007Ganzinger, Harald
Korovin, Konstantin
2006Theory Instantiation
In: Logic for Programming, Artificial Intelligence, and Reasoning : 13th International Conference, LPAR 2006, 497-511
Proceedings Article
GKNO97Gabbay, Kruse, Nonnengart, Ohlbach (ed.)1997Qualitative and Quantitative Practical ReasoningBook
GoebelMaier2000Göbel, Manfred
Maier, Patrick
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
GorankoHustadtSchmidtVakarelov04aGoranko, Valentin
Hustadt, Ullrich
Schmidt, Renate A.
Vakarelov, Dimiter
2004SCAN is complete for all Sahlqvist formulae
In: Relational and Kleene-Algebraic Methods in Computer Science: 7th International Seminar on Relational Methods in Computer Science and 2nd International Workshop on Applications of Kleene Algebra, 149-162
Proceedings Article
Graf-94-cadeGraf, Peter1994Extended Path-Indexing
In: Proceedings of the 12th International Conference on Automated Deduction (CADE-12), 514-528
Proceedings Article
Graf-95-phdGraf, Peter1995Term Indexing
Universität des Saarlandes
Thesis - PhD thesis
Graf-95-rtaGraf, Peter1995Substitution Tree Indexing
In: Proceedings of the 6th International Conference on Rewriting Techniques and Applications (RTA-95), 117-131
Proceedings Article
Graf-96-LNAIGraf, Peter1996Term IndexingBook
Graf96-CADE-13Graf, Peter1996Path indexing for AC-theories
In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), 718-732
Proceedings Article
GrafDipl1992Graf, Peter1992Unification Using Dynamic Sorts
Universität des Saarlandes
Thesis - Masters thesis
GrafMeyer96Graf, Peter
Meyer, Christoph
1996Advanced indexing operations on substitution trees
In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), 553-567
Proceedings Article
Grenner01Grenner, Ingo2001Die Erzeugung von Schnittebenen mit maximalem Verletzungsgrad und deren Einsatz im Branch-and-Cut Verfahren
Universität des Saarlandes
Thesis - Masters thesis
GSW-i-and-cGanzinger, Harald
Sofronie-Stokkermans, Viorica
Waldmann, Uwe
2006Modular Proof Systems for Partial Functions with Evans Equality
In: Information and Computation [204], 1453-1492
Journal Article
GurevichVeanes99Gurevich, Yuri
Veanes, Margus
1999Logic with Equality: Partisan Corroboration and Shifted Pairing
In: Information and Computation [152], 205-235
Journal Article
HaehnleKerberEtAl96Hähnle, Reiner
Kerber, Manfred
Weidenbach, Christoph
1996Common Syntax of the DFG-Schwerpunktprogramm ``Deduktion''Report
Hagemann2008Hagemann, Willem2005Formalisierung der Arithmetik
Universität Göttingen
Thesis - other
Hanus91aHanus, Michael1991Efficient Implementation of Narrowing and Rewriting
In: Proc. Intern. Workshop on Processing Declarative Knowledge, 344-365
Proceedings Article
Hanus91bHanus, Michael1991Parametric 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
Hanus91cHanus, Michael1991Horn Clause Programs with Polymorphic Types: Semantics and Resolution
In: Theoretical Computer Science [89], 63-106
Journal Article
Hanus92aHanus, Michael1992Incremental Rewriting in Narrowing Derivations
In: Proceedings of the 3rd International Conference on Algebraic and Logic Programming (ALP-92), 228-243
Proceedings Article
Hanus92bHanus, Michael1992On the Completeness of Residuation
In: Proceedings of the 1992 Joint International Conference and Symposium on Logic Programming, 192-206
Proceedings Article
Hanus92cHanus, Michael1992Improving 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
Hanus92dHanus, Michael1992Logic Programming with Type Specifications
In: Types in Logic Programming, 91-140
Part of a Book
Hanus93aHanus, Michael1993Analysis of Nonlinear Constraints in CLP($\calR$)
In: Proceedings of the 10th International Conference on Logic Programming (ICLP '93), 83-99
Proceedings Article
Hanus93dHanus, Michael1993Towards the Global Optimization of Functional Logic Programs
In: Proc.~Workshop on Global Compilation, International Logic
Programming Symposium, 83-97
Proceedings Article
Hanus94ESOPHanus, Michael1994Lazy Unification with Simplification
In: Proceedings of the 5th European Symposium on Programming Languages and Systems (ESOP'94), 272-286
Proceedings Article
Hanus94JLPHanus, Michael1994The Integration of Functions into Logic Programming: From Theory to Practice
In: Journal of Logic Programming [19 & 20], 583-628
Journal Article
Hanus94PLILPHanus, Michael1994Combining Lazy Narrowing and Simplification
In: Proceedings of the 6th International Symposium on Programming Language Implementation and Logic Programming (PLILP'94), 370-384
Proceedings Article
hanus95aHanus, Michael1995Compile-Time Analysis of Nonlinear Constraints in CLP(R)
In: New Generation Computing [13], 155-186
Journal Article
Hanus95ICLPHanus, Michael1995On Extra Variables in (Equational) Logic Programming
In: Proceedings of the Twelfth International Conference on Logic Programming, 665-679
Proceedings Article
Hanus95JLPHanus, Michael1995Analysis of Residuating Logic Programs
In: Journal of Logic Programming [24], 219-245
Journal Article
HanusHabil1994Hanus, Michael1994Thema der Antrittsvorlesung: Deklarative Programmierparadigmen und ihre Integration
Universität des Saarlandes
Thesis - Habilitation thesis
HanusJosephs93cHanus, Michael
Josephs, Berthold
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
HanusZartmann94SASHanus, Michael
Zartmann, Frank
1994Mode Analysis of Functional Logic Programs
In: Proceedings of the 1st International Static Analysis Symposium (SAS'94), 26-42
Proceedings Article
Hillenbrand2003Hillenbrand, Thomas2003Attachment 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
Hillenbrand2004Hillenbrand, Thomas2004Attachment 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
HillenbrandLoechner2001Hillenbrand, Thomas
Löchner, Bernd
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
HillenbrandTopicWeidenbach2005Hillenbrand, Thomas
Topic, Dalibor
Weidenbach, Christoph
2006Sudokus as Logical Puzzles
In: Proceedings of the Third Workshop on Disproving, 2-12
Electronic Proceedings Article
HL02-CADE18Hillenbrand, Thomas
Löchner, Bernd
2002Attachment IconThe Next WALDMEISTER Loop
In: Automated deduction, CADE-18 : 18th International Conference on Automated Deduction, 486-500
Proceedings Article
HoenickeMaier2005Hoenicke, Jochen
Maier, Patrick
2005Model-Checking of Specifications Integrating Processes, Data and Time
In: FM 2005: Formal Methods; International Symposium of Formal Methods Europe, 465-480
Proceedings Article
Hoffmann2003aHoffmann, Jörg2003Utilizing Problem Structure in Planning: A Local Search ApproachBook
Hoffmann2003bHoffmann, Jörg2003The Metric-FF Planning System: Translating ``Ignoring Delete Lists'' To Numeric State Variables
In: Journal of Artificial Intelligence Research [20], 51
Journal Article
Hoffmann2005Hoffmann, Jörg2005Where Ignoring Delete Lists Works: Local Search Topology in Planning Benchmarks
In: Journal of Artificial Intelligence Research [24], 685-758
Journal Article
HoffmannBrafman2005aHoffmann, Jörg
Brafman, Ronen
2005Contingent Planning via Heuristic Forward Search with Implicit Belief States
In: 15th International Conference on Automated Planning and Scheduling, 71-80
Proceedings Article
HoffmannBrafman2006Hoffmann, Jörg
Brafman, Ronen I.
2006Conformant planning via heuristic forward search: A new approach
In: Artificial Intelligence [170], 507-541
Journal Article
HoffmannEdelkamp2005Hoffmann, Jörg2005The Deterministic Part of IPC-4: An Overview
In: Journal of Artificial Intelligence Research [24], 519 - 579
Journal Article
HoffmannEtal2004Hoffmann, Jörg
Porteous, Julie
Sebastia, Laura
2004Ordered Landmarks in Planning
In: Journal of Artificial Intelligence Research [22], 215-278
Journal Article
HoffmannEtal2006aHoffmann, Jörg
Gomes, Carla
Selman, Bart
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
HoffmannEtAl2006bHoffmann, Jörg
Sabharwal, Ashish
Domshlak, Carmel
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
HoffmannGeffner2003Hoffmann, Jörg
Geffner, Hector
2003Branching Matters: Alternative Branching in Graphplan
In: 13th International Conference on Automated Planning and Scheduling (ICAPS-13), 22-31
Proceedings Article
HoffmannKupferschmid2005Hoffmann, Jörg2005A Covering Problem for Hypercubes
In: Proceedings of the 19th International Joint Conference on Artificial Intelligence, 579-580
Poster
hop94Hopf, Jörn
Klawonn, Frank
1994Learning the Rule Base of a Fuzzy Controller by a Genetic Algorithm
In: Fuzzy Systems in Computer Science, 63-74
Part of a Book
Hopf93aHopf, Jörn
Klawonn, Frank
1993Selbstlernende Fuzzy-Controller auf der Basis Genetischer Algorithmen
In: Fuzzy-Systeme '93 / Management unsicherer Informationen, 21-27
Proceedings Article
Hopf94bHopf, Jörn1994Genetic Algorithms within the Framework of Evolutionary ComputationMiscellaneous
Hopf96aClaus, Hopf, Schwefel (ed.)1996Evolutionary Algorithms and their ApplicationReport
Hopf96bHopf, Jörn1996Optimizing Photo Mask Layout for Grey-tone LithographyReport
Hopf96bHopf, Jörn1996Optimizing Photo Mask Layout for Grey-tone LithographyReport
Hopf96cHopf, Jörn
Rau, Rainer
1996Decision Making in an Economy Exploiting Fuzzy Rules Obtained from a Genetic Algorithm
In: Soft Computing with Industrial Applications, 331-336
Proceedings Article
Hopf97aHopf, Jörn1997Cooperative Coevolution of Fuzzy Rules
In: Proceedings of the 2nd International ICSC Symposium on Fuzzy Logic and Applications (ISFL-97), 337-381
Proceedings Article
HopfDiss2001Hopf, Jörn2001Photomaskenlayout für eine 3D-Grauton-Lithographie als kombinatorisches Optimierungsproblem
Universität des Saarlandes
Thesis - PhD thesis
HPT02Hillenbrand, Thomas
Podelski, Andreas
Topić, Dalibor
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
HSW1998Hustadt, Ullrich
Schmidt, Renate A.
Weidenbach, Christoph
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
Hustadt1999Hustadt, Ullrich1999Resolution-Based Decision Procedures for Subclasses of First-Order Logic
Universität des Saarlandes
Thesis - PhD thesis
Hustadt2001handbookFermüller, Christian G.
Leitsch, Alexander
Hustadt, Ullrich
Tammet, Tanel
2001Resolution Decision Procedures
In: Handbook of Automated Reasoning, 1793-1849
Part of a Book
Hustadt93aHustadt, Ullrich1993Abductive Disjunctive Logic Programming
In: ICLP '93 Postconference Workshop on Abductive Reasoning, ?
Proceedings Article
Hustadt93bHustadt, Ullrich1993Automated Support for the Development of Non-classical Logics
In: Workshop: Modellierung epistemischer Propositionen, KI '93,
Proceedings Article
Hustadt93cHustadt, Ullrich
Nonnengart, Andreas
1993Modalities in Knowledge Representation
In: Proc. of the 6th Australian Joint Conference on Artificial Intelligence (AI '93), 249-254
Proceedings Article
Hustadt94bHustadt, Ullrich1994Common and Mutual Belief for Agent Modeling
In: Modeling Epistemic Propositions: Workshop during the 18th German Annual Conference on Artificial Intelligence (KI-94),
Proceedings Article
Hustadt94b2Hustadt, Ullrich1994Common and Mutual Belief for Agent Modeling
In: KI-94 Workshops: Extended Abstracts, 123-124
Proceedings Article
Hustadt94cHustadt, Ullrich1994Do 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
Hustadt94c2Hustadt, Ullrich1994Do we need the closed-world assumption in knowledge representation?
In: KI-94 Workshops: Extended Abstracts, 293-294
Proceedings Article
Hustadt94dHustadt, Ullrich1994A Multi-Modal Logic for Stereotyping
In: Proceedings of the 4th International Conference on User Modeling UM94, 87-92
Proceedings Article
Hustadt95bHustadt, Ullrich1995Introducing Epistemic Operators into a Description Logic
In: Knowledge and Belief in Philosophie and Artificial Intelligence, 65-85
Part of a Book
HustadtSchmidt97bHustadt, Ullrich
Schmidt, Renate A.
1997On Evaluating Decision Procedures for Modal Logics
In: Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (IJCAI-97), 202-207
Proceedings Article
HustadtSchmidt98aHustadt, Ullrich
Schmidt, Renate A.
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
HustadtSchmidt99aHustadt, Ullrich
Schmidt, Renate A.
1999Maslov's Class K Revisited
In: Proceedings of the 16th International Conference on Automated Deduction (CADE-16), 172-186
Proceedings Article
HustadtSchmidt99bHustadt, Ullrich
Schmidt, Renate A.
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
HustadtSchmidt99eHustadt, Ullrich
Schmidt, Renate A.
1999An Empirical Analysis of Modal Theorem Provers
In: Journal of Applied Non-Classical Logics [9], 479-522
Journal Article
ICTL94Gabbay, Ohlbach (ed.)1994Temporal Logic: Proceedings of the 1st International Conference on Temporal LogicProceedings
jacobs-sofronie-pdpar-06Jacobs, Swen
Sofronie-Stokkermans, Viorica
2006Attachment IconApplications of hierarchical reasoning in the verification of complex systems
In: PDPAR'06: Pragmatical Aspects of Decision Procedures in Automated Reasoning, 15-26
Electronic Proceedings Article
jacobs-sofronie-pdpar-entcsJacobs, Swen
Sofronie-Stokkermans, Viorica
2007Applications of hierarchical reasoning in the verification of complex systems
In: Electronic Notes in Theoretical Computer Science [??],
Electronic Journal Article
Jacobs2004Jacobs, Swen2004Attachment IconInstance Generation Methods for Automated Reasoning
Universität des Saarlandes
Thesis - Masters thesis
JacobsWaldmann2005Jacobs, Swen
Waldmann, Uwe
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
JacquemardMeyerWeidenbach98Jacquemard, Florent
Meyer, Christoph
Weidenbach, Christoph
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
Jaeger00Jaeger, Manfred2000Attachment IconOn the complexity of inference about probabilistic relational models
In: Artificial Intelligence [117], 297-308
Journal Article
Jaeger1998aJaeger, Manfred1998Attachment 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
Jaeger1998bJaeger, Manfred1998Attachment 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
Jaeger1998cJaeger, Manfred1998Attachment 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
Jaeger93aJaeger, Manfred1993Circumscription: Completeness Reviewed
In: Artificial Intelligence [60], 293-301
Journal Article
Jaeger94aJaeger, Manfred1994Probabilistic Reasoning in Terminological Logics
In: Principles of Knowledge Representation an Reasoning: Proceedings of the 4th International Conference (KR94), 305-316
Proceedings Article
Jaeger94cJaeger, Manfred1994A Logic for Default Reasoning About Probabilities
In: Proceedings of the 10th Conference on Uncertainty in Artificial Intelligence (UAI'94), 352-359
Proceedings Article
Jaeger95Jaeger, Manfred1995Minimum Cross-Entropy Reasoning: A Statistical Justification
In: Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95), 1847-1852
Proceedings Article
Jaeger96KRJaeger, Manfred1996Representation Independence of Nonmonotonic Inference Relations
In: Principles of Knowledge Representation and Reasoning, Proceedings of the 5th International Conference (KR-96), 461-472
Proceedings Article
Jaeger97UAIJaeger, Manfred1997Attachment IconRelational Bayesian Networks
In: Proceedings of the 13th Conference of Uncertainty in Artificial Intelligence (UAI-13), 266-273
Proceedings Article
Jaeger99Jaeger, Manfred1999Attachment IconFairness, Computable Fairness and Randomness
In: Proceedings of the 2nd International Workshop on Probabilistic Methods in Verification (PROBMIV-99), 57-66
Proceedings Article
JaegerAMAI01Jaeger, Manfred2001Attachment IconComplex Probabilistic Modeling with Recursive Relational Bayesian Networks
In: Annals of Mathematics and Artificial Intelligence [32], 179-220
Journal Article
JaegerECSQARU03Jaeger, Manfred2003Attachment IconA Representation Theorem and Applications
In: Symbolic and Quantitative Approaches to Reasoning with Uncertainty :
7th European Conference, ECSQARU 2003, 50-61
Proceedings Article
JaegerHabilJaeger, Manfred2002Probabilistic Decision Graphs
Universität des Saarlandes
Thesis - Habilitation thesis
JaegerICML03Jaeger, Manfred2003Probabilistic Classifiers and the Concepts they Recognize
In: Proceedings of the Twentieth International Conference on Machine Learning (ICML-03), 266-273
Proceedings Article
JaegerIJAR01Jaeger, Manfred2001Attachment IconAutomatic Derivation of Probabilistic Inference Rules
In: International Journal of Approximate Reasoning [28], 1-22
Journal Article
JaegerIJCAI01Jaeger, Manfred2001Attachment 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
JaegerMI19Jaeger, Manfred2002Attachment IconRelational Bayesian Networks: a Survey
In: Electronic Transactions on Artificial Intelligence [6],
Electronic Journal Article
JaegerPGM02Jaeger, Manfred2002Attachment 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
JaegerThesisJaeger, Manfred1995Default Reasoning about Probabilities
Universität des Saarlandes
Thesis - PhD thesis
JensenPodelski2004Jensen, Podelski (ed.)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
JMW96Jaeger, Manfred
Mannila, Heikki
Weydert, Emil
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
JohannSocher-Ambrosius93Johann, Patricia
Socher-Ambrosius, Rolf
1994Solving Simplificating Ordering Constraints
In: Proceedings of the 1st International Conference on Constraints in Computational Logics (CCL'94), 352-367
Proceedings Article
JungDiplom2000Jung, Georg2001Attachment 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
KasperDiss1998Kasper, Thomas1998A Unifying Logical Framework for Integer Linear Programming and Finite Domain Constraint Programming
Universität des Saarlandes
Thesis - PhD thesis
Kazakov03SubsumptionFLzeroKazakov, Yevgeny
de Nivelle, Hans
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
Kazakov04GF2NKazakov, Yevgeny2004Attachment 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
Kazakov2002Kazakov, Yevgeny2002Attachment IconRecursive resolution for modal logic
In: Symposium on the Effectiveness of Logic in Computer Science in Honour of Moshe Vardi, 11-15
Proceedings Article
Kazakov2005Kazakov, Yevgeny2006Attachment IconSaturation-Based Decision Procedures For Extensions Of The Guarded Fragment
Universität des Saarlandes
Thesis - PhD thesis
KazNiv04ResGFTGKazakov, Yevgeny
de Nivelle, Hans
2004A Resolution Decision Procedure for the Guarded Fragment with Transitive Guards
In: Automated reasoning : Second International Joint Conference, IJCAR 2004, 122-136
Proceedings Article
Klotzki-Mastersthesis95Klotzki, Pia1995Wiedemann-Algorithmus zur Lösung dünnbesetzter Gleichungssysteme über Fp
Universität des Saarlandes
Thesis - Masters thesis
KorovinPhD2003Korovin, Konstantin2003Knuth-Bendix orders in automated deduction and term rewriting
University of Manchester
Thesis - PhD thesis
KorovinVoronkov:CADE03:ACKBOKorovin, Konstantin
Voronkov, Andrei
2003Attachment IconAC-compatible Knuth-Bendix Order
In: Automated deduction, CADE-19 : 19th International Conference on Automated Deduction, 47-59
Proceedings Article
KorovinVoronkov:IC:2003Korovin, Konstantin
Voronkov, Andrei
2003Orienting rewrite rules with the Knuth-Bendix order
In: Information and Computation [183], 165-186
Journal Article
KorovinVoronkov:LICS03:EqOrientabilityKorovin, Konstantin
Voronkov, Andrei
2003Attachment IconOrienting Equalities with the Knuth-Bendix Order
In: 18th Annual IEEE Symposium on Logic in Computer Science (LICS-03), 75-84
Proceedings Article
KorovinVoronkov:TOCL:2004Korovin, Konstantin
Voronkov, Andrei
2005Knuth-Bendix constraint solving is NP-complete
In: ACM Transactions on Computational Logic [6], 361-388
Journal Article
KraanBasinBundy93aKraan, Ina
Basin, David A.
Bundy, Alan
1993Logic Program Synthesis via Proof Planning
In: International Workshop on Logic Program Synthesis and Transformation (LOPSTR '92), 1-14
Proceedings Article
KraanBasinBundy93bKraan, Ina
Basin, David A.
Bundy, Alan
1993Middle-Out Reasoning for Logic Program Synthesis
In: Proc.~10th Intern. Conference on Logic Programing (ICLP '93), 441-455
Proceedings Article
KraanBasinBundy96Kraan, Ina
Basin, David A.
Bundy, Alan
1996Middle-out reasoning for synthesis and induction
In: Journal of Automated Reasoning [16], 113-145
Journal Article
KrischerBockmayr91aKrischer, Stefan
Bockmayr, Alexander
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
KrishnaRao95Krishna Rao, M. R. K.1995Graph reducibility of term rewriting systems
In: Proceedings of Mathematical Foundations of Computer Science, 371-381
Proceedings Article
KrishnaRao96aKrishna Rao, M. R. K.1996A class of Prolog programs inferable from positive data
In: Algorithmic Learning Theory, 272-284
Proceedings Article
KrishnaRao96bKrishna Rao, M. R. K.1996Completeness results for basic narrowing in non-copying implementations
In: Logic Programming, 393-407
Proceedings Article
KrishnaRao96cKrishna Rao, M. R. K.1996Learning Prolog programs from examples
In: Knowledge Based Computer Systems, 19-30
Proceedings Article
KrishnaRao96dKrishna Rao, M. R. K.1996Modularity of termination in term graph rewriting
In: Rewriting Techniques and Applications, 230-244
Proceedings Article
KrishnaRao96eKrishna Rao, M. R. K.1996Some characteristics of strong innermost normalization
In: Algebraic Methodology and Software Technology, 5th International Conference, AMAST '96, 406-420
Proceedings Article
KrishnaRao97aKrishna Rao, M. R. K.1997A framework for incremental learning of logic programs
In: Theoretical Computer Science [185], 191-213
Journal Article
KrishnaRao98aKrishna Rao, M. R. K.1998Modular Aspects of term graph rewriting
In: Theoretical Computer Science [208], 59-86
Journal Article
KrishnaRaoActaInformaticaKrishna Rao, M. R. K.1996Relating confluence, innermost-confluence and outermost-confluence properties of term rewriting systems
In: Acta Informatica [33], 595-606
Journal Article
KrishnaRaoALTKrishna Rao, M. R. K.1995Incremental Learning of Logic Programs
In: Proceedings of International Workshop on Algorithmic Learning Theory, 95-109
Proceedings Article
KrishnaRaoSASKrishna Rao, M. R. K.
Shyamasundar, R. K.
1995Unification-free Execution of Well-moded Prolog Programs
In: Proc. of International Static Analysis Symposium, 243-260
Proceedings Article
KrishnaRaoTAPSOFTKrishna Rao, M. R. K.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
KrishnaRaoTCSKrishna Rao, M. R. K.1995Modular Proofs for Completeness of hierarchical term rewriting systems
In: Theoretical Computer Science [151], 487-512
Journal Article
KupferschmidEtAl2006Kupferschmid, Sebastian
Hoffmann, Jörg
Dierks, Henning
Behrmann, Gerd
2006Adapting an AI Planning Heuristic for Directed Model Checking
In: Model checking software : 13th International SPIN Workshop, 35-52
Proceedings Article
Lee2004Lee, Chin Soon2004Size-change Termination AnalyzerUnpublished/Draft
Lee2009Lee, Chin Soon2009Ranking functions for size-change termination
In: ACM Transactions on Programming Languages and Systems [31], 10:1-10:42
Journal Article
lepl:94aLee, Shie-Jue
Plaisted, David A.
1994Problem solving by searching for models with a theorem prover
In: Artificial Intelligence [69], 205-233
Journal Article
lepl:94bLee, Shie-Jue
Plaisted, David A.
1994Use of replace rules in theorem proving
In: Methods of Logic in Computer Science [1], 217-240
Journal Article
LETZ03Letz, Reinhold
Stenz, Gernot
2003Universal variables in disconnection tableaux
In: Automated reasoning with analytical tableaux and related methods : International Conference, TABLEAUX 2003, 117-133
Proceedings Article
LetzWeidenbach98Letz, Reinhold
Weidenbach, Christoph
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
LeuschelPodelski2004Podelski, Andreas2004Introduction to the Special Issue on Verification and Computational Logic
In: Theory and Practice of Logic Programming (TPLP) [4], 541-751
Journal Article
Leven-Diplom98Leven, Peter1998Integrating Clausal Decision Procedures in a Tactic Based Theorem Prover
Universität des Saarlandes
Thesis - Masters thesis
LevyVeanes99Levy, Jordi
Veanes, Margus
2000On the Undecidability of Second-Order Unification
In: Information and Computation [159], 125-150
Journal Article
LisaCSLAbdelwaheb, Ayari
Basin, David A.
Podelski, Andreas
1998LISA: A Specification Language Based on WS2S
In: Proceedings of the 11th International Workshop on Computer Science Logic (CSL-97), 18-34
Proceedings Article
LoechnerHillenbrandAICOM2002Löchner, Bernd
Hillenbrand, Thomas
2002Attachment IconA Phytography of WALDMEISTER
In: AI Communications [15], 127-133
Journal Article
LuWu1999Lu, Mi
Wu, Jinzhao
2000On Theorem proving in Annotated Logics
In: Journal of Applied Non-Classical Logics [10], 121-143
Journal Article
Madden-1992Madden, Peter1992Automated Program Transformation Through Proof Transformation
In: Proceedings of the 11th International Conference on Automated Deduction (CADE-11), 446-460
Proceedings Article
Madden-93aMadden, Peter
Bundy, Alan
1993General Proof Theoretic Techniques for Automatic
Programing
In: Proceedings of the EAST-WEST AI CONFERENCE: From
Theory to Practice - EWAIC'93,
Proceedings Article
Madden-95aMadden, Peter1995Program improvement by proof planning
In: Proceedings of British Colloquium on Theoretical Computer Science (BCTCS 11),
Proceedings Article
Madden-JARMadden, Peter
Bundy, Alan
Smaill, Alan
1999Recursive Program Optimization Through Inductive Synthesis Proof Transformation
In: Journal of Automated Reasoning [22], 65-115
Journal Article
Madden94a-djkiMadden, Peter1994Formal 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
MaddenGreen94b-aismc2Madden, Peter
Green, Ian
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
Maier2001Maier, Patrick2001A 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
Maier2002Maier, Patrick2002A 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
Maier2003Maier, Patrick2003Attachment IconA Lattice-Theoretic Framework For Circular Assume-Guarantee Reasoning
Universität des Saarlandes
Thesis - PhD thesis
Maier2003aMaier, Patrick2003Compositional 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
Maier2004Maier, Patrick2004Attachment IconIntuitionistic LTL and a New Characterization of Safety and LivenessReport
Maier2004Maier, Patrick2004Intuitionistic 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
makinson99Makinson, David
van der Torre, Leendert W. N.
2000Input-output logics
In: Journal of Philosophical Logic [29], 383-408
Journal Article
makinson99bMakinson, David
van der Torre, Leendert W. N.
2001Input-output logics
In: Proceedings of the 5th International Workshop on Deontic Logic in Computer Science (Deon-00),, 29
Proceedings Article
malkis2006Malkis, Alexander
Podelski, Andreas
Rybalchenko, Andrey
2006Thread-Modular Verification is Cartesian Abstract Interpretation
In: Theoretical Aspects of Computing - ICTAC 2006 : Third International Colloquium, 183-197
Proceedings Article
malkis2006aMalkis, Alexander
Podelski, Andreas
Rybalchenko, Andrey
2006Attachment IconThread-Modular Verification and Cartesian AbstractionUnpublished/Draft
MalkisPodelskiRybalchenkoSAS2007Rybalchenko, Andrey2007Precise Thread-Modular Verification
In: 14th International Static Analysis Symposium (SAS 2007), ?
Proceedings Article
Matthews92aMatthews, Seán1992Reflection in a Logical System
In: Proc.~IMSA '92 Workshop on Reflection and Meta-Level Architecture, 178-183
Proceedings Article
Matthews94bMatthews, Seán1994A Theory and its Metatheory in $FS_0$
In: What is a logical system?, 329-354
Part of a Book
Matthews96bMatthews, Seán1996Implementing $\textrm FS_0$ in Isabelle: Adding Structure at the Metalevel
In: Design and Implementation of Symbolic Computation Systems (DISCO'96), 228-239
Proceedings Article
Matthews97aMatthews, Seán1997A 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
Matthews97bMatthews, Seán1997Extending 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
MatthewsSimpson96aMatthews, Seán
Simpson, Alex
1996Reflection using the derivability conditions
In: Logic and Algebra, 603-616
Part of a Book
MatthewsSmaillBasin93aMatthews, Seán
Smaill, Alan
Basin, David A.
1993Experience with $FS_0$ as a Framework Theory
In: Logical Environments, 61-82
Part of a Book
Meter2009Meter, Peter2009Just a test entry
In: Booktitle, 1001-1010
Proceedings Article
Meyer-Diplom96Meyer, Christoph1996Attachment IconParallel Unit Resulting Resolution
Universität des Saarlandes
Thesis - Masters thesis
Meyer-DissMeyer, Christoph1999Soft Typing for Clausal Inference Systems
Universität des Saarlandes
Thesis - PhD thesis
MNP-InesMüller, Martin
Niehren, Joachim
Podelski, Andreas
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
MNP:Constraints99Müller, Martin
Niehren, Joachim
Podelski, Andreas
2000Ordering Constraints over Feature Trees
In: Constraints [5], 7-41
Journal Article
mod-modalBasin, David A.
Krieg-Brückner, Bernd
1999Formalization of the Development Process
In: Algebraic foundations of systems specification, 521-562
Part of a Book
Mohr95Mohr, Erik1995Resolution-Based Calculi for Modal Logics
Universität des Saarlandes
Thesis - Masters thesis
MP-SARA02Mukhopadhyay, Supratik
Podelski, Andreas
2002An Algebraic Framework for Abstract Model Checking
In: Abstraction, reformulation, and approximation : 5th International Symposium, SARA 2002, 152-169
Proceedings Article
MuellerNiehrenPodelski97aMüller, Martin
Niehren, Joachim
Podelski, Andreas
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
Mukhopadhyay-Thesis-2001Mukhopadhyay, Supratik2001Attachment IconA Uniform Constraint-based Framework for the Verification of Infinite State Systems
Universität des Saarlandes
Thesis - PhD thesis
Mukhopadhyay2000Mukhopadhyay, Supratik
Podelski, Andreas
2000Model Checking for Timed Logic Processes
In: Proceedings of the 1st International Conference on Computational Logic, 598-612
Proceedings Article
MukhopadhyayPodelski2001Mukhopadhyay, Supratik
Podelski, Andreas
2001Attachment IconConstraint Database Models Characterizing Timed Bisimilarity
In: Proceedings of the 3rd International Symposium on Practical Aspects of Declarative Languages, 245-258
Proceedings Article
MukhopadhyayPodelskiErshov2001Mukhopadhyay, Supratik
Podelski, Andreas
2001Accurate Widenings and Boundedness Properties of Timed Systems
In: Perspectives of System Informatics: 4th International Andrei Ershov Memorial Conference, 79-94
Proceedings Article
MukhopadhyayPodelskiFSTTCS1999Mukhopadhyay, Supratik
Podelski, Andreas
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
Naumann-Diplom97Naumann, Stefan1997Integration des automatischen Beweisers SPASS in die mathematische Assistenzumgebung OMEGA
Universität des Saarlandes
Thesis - Masters thesis
NiehrenMuellerTalbot_LICS1999Talbot, Jean-Marc
Niehren, Joachim
Müller, Martin
1999Entailment of Atomic Set Constraints is PSPACE-Complete
In: Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science (LICS-99), 285-294
Proceedings Article
NieuwenhuisHillenbrandRiazanovVoronkov2001Nieuwenhuis, Robert
Hillenbrand, Thomas
Riazanov, Alexandre
Voronkov, Andrei
2001Attachment IconOn the Evaluation of Indexing Techniques for Theorem Proving
In: Automated reasoning : First International Joint Conference, IJCAR 2001, 257-271
Proceedings Article
NiSe01esopNielson, Flemming
Seidl, Helmut
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
NivatPodelski97Nivat, Maurice
Podelski, Andreas
1997Minimal Ascending and Descending Tree Automata
In: SIAM Journal on Computing [26], 39-58
Journal Article
NivelleYevgeny2004de Nivelle, Hans
Kazakov, Yevgeny
2004Attachment IconResolution Decision Procedures for the Guarded Fragment with
Transitive Guards
Report
Nonnengart-DissertationNonnengart, Andreas1995A Resolution-Based Calculus for Temporal Logics
Universität des Saarlandes
Thesis - PhD thesis
Nonnengart1998Nonnengart, Andreas1998Modal Frame Characterization by Way of Auxiliary Modalities
In: Logic Journal of the IGPL [6], 875-899
Journal Article
nonnengart93aNonnengart, Andreas1993First-Order Modal Logic Theorem Proving and Functional Simulation
In: Proc.~13th Intern.~Joint Conference on Artificial Intelligence (IJCAI '93), 80-85
Proceedings Article
Nonnengart98Nonnengart, Andreas2001Strong SkolemizationUnpublished/Draft
NonnengartCADE96Nonnengart, Andreas1996Resolution-Based Calculi for Modal and Temporal Logics
In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), 598-612
Proceedings Article
NonnengartJELIA94Nonnengart, Andreas1994How to Use Modalities and Sorts in Prolog
In: Logics in Artificial Intelligence: Proceedings of the JELIA'94, 365-378
Proceedings Article
NonnengartOhlbach92aNonnengart, Andreas
Ohlbach, Hans Jürgen
1992Modal- und Temporallogik
In: Deduktionssysteme - Automatisierung des logischen Denkens, 239-284
Part of a Book
NonnengartOhlbachGabbay2001Nonnengart, Andreas
Ohlbach, Hans Jürgen
Gabbay, Dov M.
2001Encoding two-valued non-classical logics in classic logic
In: Handbook of Automated Reasoning, 1403-1486
Part of a Book
NonnengartOhlbachSzalas98Nonnengart, Andreas
Ohlbach, Hans Jürgen
Szalas, Andrzej
2001Quantifier Elimination for Second-Order Predicate LogicUnpublished/Draft
NonnengartRockWeidenbach98Nonnengart, Andreas
Rock, Georg
Weidenbach, Christoph
1998On Generating Small Clause Normal Forms
In: Proceedings of the 15th International Conference on Automated Deduction (CADE-98), 397-411
Proceedings Article
NonnengartSzalas1999Nonnengart, Andreas
Szalas, Andrzej
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
NonnengartWeidenbach2001handbookNonnengart, Andreas
Weidenbach, Christoph
2001Computing small clause normal forms
In: Handbook of Automated Reasoning, 335-367
Part of a Book
Ohlbach88Ohlbach, Hans Jürgen1988A Resolution Calculus for Modal Logics
Universität Kaiserslautern
Thesis - PhD thesis
Ohlbach91aOhlbach, Hans Jürgen1991Semantics Based Translation Methods for Modal Logics
In: Journal of Logic and Computation [1], 691-746
Journal Article
Ohlbach92aOhlbach, Hans Jürgen1992Logic Engineering: Konstruktion von Logiken
In: KI [3], 34-38
Journal Article
Ohlbach93aOhlbach, Hans Jürgen1993Ein 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
Ohlbach93cOhlbach, Hans Jürgen1993Translation Methods for Non-Classical Logics: An Overview
In: Bulletin of the Interest Group in Propositional and Predicate Logics (IGPL) [1], 69-90
Journal Article
Ohlbach95aOhlbach, Hans Jürgen1995Clause Killer TransformationsUnpublished/Draft
Ohlbach95bOhlbach, Hans Jürgen1995Boolean Algebras with Functions - Correspondence, Completeness and Quantifier EliminationUnpublished/Draft
Ohlbach96-CADE-13Ohlbach, Hans Jürgen1996SCAN-Elimination of Predicate Quantifiers
In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), 161-165
Proceedings Article
OhlbachHabil1993Ohlbach, Hans Jürgen1993Thema der Antrittsvorlesung: Transformation logischer Systeme
Universität des Saarlandes
Thesis - Habilitation thesis
OhlbachHerzig91aOhlbach, Hans Jürgen
Herzig, A.
1991Parameter Structures for Parametrized Modal Operators
In: Proc.~Intern.~Joint Conference on Artificial Intelligence (IJCAI'91), 512-517
Proceedings Article
OhlbachKoehler96Ohlbach, Hans Jürgen
Koehler, Jana
1996Reasoning about Sets via Atomic DecompositionReport
OhlbachLPAR93Ohlbach, Hans Jürgen1993Optimized 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
OhlbachSchmidt97Ohlbach, Hans Jürgen
Schmidt, Renate A.
1997Functional Translation and Second-Order Frame Properties of Modal Logics
In: Journal of Logic and Computation [7], 581-603
Journal Article
OhlbachSchmidtHustadt95bOhlbach, Hans Jürgen
Schmidt, Renate A.
Hustadt, Ullrich
1995Symbolic Arithmetical Reasoning with Qualified Number Restrictions
In: Proceedings of International Workshop on Description Logics'95, 89-95
Proceedings Article
OhlbachSchmidtHustadt96Ohlbach, Hans Jürgen
Schmidt, Renate A.
Hustadt, Ullrich
1996Translating Graded Modalities into Predicate Logic
In: Proof Theory of Modal Logic, 253-291
Part of a Book
OhlbachSiekmann91aOhlbach, Hans Jürgen
Siekmann, Jörg H.
1991The Markgraf Karl Refutation Procedure
In: Computational Logic, Essays in Honor of Alan Robinson, 41-112
Proceedings Article
OhlbachWeidenbach95Ohlbach, Hans Jürgen
Weidenbach, Christoph
1995A Note on Assumptions about Skolem Functions
In: Journal of Automated Reasoning [15], 267-275
Journal Article
P-SAS00Podelski, Andreas2000Model Checking as Constraint Solving
In: Proceedings of the 7th International Symposium on Static Analysis (SAS-00), 221-237
Proceedings Article
P-VMCAI03Podelski, Andreas2003Software Model Checking with Abstraction Refinement
In: Verification, model checking, and abstract interpretation : 4th International Conference, VMCAI 2003, 1-13
Proceedings Article
PacholskiPodelski97Pacholski, Leszek
Podelski, Andreas
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
Piskac2005Piskac, Ruzica2005Formal Correctness of Result Checking for Priority Queues
Universität des Saarlandes
Thesis - Masters thesis
plaisted.surveyPlaisted, David A.1993Equational Reasoning and Term Rewriting Systems
In: Handbook of Logic in Artificial Intelligence and Logic Programming, 273-364
Proceedings Article
plaisted:94bPlaisted, David A.1994The Search Efficiency of Theorem Proving Strategies
In: Proceedings of the 12th International Conference on Automated Deduction (CADE-12), 57-71
Proceedings Article
PnueliPodelskiRybalchenkoTACAS2005Pnueli, Amir
Podelski, Andreas
Rybalchenko, Andrey
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
Podelski1998Delzanno, Giorgio
Podelski, Andreas
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
Podelski2006dDräge, Klaus
Finkbeiner, Bernd
Podelski, Andreas
2006Directed Model Checking with Distance-Preserving Abstractions
In: Model checking software : 13th International SPIN Workshop, 19-34
Proceedings Article
Podelski2006eJensen, Kurt
Podelski, Andreas
2006Tools and algorithms for the construction and analysis of systems
In: International Journal on Software Tools for Technology Transfer [8], 177-179
Journal Article
Podelski95aPodelski (ed.)1995Constraint Programming: Basics and Trends
In: Constraint Programming: Basics and Trends, 328
Proceedings
Podelski97Podelski, Andreas1997Set-Based Analysis of Logic Programs and Reactive Logic Programs
In: Proceedings of the International Symposium on Logic Programming (ILPS-14), 35-36
Proceedings Article
PodelskiCharatonikMueller-ESOP99Podelski, Andreas
Charatonik, Witold
Müller, Martin
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
PodelskiHabil1998Podelski, Andreas1998Thema der Antrittsvorlesung: Alte Resultate aus der Automatentheorie
Universität des Saarlandes
Thesis - Habilitation thesis
PodelskiRybalchenkoCook2006Cook, Byron
Podelski, Andreas
Rybalchenko, Andrey
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
PodelskiRybalchenkoPOPL2005Podelski, Andreas
Rybalchenko, Andrey
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
PodelskiRybalchenkoTOPLAS2007Podelski, Andreas
Rybalchenko, Andrey
2007Transition Predicate Abstraction and Fair Termination
In: ACM Transactions on Programming Languages and Systems [29], 30
Journal Article
PodelskiSchaeferWagner2004Podelski, Andreas
Schaefer, Ina
Wagner, Silke
2004Attachment IconSummaries for While Programs with RecursionReport
PodelskiSmolka95Podelski, Andreas
Smolka, Gert
1995Operational Semantics of Constraint Logic Programming with Coroutining
In: Proceedings of the 12th International Conference on Logic Programming, 449-463
Proceedings Article
PodelskiSmolka:CP:95Podelski, Andreas
Smolka, Gert
1995Situated Simplification
In: Proceedings of the First International Conference on Principles and Practice of Constraint Programming (CP'95), 328-344
Proceedings Article
PodelskiWagner01_2007Podelski, Andreas
Wagner, Silke
2007Attachment IconA Method and a Tool for Automatic Verification of Region Stability for Hybrid SystemsReport
PodelskiWagner02_2007Podelski, Andreas
Wagner, Silke
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
PodelskiWagner03_2007Wagner, Silke
Podelski, Andreas
2007Region Stability Proofs for Hybrid Systems
In: Formal Modelling and Analysis of Timed Systems: 5th International Conference, FORMATS 2007, 16
Proceedings Article
PodelskiWagner2006Podelski, Andreas
Wagner, Silke
2006Model Checking of Hybrid Systems: From Reachability towards Stability
In: Hybrid Systems: Computation and Control : 9th International Workshop, HSCC 2006
, 507-521
Proceedings Article
PodelskiWiesSAS2005Podelski, Andreas
Wies, Thomas
2005Boolean Heaps
In: Static analysis : 12th International Symposium, SAS 2005, 268-283
Proceedings Article
PR04:LinearRankingPodelski, Andreas
Rybalchenko, Andrey
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
PR04:TransInvPodelski, Andreas
Rybalchenko, Andrey
2004Transition Invariants
In: Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, LICS 2004, 32-41
Proceedings Article
Prevosto2004Dubois, Catherine
Jaume, Mathieu
Pons, Olivier
Prevosto, Virgile
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
PrevostoDagstuhl2005Prevosto, Virgile2006Certified mathematical hierarchies: the FoCal system.
In: Proceedings of the MAP (Mathematics, Algorithms, Proofs) Workshop,
Electronic Proceedings Article
PrevostoTLCA2005Prevosto, Virgile
Boulmé, Sylvain
2005Proof Contexts with Late Binding
In: Typed Lambda Calculi and Applications: 7th International Conference, TLCA 2005, 325-339
Proceedings Article
PrevostoWaldmann2006Prevosto, Virgile
Waldmann, Uwe
2006SPASS+T
In: ESCoR: FLoC'06 Workshop on Empirically Successful Computerized Reasoning, 18-33
Proceedings Article
PSW:05Podelski, Andreas
Schaefer, Ina
Wagner, Silke
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
r-cppipd-00Krishna Rao, M. R. K.2000Some classes of prolog programs inferable from positive data
In: Theoretical Computer Science [241], 211-223
Journal Article
Rao:2000:SCSKrishna Rao, M. R. K.2000Some characteristics of strong innermost normalization
In: Theoretical Computer Science [239], 141-164
Journal Article
Ratschan2002Ratschan, Stefan
Vehi, Josep
2004Attachment IconRobust Pole Clustering of Parametric Uncertain Systems Using Interval Methods
In: Robust control design 2003 : (ROCOND 2003) ; a proceedings volume from the 4th IFAC symposium, 323-328
Proceedings Article
Ratschan2003Ratschan, Stefan2003Solving 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
Ratschan2004aJaulin, Luc
Ratschan, Stefan
Hardouin, Laurent
2004Set Computation for Nonlinear Control
In: Reliable Computing [10], 1-26
Journal Article
Ratschan2004bRatschan, Stefan2004Convergent Approximate Solving of First-order Constraints by Approximate Quantifiers
In: ACM Transactions on Computational Logic [5], 264-281
Journal Article
Ratschan2005Ratschan, Stefan
She, Zhikun
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
Ratschan2005aRatschan, Stefan2006Efficient Solving of Quantified Inequality Constraints over the Real Numbers
In: ACM Transactions on Computational Logic [7], 723-748
Journal Article
Ratschan2005bRatschan, Stefan2005Solving 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
Ratschan2006Ratschan, Stefan
Smaus, Jan-Georg
2006Verification-Integrated Falsification of Non-Deterministic Hybrid Systems
In: 2nd IFAC Conference on Analysis and Design of Hybrid Systems, ?
Proceedings Article
Ratschan2007Ratschan, Stefan
She, Zhikun
2007Attachment IconSafety Verification of Hybrid Systems by Constraint Propagation Based Abstraction Refinement
In: ACM Transactions in Embedded Computing Systems [6], 1-23
Journal Article
RauRainer97Rau, Rainer1997Adaption of a Fuzzy Controller for a Cybernetic System through an Evolutionary Algorithm
Universität des Saarlandes
Thesis - Masters thesis
ReinoldDipl91Reinold, Michael1991Transformation in dichten Wäldern
Universität des Saarlandes
Thesis - Masters thesis
rel-ripp-ijcaiBundy, Alan
Lombart, V.
1995Relational Rippling: a General Approach
In: Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95), 175-181
Proceedings Article
Rock95Rock, Georg1995Attachment IconTransformations of First-Order Formulae for Automated Reasoning
Universität des Saarlandes
Thesis - Masters thesis
Romina2004Goncharov, Sergey
Harizanov, Valentina
Knight, Julia F.
Morozov, Andrey
Romina, Anya
2005On automorphic tuples of elements in computable models
In: Siberian Mathematical Journal [46], 405-412
Journal Article
rp780Frank, Ian
Basin, David A.
1996Search in Games with Incomplete Information: A Case Study Using Bridge Card PlayReport
Rybalchenko-Sofronie-vmcai07Rybalchenko, Andrey
Sofronie-Stokkermans, Viorica
2007Constraint Solving for Interpolation
In: 8th International Conference on Verification, Model Checking and Abstract Interpretation (VMCAI 2007), ?
Proceedings Article
Rybalchenko2002Rybalchenko, Andrey2002Attachment IconA Model Checker based on Abstraction Refinement
Universität des Saarlandes
Thesis - Masters thesis
Rybalchenko2006ICTAC-DCMeyer, Roland
Faber, Johannes
Rybalchenko, Andrey
2006Model checking Duration Calculus: a practical approach
In: Theoretical Aspects of Computing - ICTAC 2006 : Third International Colloquium, 332-346
Proceedings Article
Rybalchenko2007PADLPodelski, Andreas
Rybalchenko, Andrey
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
Rybalchenko2007PLDI-PathsBeyer, Dirk
Henzinger, Thomas
Majumdar, Rupak
Rybalchenko, Andrey
2007Attachment IconPath Invariants
In: PLDI'07 : Proceedings of the ACM SIGPLAN 2007 Conference on Programming Language Design and Implementation, 300-309
Proceedings Article
Rybalchenko2007PLDI-ThreadsCook, Byron
Podelski, Andreas
Rybalchenko, Andrey
2007Attachment IconProving Thread Termination
In: PLDI'07 : Proceedings of the ACM SIGPLAN 2007 Conference on Programming Language Design and Implementation, 320-330
Proceedings Article
Rybalchenko2007POPLCook, Byron
Gotsman, Alexey
Podelski, Andreas
Rybalchenko, Andrey
Vardi, Moshe
2007Proving that programs eventually do something good
In: 34th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2007), 265-276
Proceedings Article
Rybalchenko2007VMCAI-InvGenBeyer, Dirk
Henzinger, Thomas
Majumdar, Rupak
Rybalchenko, Andrey
2007Invariant Synthesis for Combined Theories
In: Verification, Model Checking, and Abstract Interpretation : 8th International Conference, VMCAI 2007, 378-394
Proceedings Article
Schaef2005Schäf, Martin2006Attachment IconAbstrakte Übergangsrelationen als Mittel zur Verifikation von Programmeigenschaften
Universität des Saarlandes
Thesis - Masters thesis
Schlobach97Schlobach, Stefan1996Untersuchung nicht-monotoner Logiken - Fallstudie zur Automatisierung
Universität des Saarlandes
Thesis - Masters thesis
Schmidt92aSchmidt, Renate A.1993Terminological Representation, Natural Language \& Relation Algebra
In: GWAI-92: Advances in Artificial Intelligence: Proc.~16th German Workshop on Artificial Intelligence, 357-371
Proceedings Article
Schmidt94Schmidt, Renate A.1994Peirce Algebras and Their Applications in Artificial Intelligence and Computational Linguistics: Abstract
In: Relational Methods in Computer Science; Dagstuhl Seminar Report 80 (9403), 21-22
Proceedings Article
Schmidt94aSchmidt, Renate A.1994Peirce Algebras and Their Applications in Artificial Intelligence and Computational Linguistics: Abstract
In: SIGALA Newsletter [2], 27-27
Journal Article
Schmidt94bSchmidt, Renate A.1994Terminological Logics and Conceptual Graphs: An Historical Perspective
In: KI-94 Workshops: Extended Abstracts, 135-136
Proceedings Article
Schmidt97aSchmidt, Renate A.2000Relational Grammars for Knowledge Representation
In: Variable-Free Semantics, 162-180
Part of a Book
Schmidt97dSchmidt, Renate A.1997Optimised Modal Translation and Resolution
Universität des Saarlandes
Thesis - PhD thesis
Schmidt98cSchmidt, Renate A.1998E-Unification for Subsystems of S4
In: Proceedings of the 9th International Conference on Rewriting Techniques and Applications (RTA-98), 106-120
Proceedings Article
Schmidt98fSchmidt, Renate A.1998Resolution is a Decision Procedure for Many Propositional Modal Logics
In: Advances in Modal Logic, Volume 1, 189-208
Part of a Book
Schmidt99aSchmidt, Renate A.1999Decidability by Resolution for Propositional Modal Logics
In: Journal of Automated Reasoning [22], 379-396
Journal Article
SchmidtHustadt03bSchmidt, Renate A.
Hustadt, Ullrich
2003A Principle for Incorporating Axioms into the First-Order Translation of Modal Formulae
In: Automated deduction, CADE-19 : 19th International Conference on Automated Deduction, 412-426
Proceedings Article
SchmidtOrlowskaHustadt04aSchmidt, Renate A.
Orłowska, Ewa
Hustadt, Ullrich
2004Two Proof Systems for Peirce Algebras
In: Relational and Kleene-Algebraic Methods in Computer Science: 7th International Seminar on Relational Methods in Computer Science and 2nd International Workshop on Applications of Kleene Algebra, 238-251
Proceedings Article
SchmidtTishkovsky02cSchmidt, Renate A.
Tishkovsky, Dmitry
2002Multi-Agent Logic of Dynamic Belief and Knowledge
In: Proceedings of the 8th European Conference on Logics in Artificial Intelligence (JELIA), 38-49
Proceedings Article
SchmidtTishkovsky02eSchmidt, Renate A.
Tishkovsky, Dmitry
2003Multi-Agent Logic of Dynamic Belief and KnowledgeUnpublished/Draft
SchmidtTishkovsky03aSchmidt, Renate A.
Tishkovsky, Dmitry
2003Combining Dynamic Logic and Doxastic Modal Logics
In: Advances in Modal Logic, 371-391
Part of a Book
SchmidtTishkovsky03cSchmidt, Renate A.
Tishkovsky, Dmitry
2004Multi-Agent Dynamic Logics with Informational Test
In: Annals of Mathematics and Artificial Intelligence [42], 5-36
Journal Article
SchmidtTishkovskyHustadt02aSchmidt, Renate A.
Tishkovsky, Dmitry
Hustadt, Ullrich
2002Interaction between Knowledge, Action and Commitment within Agent Dynamic LogicUnpublished/Draft
SchmidtTishkovskyHustadt04aSchmidt, Renate A.
Tishkovsky, Dmitry
Hustadt, Ullrich
2004Interaction between Knowledge, Action and Commitment within Agent Dynamic Logic
In: Studia Logica [78], 381-415
Journal Article
Schmolzi-Diplom99Schmolzi, Christian1999Kooperative koevolutionäre Entwicklung von Fuzzy-Reglern
Universität des Saarlandes
Thesis - Masters thesis
She2005Ratschan, Stefan
She, Zhikun
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
She2005bShe, Zhikun
Ratschan, Stefan
2006Providing a Basin of Attraction to a Target Region by Computation of Lyapunov-like Functions
In: 4th IEEE International Conference on Computational Cybernetics, 245-249
Proceedings Article
She2006bShe, Zhikun
Xia, Bican
Xiao, Rong
2006A Semi-Algebraic Approach for the Computation of Lyapunov Functions
In: 2th IASTED International Conference on COMPUTATIONAL INTELLIGENCE, 7-12
Proceedings Article
Smaus96Smaus, Jan-Georg1996Finding Resolution K-Transformations
Universität des Saarlandes
Thesis - Masters thesis
socher91aSocher-Ambrosius, Rolf1991Boolean Algebra Admits no Convergent Term Rewriting System
In: Proceedings of the 4th International Conference on Rewriting Techniques and Applications (RTA-91), 264-274
Proceedings Article
socher91bSocher-Ambrosius, Rolf1991Optimizing the Clausal Normal Form Transformation
In: Journal of Automated Reasoning [7], 325-336
Journal Article
socher91cSocher-Ambrosius, Rolf1991On the Relation Between Completion Based and Resolution Based Theorem Proving
In: Journal of Symbolic Computation [11], 129-148
Journal Article
socher91dSocher-Ambrosius, Rolf1991On the Church-Rosser Property in Left-Linear SystemsReport
socher92aSocher-Ambrosius, Rolf1992A Goal Oriented Strategy Based on Completion
In: Proc.~3rd Intern.~Conference on Algebraic and Logic Programming, 435-445
Proceedings Article
socher92bSocher-Ambrosius, Rolf1992How to Avoid the Derivation of Redundant Clauses in Reasoning Systems
In: Journal of Automated Reasoning [9], 325-336
Journal Article
Socher93aSocher-Ambrosius, Rolf1993Unification in Order-Sorted Logic with Term Declarations
In: Proceedings of the 4th Conference on Logic Programming and Automated Reasoning (LPAR-93), 301-308
Proceedings Article
socher94aSocher-Ambrosius, Rolf1994A Refined Version of General E-Unification
In: Proceedings of the 12th International Conference on Automated Deduction (CADE-12), 665-677
Proceedings Article
Sofronie-cade-05Sofronie-Stokkermans, Viorica2005Attachment IconHierarchic reasoning in local theory extensions
In: Automated deduction - CADE-20 : 20th International Conference on Automated Deduction, 219-234
Proceedings Article
Sofronie-ijcar-06Sofronie-Stokkermans, Viorica2006Attachment IconInterpolation in local theory extensions
In: Proceedings of IJCAR 2006, 235-250
Proceedings Article
Sofronie-Stokkermans-cade2000Sofronie-Stokkermans, Viorica2000Attachment IconOn unification for bounded distributive lattices
In: Proceedings of the 17th International Conference on Automated Deduction (CADE-17), 465-481
Proceedings Article
Sofronie-Stokkermans-dam-06Sofronie-Stokkermans, Viorica2007Attachment IconAutomated theorem proving by resolution in non-classic logics
In: Discrete Applied Mathematics [?], ?
Journal Article
Sofronie-Stokkermans-dualities1999Sofronie-Stokkermans, Viorica1999Priestley representation for distributive lattices with operators and applications to automated theorem proving
In: Dualities, Interpretability and Ordered Structures, 43-54
Proceedings Article
Sofronie-Stokkermans-ftp2000Sofronie-Stokkermans, Viorica2000Attachment IconResolution-based theorem proving for SHn-logics
In: Automated Deduction in Classical and Non-Classical Logic (Selected Papers of FTP'98), 268-282
Proceedings Article
Sofronie-Stokkermans-getco-06Sofronie-Stokkermans, Viorica2006Sheaves and geometric logic in concurrency
In: Proceedings of the Eighth Workshop on Geometric and Topological Methods in Concurrency (GETCO 2006), ?
Proceedings Article
Sofronie-Stokkermans-hab04Sofronie-Stokkermans, Viorica2004Algebraic and logical methods in automated theorem proving and in the study of concurrency
Universität des Saarlandes
Thesis - Habilitation thesis
Sofronie-Stokkermans-ismvl-2004Sofronie-Stokkermans, Viorica2004Resolution-based decision procedures for the positive theory of some finitely generated varieties of algebras
In: Proceedings of the 34th International Symposium on Multiple-Valued Logic (ISMVL-2004), 32-37
Proceedings Article
Sofronie-Stokkermans-jim-2003Sofronie-Stokkermans, Viorica2003Attachment IconAutomated theorem proving by resolution in non-classical logics
In: Fourth International Conference Journees de l'Informatique Messine: Knowledge Discovery and Discrete Mathematics (JIM-03), 151-167
Proceedings Article
Sofronie-Stokkermans-jsc-2003Sofronie-Stokkermans, Viorica2003Attachment IconResolution-based decision procedures for the universal theory of some classes of distributive lattices with operators
In: Journal of Symbolic Computation [36], 891-924
Journal Article
Sofronie-Stokkermans-mvl-2003Sofronie-Stokkermans, Viorica2003Attachment IconRepresentation Theorems and the Semantics of Non-classical Logics, and Applications to Automated Theorem Proving
In: Beyond Two: Theory and Applications of Multiple Valued Logic, 59-100
Part of a Book
Sofronie-Stokkermans-tableaux-2002Sofronie-Stokkermans, Viorica2002Attachment IconOn uniform word problems involving bridging operators on distributive lattices
In: Automated Reasoning with Analytic and Related Methods : International Conference, TABLEAUX 2002, 235-250
Proceedings Article
Sofronie-Stokkermans-unif-05Sofronie-Stokkermans, Viorica2007Attachment IconOn unification for bounded distributive lattices
In: ACM Transactions on Computational Logic [8], ?
Journal Article
Sofronie-Stokkermans1999Sofronie-Stokkermans, Viorica2001Attachment IconAutomated Theorem Proving by Resolution for Finitely-Valued Logics Based on Distributive Lattices with Operators
In: Multiple-Valued Logic - An International Journal [6], 289-344
Journal Article
Sofronie-Stokkermans1999-cadeSofronie-Stokkermans, Viorica1999Attachment IconOn the Universal Theory of Varieties of Distributive Lattices with Operators: Some Decidability and Complexity Results
In: Proceedings of the 16th International Conference on Automated Deduction (CADE-16), 157-171
Proceedings Article
Sofronie-Stokkermans1999-fctSofronie-Stokkermans, Viorica
Stokkermans, Karel
1999Attachment IconModeling Interaction by Sheaves and Geometric Logic
In: Proceedings of the 12th International Symposium Fundamentals of Computation Theory (FCT-99), 512-523
Proceedings Article
Sofronie-Stokkermans1999-ismvlSofronie-Stokkermans, Viorica1999Representation Theorems and Automated Theorem Proving in Non-Classical Logics
In: Proceedings of the 29th IEEE International Symposium on Multiple-Valued Logic (ISMVL-99), 242-247
Proceedings Article
Sofronie-Stokkermans1999-lmpsSofronie-Stokkermans, Viorica1999Resolution-based theorem proving for non-classical logics based on distributive lattices with operators
In: Proceedings of the 11th International Congress of Logic, Methodology and Philosophy of Science. Volume of abstracts, 481-481
Proceedings Article
Sofronie-Stokkermans2000-atlas-1Iturrioz, Luisa
Sofronie-Stokkermans, Viorica
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
Sofronie-Stokkermans2000-atlas-2Sofronie-Stokkermans, Viorica2000Some properties of Kleene algebras
In: COST Action 15 (Many-Valued Logics for Computer Science Applications) ATLAS of Many-Valued Structures, 1-7
Part of a Book
Sofronie-Stokkermans2001-ismvlSofronie-Stokkermans, Viorica2001Representation theorems and the semantics of (semi)lattice-based logics
In: Proceedings of the 31st IEEE International Symposium on Multiple-Valued Logics, 125-134
Proceedings Article
Sofronie-verify-06Sofronie-Stokkermans, Viorica2006Local reasoning in verification
In: Proceedings of VERIFY'06: Verification Workshop, 128-145
Electronic Proceedings Article
Sofronie1997aSofronie-Stokkermans, Viorica2000Attachment IconPriestley Duality for SHn-algebras and Applications to the Study of Kripke-style Models for SHn-logics
In: Multiple-Valued Logic - An International Journal [5], 281-305
Journal Article
Sofronie1997bSofronie-Stokkermans, Viorica2000Attachment IconDuality and Canonical Extensions of Bounded Distributive Lattices with Operators and Applications to the Semantics of Non-Classical Logics. Part I
In: Studia Logica [64], 93-132
Journal Article
Sofronie1997cSofronie-Stokkermans, Viorica2000Attachment IconDuality and Canonical Extensions of Bounded Distributive Lattices with Operators and Applications to the Semantics of Non-Classical Logics. Part II
In: Studia Logica [64], 151-172
Journal Article
Sofronie1998aSofronie-Stokkermans, Viorica1998On Translation of Finitely-Valued Logics to Classical First-Order Logic
In: Proceedings of the 13th European Conference on Artificial Intelligence (ECAI-98), 410-411
Proceedings Article
Sofronie1998bSofronie-Stokkermans, Viorica1998Attachment IconResolution-based Theorem Proving for SHn-LogicsReport
Sofronie1998cSofronie-Stokkermans, Viorica1998Representation Theorems and Automated Theorem Proving in Certain Classes of Non-Classical Logics
In: Proceedings of the Workshop on Many-Valued Logic for AI Applications (ECAI-98), ?-?
Proceedings Article
Struth94aStruth, Georg1994Philosophical Logics: A Survey and a BibliographyReport
Struth94bStruth, Georg1994Intensionality, Possible Worlds and Propositional Attitudes: Formal and Philosophical Foundations of Modal Semantics
In: KI-94 Workshops: Extended Abstracts, 108-109
Proceedings Article
Struth97Struth, Georg1997On the Word Problem for Free Lattices
In: Proceedings of the 8th International Conference on Rewriting Techniques and Applications (RTA-97), 128-141
Proceedings Article
StruthDiss1999Struth, Georg1998Canonical Transformation in Algebra, Universal Algebra and Logic
Universität des Saarlandes
Thesis - PhD thesis
Stuber1998AutDedStuber, Jürgen1998Superposition theorem proving for commutative rings
In: Automated Deduction - A Basis for Applications. Volume III. Applications, 31-55
Part of a Book
Stuber1998TCSStuber, Jürgen1998Superposition theorem proving for abelian groups represented as integer modules
In: Theoretical Computer Science [208], 149-177
Journal Article
Stuber1999Stuber, Jürgen1999Attachment IconSuperposition Theorem Proving for Commutative Algebraic Theories
Universität des Saarlandes
Thesis - PhD thesis
Stuber1999RTAStuber, Jürgen1999Theory path orderings
In: Proceedings of the 10th International Conference on Rewriting Techniques and Applications (RTA-99), 148-162
Proceedings Article
Stuber2000RTAStuber, Jürgen2000Deriving Theory Superposition Calculi from Convergent Term Rewriting Systems
In: Proceedings of the 11th International Conference Rewriting Techniques and Applications (RTA-00), 229-245
Proceedings Article
Stuber91Stuber, Jürgen1991Attachment IconInductive Theorem Proving for Horn Clauses
Universität Dortmund
Thesis - Masters thesis
StuberFTP97Stuber, Jürgen1997Strong Symmetrization, Semi-Compatibility of Normalized Rewriting and First-Order Theorem Proving
In: Proceedings of the International Workshop on First-Order Theorem Proving (FTP-97), 125-129
Proceedings Article
StuberICLP94Stuber, Jürgen1994Computing Stable Models by Program Transformation
In: Proceedings of the 11th International Conference on Logic Programming (ICLP'94), 58-73
Proceedings Article
StuberRTA96Stuber, Jürgen1996Superposition Theorem Proving for Abelian Groups Represented as Integer Modules
In: Rewriting Techniques and Applications, 7th International Conference, RTA-96, 33-47
Proceedings Article
Suchanek:DA:2005Suchanek, Fabian M.2005Ontological Reasoning for Natural Language Understanding
Universität des Saarlandes
Thesis - Masters thesis
Talbot2000cTalbot, Jean-Marc2000On the Alternation-free Horn mu-calculus
In: Proceedings of the 7th International Conference on Logic for Programming and Automated Reasoning (LPAR-2000), 418-435
Proceedings Article
TalbotDevienneTison_Constraints2000Talbot, Jean-Marc
Devienne, Philippe
Tison, Sophie
2000Generalized Definite Set Constraints
In: Constraints [5], 161-202
Journal Article
TalbotIPL2000Talbot, Jean-Marc2000The $\exists \forall^2$ fragment of the First-Order Theory of Set Constraints is $\pi^0_1$-hard
In: Information Processing Letters [74], 27-33
Journal Article
ThiebauxEtal2003Thiebaux, Sylvie
Hoffmann, Jörg
Nebel, Bernhard
2003In Defense of PDDL Axioms
In: 18th International Joint Conference on Artificial Intelligence, 961-966
Proceedings Article
ThiebauxEtal2005Hoffmann, Jörg2005In Defense of PDDL Axioms
In: Artificial Intelligence [168], 38-69
Journal Article
Timm97Timm, Jan-Georg1997Attachment IconTesting the Satisfiability of RPO Constraints
Universität des Saarlandes
Thesis - Masters thesis
Torre97bvan der Torre, Leendert W. N.
Tan, Yao-Hua
1997Distinguishing different roles in normative reasoning
In: Proceedings of the 6th International Conference on Artificial Intelligence and Law (ICAIL-97), 225-232
Proceedings Article
Torre97cvan der Torre, Leendert W. N.
Tan, Yao-Hua
1997Reasoning about exceptions
In: Proceedings of the 21st Annual German Conference on Artificial Intelligence (KI-97): Advances in Artificial Intelligence, 405-408
Proceedings Article
Torre98.1van der Torre, Leendert W. N.
Tan, Yao-Hua
1999Diagnosis and Decision Making in Normative Reasoning
In: Journal of Artificial Intelligence and Law [7], 51-67
Journal Article
torre:aaai98van der Torre, Leendert W. N.
Tan, Yao-Hua
1998The temporal analysis of Chisholm's paradox
In: Proceedings of the 15th National Conference, and 10th Conference on Innovative Applications of Artificial Intelligence (AAAI-98) and (IAAI-98), 650-655
Proceedings Article
torre:context99van der Torre, Leendert W. N.
Tan, Yao-Hua
1999Contextual Deontic Logic: violation contexts and factual defeasibility
In: Formal Aspects in Context, 173-192
Part of a Book
torre:ecai98van der Torre, Leendert W. N.
Tan, Yao-Hua
1998An update semantics for prima facie obligations
In: Proceedings of the 13th European Conference on Artificial Intelligence (ECAI-98), 38-42
Proceedings Article
torre:ecai98avan der Torre, Leendert W. N.1998Labeled logics of conditional goals
In: Proceedings of the 13th European Conference on Artificial Intelligence (ECAI-98), 368-369
Proceedings Article
torre:ecsqaru99van der Torre, Leendert W. N.1999Defeasible Goals
In: Proceedings of the 5th European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty (ECSQARU-99), 374-385
Proceedings Article
torre:ijcai99van der Torre, Leendert W. N.
Tan, Yao-Hua
1999Rights, Duties and Commitments Between Agents
In: Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99), 1239-1244
Proceedings Article
torre:jelia98van der Torre, Leendert W. N.1998Phased labeled logics of conditional goals
In: Proceedings of the 6th European Workshop on Logics in AI: Logics in Artificial Intelligence (JELIA-98), 92-106
Proceedings Article
torre:jelia98avan der Torre, Leendert W. N.
Tan, Yao-Hua
1998Prohairetic Deontic Logic (PDL)
In: Proceedings of the 6th European Workshop on Logics in AI: Logics in Artificial Intelligence (JELIA-98), 77-91
Proceedings Article
torre:jmai99van der Torre, Leendert W. N.
Tan, Yao-Hua
1999Contrary-to-duty reasoning with preference-based dyadic obligations
In: Annals of Mathematics and Artificial Intelligence [27], 49-78
Journal Article
torre:uai99van der Torre, Leendert W. N.
Tan, Yao-Hua
1999An Update Semantics for Defeasible Obligations
In: Proceedings of the 15th Conference on Uncertainty in Artificial Intelligence (UAI-99), 631-638
Proceedings Article
torre:update99van der Torre, Leendert W. N.
Tan, Yao-Hua
1999An update semantics for deontic reasoning
In: Norms, Logics and Information Systems: New Studies on Deontic Logic and Computer Science, 73-90
Part of a Book
TruegEtal2004Trueg, Sebastian
Hoffmann, Jörg
Nebel, Bernhard
2004Applying Automatic Planning Systems to Airport Ground Traffic Control -- A Feasibility Study
In: KI 2004: Advances in Artificial Intelligence: 27th Annual German Conference on AI, KI 2004, 183-197
Proceedings Article
Tzakova1999Tzakova, Miroslava1999Hybrid Languages
Universität des Saarlandes
Thesis - PhD thesis
Tzakova98aBlackburn, Patrick
Tzakova, Miroslava
1998A Hybrid Concept Language
In: Proceedings of the 5th International Symposium on Artificial Intelligence and Mathematics, ?
Proceedings Article
Tzakova98bBlackburn, Patrick
Tzakova, Miroslava
1998Hybrid Completeness
In: Logic Journal of the IGPL [6], 625-650
Journal Article
Tzakova98cBlackburn, Patrick
Tzakova, Miroslava
1998Hybridizing Concept Languages
In: Annals of Mathematics and Artificial Intelligence [24], 23-49
Journal Article
Tzakova98dBlackburn, Patrick
Tzakova, Miroslava
1998Hybrid Languages and Temporal Logic (Full Version)Report
Tzakova99aBlackburn, Patrick
Tzakova, Miroslava
1999Hybrid Languages and Temporal Logic
In: Logic Journal of the IGPL [7], 27-54
Journal Article
Tzakova99bTzakova, Miroslava1999Tableau Calculi for Hybrid Logics
In: Proceedings of the International Conference TABLEAUX'99 - Automated Reasoning with Analytic Tableaux and Related Methods, 278-292
Proceedings Article
Veanes98Veanes, Margus1998The Relation Between Second-Order Unification and Simultaneous Rigid E-Unification
In: Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science (LICS-98), 264-275
Proceedings Article
Veanes99Veanes, Margus2000Farmer's Theorem Revisited
In: Information Processing Letters [74], 47-53
Journal Article
Veit1999Veit, Jörg1999Formal Fairness Proofs for Optimistic Contract Signing Protocols
Universität des Saarlandes
Thesis - Masters thesis
Vigano97Viganò, Luca1997A Framework for Non-Classical Logics
Universität des Saarlandes
Thesis - PhD thesis
Vorobyov1998CSLVorobyov, Sergei1999Attachment IconSubtyping Functional+Nonempty Record Types
In: Proceedings of the 12th International Workshop on Computer Science Logic (CSL-98), Annual Conference on the EACSL, 285-297
Proceedings Article
Vorobyov1998MFCSVorobyov, Sergei1998Attachment Icon$\forall\exists^\ast$-Equational Theory of Context Unification is $\Pi_1^0$-Hard
In: Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science (MFCS-98), 597-606
Proceedings Article
Vorobyov2000-aecuVorobyov, Sergei2002$\forall\exists^5$-equational theory of context unification is undecidable
In: Theoretical Computer Science [275], 463-479
Journal Article
Vorobyov2000-OSRVorobyov, Sergei2002The undecidability of the first-order theories of one step rewriting in linear canonical systems
In: Information and Computation [175], 182-213
Journal Article
Vorobyov94bVorobyov, Sergei1995Fsub with recursive types: `Types-As-Propositions´ Interpretations in M. Rabin's S2S
In: Proceedings of JFLA'95: Journées Francophones des Langages Applicatifs (JFLA'95), 49-73
Proceedings Article
Vorobyov94hVorobyov, Sergei1995Structural decidable extensions of bounded quantification
In: Proceedings of the 22nd ACM Symposium on Principles of Programming Languages (POPL'95), 164-175
Proceedings Article
Vorobyov96ASIAN96Vorobyov, Sergei1996On the bounded theories of finite trees
In: Second Asian Computing Science Conference, ASIAN'96, 152-161
Proceedings Article
Vorobyov96CADE96Vorobyov, Sergei1996An improved lower bound for the elementary theories of trees
In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), 275-287
Proceedings Article
Vorobyov97LICS97Vorobyov, Sergei1997The `hardest´ natural decidable theory
In: Proceedings of the Twelfth Annual IEEE Symposium on Logic in Computer Science (LICS-97), 294-305
Proceedings Article
Vorobyov97RTA97Vorobyov, Sergei1997The first-order theory of one step rewriting in linear noetherian systems is undecidable
In: Proceedings of the 8th International Conference on Rewriting Techniques and Applications (RTA-97), 254-268
Proceedings Article
VorobyovVoronkov1998PODSVorobyov, Sergei
Voronkov, Andrei
1998Attachment IconComplexity of Nonrecursive Logic Programs with Complex Values
In: Proceedings of the 17th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS-98), 244-253
Proceedings Article
Voronkov99Voronkov, Andrei1999The ground-negative fragment of first-order logics is $\pi^p_2$-complete
In: The Journal of Symbolic Logic [64], 984-990
Journal Article
Waldmann1997Waldmann, Uwe1997Cancellative Abelian Monoids in Refutational Theorem Proving
Universität des Saarlandes
Thesis - PhD thesis
Waldmann1997FTPWaldmann, Uwe1997A Superposition Calculus for Divisible Torsion-Free Abelian Groups
In: Proceedings of the International Workshop on First-Order Theorem Proving (FTP-97), 130-134
Proceedings Article
Waldmann1998Waldmann, Uwe1998Superposition for Divisible Torsion-Free Abelian Groups
In: Proceedings of the 15th International Conference on Automated Deduction (CADE-98), 144-159
Proceedings Article
Waldmann1998IPLWaldmann, Uwe1998Extending reduction orderings to ACU-compatible reduction orderings
In: Information Processing Letters [67], 43-49
Journal Article
Waldmann1999LPARWaldmann, Uwe1999Cancellative Superposition Decides the Theory of Divisible Torsion-Free Abelian Groups
In: Proceedings of the 6th International Conference on Logic for Programming and Automated Reasoning (LPAR-99), 131-147
Proceedings Article
Waldmann2001IJCARWaldmann, Uwe2001Superposition and Chaining for Totally Ordered Divisible Abelian Groups (Extended Abstract)
In: Automated reasoning : First International Joint Conference, IJCAR 2001, 226-241
Proceedings Article
Waldmann2002aJSCWaldmann, Uwe2002Cancellative Abelian Monoids and Related Structures in Refutational Theorem Proving (Part I)
In: Journal of Symbolic Computation [33], 777-829
Journal Article
Waldmann2002bJSCWaldmann, Uwe2002Cancellative Abelian Monoids and Related Structures in Refutational Theorem Proving (Part II)
In: Journal of Symbolic Computation [33], 831-861
Journal Article
Waldmann2002IUCWaldmann, Uwe2002A New Input Technique for Accented Letters in Alphabetical Scripts
In: Proceedings of the 20th International Unicode Conference, C12
Proceedings Article
Waldmann92aWaldmann, Uwe1992Semantics of Order-Sorted Specifications
In: Theoretical Computer Science [94], 1-35
Journal Article
Wang97Wang, Yongge1997Randomization and Approximation Techniques in Computer Science
In: Proceedings of the International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM-97), 209-225
Proceedings Article
WangIPL96aWang, Yongge1997NP-hard sets are superterse unless NP is small
In: Information Processing Letters [61], 1-6
Journal Article
WangTCS96Wang, Yongge1999Randomness, Stochasticity, and Approximation
In: Theory of Computing Systems [32], 517-529
Journal Article
WBH+02-CADE18Weidenbach, Christoph
Brahm, Uwe
Hillenbrand, Thomas
Keen, Enno
Theobalt, Christian
Topić, Dalibor
2002Attachment IconSPASS Version 2.0
In: Automated deduction, CADE-18 : 18th International Conference on Automated Deduction, 275-279
Proceedings Article
Weidenbach1999jarWeidenbach, Christoph1999SPASS V0.95TPTP
In: Journal of Automated Reasoning [23], 21-21
Journal Article
Weidenbach2000habilWeidenbach, Christoph2000Entscheidbarkeitsprobleme für monadische (Horn)Klauselklassen
Universität des Saarlandes, Naturwissenschaftlich-Technische Fakultät
Thesis - Habilitation thesis
Weidenbach2001handbookWeidenbach, Christoph2001Combining Superposition, Sorts and Splitting
In: Handbook of Automated Reasoning, 1965-2013
Part of a Book
Weidenbach92aWeidenbach, Christoph1993A New Sorted Logic
In: GWAI-92: Advances in Artificial Inteligence, Proceedings 16th German Workshop on Artificial Intelligence, 43-54
Proceedings Article
Weidenbach93aWeidenbach, Christoph1993Extending the Resolution Method with Sorts
In: Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI '93), 60-65
Proceedings Article
Weidenbach94aWeidenbach, Christoph1994First-Order Tableaux with Sorts
In: TABLEAUX-'94, 3rd Workshop on Theorem Proving with Analytic Tableaux and Related Methods, 247-261
Proceedings Article
Weidenbach94cWeidenbach, Christoph1994Sorts, Resolution, Tableaux and Propositional Logic
In: KI-94 Workshops: Extended Abstracts, 315-316
Proceedings Article
Weidenbach95dWeidenbach, Christoph1995First-Order Tableaux with Sorts
In: Journal of the Interest Group in Pure and Applied Logics [3], 887-906
Journal Article
Weidenbach95eBarth, Peter
Kleine Büning, Hans
Weidenbach, Christoph
1995Workshop CPL Computational Propositional Logic
In: KI-95 Activities: Workshops, Posters, Demos, 71-72
Proceedings Article
Weidenbach96aWeidenbach, Christoph1996Unification in Pseudo-Linear Sort Theories is Decidable
In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), 343-357
Proceedings Article
Weidenbach96bWeidenbach, Christoph
Gaede, Bernd
Rock, Georg
1996SPASS & FLOTTER, Version 0.42
In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), 141-145
Proceedings Article
Weidenbach96cWeidenbach, Christoph1996Unification in Sort Theories
In: Proceedings of the 10th International Workshop on Unification, UNIF'96, 16-25
Proceedings Article
Weidenbach96dWeidenbach, Christoph1996Sorted Unification and Its Application to Automated Theorem Proving
In: Proceedings of the CADE-13 Workshop: Term Schematizations and Their Applications, 67-76
Proceedings Article
Weidenbach96eWeidenbach, Christoph1996Computational Aspects of a First-Order Logic with Sorts
Universität des Saarlandes
Thesis - PhD thesis
Weidenbach96fWeidenbach, Christoph1996Unification in Sort Theories and its Applications
In: Annals of Mathematics and Artificial Intelligence [18], 261-293
Journal Article
Weidenbach97jarWeidenbach, Christoph1997SPASS Version 0.49
In: Journal of Automated Reasoning [18], 247-252
Journal Article
Weidenbach98kluwerWeidenbach, Christoph1998Sorted Unification and Tree Automata
In: Automated Deduction - A Basis for Applications, 291-320
Part of a Book
Weidenbach98teubnerWeidenbach, Christoph1998Rechnen in sortierter Prädikatenlogik
In: Ausgezeichnete Informatikdissertationen 1997, 183-197
Part of a Book
Weidenbach99cadeWeidenbach, Christoph1999Towards an Automatic Analysis of Security Protocols in First-Order Logic
In: Proceedings of the 16th International Conference on Automated Deduction (CADE-16), 378-382
Proceedings Article
Weidenbach99cadespassWeidenbach, Christoph
Afshordel, Bijan
Brahm, Uwe
Cohrs, Christian
Engel, Thorsten
Keen, Enno
Theobalt, Christian
Topić, Dalibor
1999System Description: SPASS Version 1.0.0
In: Proceedings of the 16th International Conference on Automated Deduction (CADE-16), 314-318
Proceedings Article
WeidenbachMeyerEtAl98jarWeidenbach, Christoph
Meyer, Christoph
Cohrs, Christian
Engel, Thorsten
Keen, Enno
1998SPASS V0.77
In: Journal of Automated Reasoning [21], 113-113
Journal Article
WernerBockmayrKrischer93fWerner, Andreas
Bockmayr, Alexander
Krischer, Stefan
1993How to Realize LSE Narrowing
In: Proceedings of the 2nd International Workshop on Functional/Logic Programming, ?-?
Proceedings Article
WernerBockmayrKrischer93gWerner, Andreas
Bockmayr, Alexander
Krischer, Stefan
1993A Concept for the Implementation of LSE Narrowing
In: 9.~Workshop Logische Programmierung, ?
Proceedings Article
WernerBockmayrKrischer93iWerner, Andreas
Bockmayr, Alexander
Krischer, Stefan
1993How to Realize LSE NarrowingReport
WernerBockmayrKrischer94Werner, Andreas
Bockmayr, Alexander
Krischer, Stefan
1994How to realize LSE narrowing
In: Proceedings of the 4th International Conference on Algebraic and Logic Programming (ALP'94), 59-76
Proceedings Article
WernerBockmayrKrischer98Werner, Andreas
Bockmayr, Alexander
Krischer, Stefan
1998How to realize LSE narrowing
In: New Generation Computing [16], 397-434
Journal Article
Weydert1998aWeydert, Emil1998System JZ : How to build a canonical ranking model of a default knowledge base
In: Proceedings of the 6th International Conference on Principles of Knowledge Representation and Reasoning (KR-98), 190-201
Proceedings Article
Weydert1998bWeydert, Emil1998Minimal information entailment : A preliminary account
In: Proceedings of the 7th International Workshop on Nonmonotonic Reasoning (Workshop on Formal Aspects and Applications of Nonmonotonic Reasoning), 64-72
Proceedings Article
Weydert1998cWeydert, Emil
van der Torre, Leendert W. N.
1998Goals, desires, utilities and preferences
In: Proceedings of the ECAI-98 Workshop : Decision theory meets artificial intelligence - qualitative and quantitative approaches, 57-64
Proceedings Article
Weydert1998dWeydert, Emil1998Some Notes on Nonmonotonic Probabilistic InferenceMiscellaneous
Weydert1999Weydert, Emil1999JZBR - Iterated Belief Change for Conditional Ranking Constraints
In: Spinning Ideas - Electronic Essays Dedicated to Peter Gaerdenfors on His Fiftieth Birthday, 1-11
Part of a Book
Weydert1999aWeydert, Emil1999JZBR - Iterated Belief Change for Conditional Ranking Constraints
In: Proceedings of the 4th Dutch-German Workshop on Nonmonotonic Reasoning Techniques and their Applications (DGNMR-99), 57-66
Proceedings Article
Weydert1999bWeydert, Emil
van der Torre, Leendert W. N.
1999Risk parameters for utilitarian desires
In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-99), Workshop on Practial Reasoning and Rationality, 48-54
Proceedings Article
Weydert2000aWeydert, Emil2000How to revise ranked probabilities
In: Proceedings of the 14th European Conference on Artificial Intelligence (ECAI-00), 38-42
Proceedings Article
Weydert2000bWeydert, Emil2000Thoughts on Evolving Science and Belief
In: Proceedings of the Workshop "Scientific Reasoning in AI and Philosophy of Science" at the 14th European Conference on Artificial Intelligence (ECAI-00), 62-69
Proceedings Article
Weydert2000cWeydert, Emil2000Rankings in flux
In: Proceedings of the 3rd International Conference on Formal and Applied Practical Reasoning (FAPR-00), 37-48
Proceedings Article
Weydert2001aLang, Jérôme
van der Torre, Leendert W. N.
Weydert, Emil
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
Weydert2001bWeydert, Emil2001Rankings we prefer: a rational minimal construction semantics for default reasoning
In: Proceedings of the 5th Dutch-German Workshop on Nonmonotonic Reasoning Techniques and their Applications (DGNMR-01), 1-12
Proceedings Article
Weydert2001cvan der Torre, Leendert W. N.
Weydert, Emil
2001Parameters for Utilitarian Desires in a Qualitative Decision Theory
In: Applied Artificial Intelligence [14], 285-301
Journal Article
Weydert2001dWeydert, Emil2001Defaults, Logic and Probability - A theoretical perspective
In: KI - Künstliche Intelligenz [4/01], 44-49
Journal Article
Weydert2001eWeydert, Emil2001Rankings we prefer: a minimal construction semantics for default reasoning
In: Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU-01), 616-627
Proceedings Article
Weydert2001fLang, Jérôme
van der Torre, Leendert W. N.
Weydert, Emil
2002Utilitarian Desires
In: Autonomous Agents and Multi-Agent Systems [5], 329-363
Journal Article
Weydert93aWeydert, Emil1993Plausible Inference for Default Conditionals
In: Symbolic and Quantitative Approaches to Reasoning and Uncertainty: Proceedings of the European Conference ECSQARU '93, 356-363
Proceedings Article
Weydert93bWeydert, Emil1993Default Quantifiers: About Plausible Reasoning in First-Order Contexts
In: Working Notes of the Dutch/German Workshop on Nonmonotonic Reasoning Techniques and their Applications, ?
Proceedings Article
Weydert94aWeydert, Emil1994General Belief Measures
In: Proceedings of the 10th Conference on Uncertainty in Artificial Intelligence, 575-582
Proceedings Article
Weydert94bWeydert, Emil1994Hyperrational Conditionals
In: Foundations of Knowledge Representation and Reasoning, 310-332
Proceedings Article
Weydert95Weydert, Emil1995Numeric Defaults. About an expressive first-order framework for reasoning with infinitesimal probabilities
In: Symbolic and Quantitative Approaches to Reasoning and Uncertainty (ECSQARU 95), 420-427
Proceedings Article
Weydert95bWeydert, Emil1995Default Entailment. A preferential construction semantics for defeasible inference
In: Advances in Artificial Intelligence: Proceedings of the 19th German Annual Conference on Artificial Intelligence, 173-184
Proceedings Article
Weydert95cWeydert, Emil1995Defaults and Infinitesimals. Defeasible inference by nonarchimedean entropy maximization
In: Proceedings of the 11th Conference on Uncertainty in Artificial Intelligence (UAI 95), 540-547
Proceedings Article
Weydert96aWeydert, Emil1996System J - Revision Entailment: Default Reasoning through Ranking Measure Updates
In: Practical Reasoning - International Conference on Formal and Applied Practical Reasoning, FAPR'96, 637-649
Proceedings Article
Weydert96bWeydert, Emil1996Default Quantifier Logic
In: Proceedings of the ECAI'96 Workshop on Integrating Nonmonotonicity into Automated Reasoning Systems, -
Proceedings Article
Weydert96cWeydert, Emil1996Doxastic Normality Logic: A Qualitative Probabilistic Modal Framework for Defaults and Belief
In: Logic, Action, and Information, 152-171
Part of a Book
Weydert97aWeydert, Brewka, Witteveen (ed.)1997Proceedings of the 3rd Dutch/German Workshop on Nonmonotonic Reasoning Techniques and their Applications (DGNMR-97)Proceedings
Weydert97bWeydert, Emil1997Qualitative Entropy Maximization - A preliminary report
In: Proceedings of the 3rd Dutch/German Workshop on Nonmonotonic Reasoning Techniques and their Applications (DGNMR-97), 63-72
Proceedings Article
Weydert97cWeydert, Emil1997Rational Default Quantifier Logic
In: Proceedings of the 1st International Joint Conference on Qualitative and Quantitative Practical Reasoning (ESQARU-FAPR-97), 589-600
Proceedings Article
Wies2004Wies, Thomas2004Attachment IconSymbolic Shape Analysis
Universität des Saarlandes
Thesis - Masters thesis
WiesETAL06FieldConstraintAnalysisWies, Thomas
Kuncak, Viktor
Lam, Patrick
Podelski, Andreas
Rinard, Martin C.
2006Attachment IconField Constraint Analysis
In: Verification, Model Checking, and Abstract Interpretation : 7th International Conference, VMCAI 2006, 157-173
Proceedings Article
Wu1999Wu, Jinzhao2000First-Order Polynomial based Theorem Proving
In: Mathematics Mechanizations and Applications, 273-294
Part of a Book
Wuliu1998Wu, Jinzhao
Liu, Zhuojun
1998Well-Behaved Inference Rules for First-Order Theorem Proving
In: Journal of Automated Reasoning [21], 381-400
Journal Article
Wulu1998Wu, Jinzhao
Lu, Mi
1998CWA in Multi-Valued Logics
In: Proceedings of the 3rd Asian Symposium on Computer Mathematics (ASCM-98), 259-270
Proceedings Article
Wutanli1998Wu, Jinzhao
Tan, Hongyan
Li, Yongli
1998An Algebraic Method to Decide the Deduction Problem in Many-Valued Logics
In: Journal of Applied Non-Classical Logics [8], 353-360
Journal Article
XiaYang02Xia, Bican
Yang, Lu
2002An Algorithm for Isolating the Real Solutions of Semi-algebraic Systems
In: Journal of Symbolic Computation [34], 461-477
Journal Article
Yoshida94Yoshida, Tetsuja
Bundy, Alan
Green, Ian
Walsh, Toby
Basin, David A.
1994Coloured Rippling: An Extension of a Theorem Proving Heuristic
In: Proceedings of the 12th European Conference on Artificial Intelligence (ECAI'94), 85-89
Proceedings Article
ZeyerDiss1997Zeyer, Jörg1997Eine Beobachtungs-Logik für modulare Sprachen
Universität des Saarlandes
Thesis - PhD thesis

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