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

Publications Master Template

Publications Master Template

Entries sorted by: 1. Author,Editor - 2. by Group - 3. by Names Including [Non Members]

Login to this database


 

Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)
Show entries starting with: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

#YearTitleType
2
Hide details for Lang, van der Torre, Weydert [Lang, van der Torre]Lang, van der Torre, Weydert [Lang, van der Torre]
2002Utilitarian Desires
In: Autonomous Agents and Multi-Agent Systems [5], 329-363
Journal Article
2001Two Kinds of Conflicts between Desires (and how to resolve them)
In: Proceedings of the AAAI Symposium on Game and Decision Theoretic Agents, 54-59
Proceedings Article
2
Hide details for Lee [-]Lee [-]
2009Ranking functions for size-change termination
In: ACM Transactions on Programming Languages and Systems [31], 10:1-10:42
Journal Article
2004Size-change Termination AnalyzerUnpublished/Draft
2
Hide details for Lee, Plaisted [Lee]Lee, Plaisted [Lee]
1994Problem solving by searching for models with a theorem prover
In: Artificial Intelligence [69], 205-233
Journal Article
1994Use of replace rules in theorem proving
In: Methods of Logic in Computer Science [1], 217-240
Journal Article
1
Hide details for Letz, Stenz [Letz, Cialdea Mayer, Pirri]Letz, Stenz [Letz, Cialdea Mayer, Pirri]
2003Universal variables in disconnection tableaux
In: Automated reasoning with analytical tableaux and related methods : International Conference, TABLEAUX 2003, 117-133
Proceedings Article
1
Hide details for Letz, Weidenbach [Letz]Letz, Weidenbach [Letz]
1998Paradigmen und Perspektiven der automatischen Deduktion
In: KI, Organ des Fachbereichs 1 "Künstliche Intelligenz'' der Gesellschaft für Informatik e.V. [4], 15-19
Journal Article
1
Hide details for Leven [-]Leven [-]
1998Integrating Clausal Decision Procedures in a Tactic Based Theorem Prover
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Levy, Veanes [Levy]Levy, Veanes [Levy]
2000On the Undecidability of Second-Order Unification
In: Information and Computation [159], 125-150
Journal Article
1
Hide details for Lilith, Billington, Freiheit [Lilith, Billington]Lilith, Billington, Freiheit [Lilith, Billington]
2006Approximate Closed-Form Aggregation of a Fork-Join Structure in Generalised Stochastic Petri Nets
In: 1st International Conference on Performance Evaluation Methodologies and Tools, ??-??
Proceedings Article
1
Hide details for Löchner, Hillenbrand [Löchner]Löchner, Hillenbrand [Löchner]
2002Attachment IconA Phytography of WALDMEISTER
In: AI Communications [15], 127-133
Journal Article
1
Hide details for Lu, Wu [Lu]Lu, Wu [Lu]
2000On Theorem proving in Annotated Logics
In: Journal of Applied Non-Classical Logics [10], 121-143
Journal Article
3
Hide details for Madden [-]Madden [-]
1995Program improvement by proof planning
In: Proceedings of British Colloquium on Theoretical Computer Science (BCTCS 11),
Proceedings Article
1994Formal Methods for Automated Program Improvement
In: KI-94: Advances in Artificial Intelligence. Proceedings of the 18th German Annual Conference on Artificial Intelligence, 367-378
Proceedings Article
1992Automated Program Transformation Through Proof Transformation
In: Proceedings of the 11th International Conference on Automated Deduction (CADE-11), 446-460
Proceedings Article
1
Hide details for Madden, Bundy [Bundy]Madden, Bundy [Bundy]
1993General Proof Theoretic Techniques for Automatic
Programing
In: Proceedings of the EAST-WEST AI CONFERENCE: From
Theory to Practice - EWAIC'93,
Proceedings Article
1
Hide details for Madden, Bundy, Smaill [Bundy, Smaill]Madden, Bundy, Smaill [Bundy, Smaill]
1999Recursive Program Optimization Through Inductive Synthesis Proof Transformation
In: Journal of Automated Reasoning [22], 65-115
Journal Article
1
Hide details for Madden, Green [Green]Madden, Green [Green]
1995A General Technique for Automatic Optimization by Proof Planning
In: Proceedings of the 2nd International Conference on Artificial Intelligence and Symbolic Mathematical Computing (AISMC-2), 80-96
Proceedings Article
3
Hide details for Maier [-]Maier [-]
2004Attachment IconIntuitionistic LTL and a New Characterization of Safety and LivenessReport
2003Attachment IconA Lattice-Theoretic Framework For Circular Assume-Guarantee Reasoning
Universität des Saarlandes
Thesis - PhD thesis
2002A Framework for Circular Assume-Guarantee Rules
In: Symposium on the Effectiveness of Logic in Computer Science in Honour of Moshe Vardi, 55-58
Proceedings Article
1
Hide details for Maier [Gordon]Maier [Gordon]
2003Compositional Circular Assume-Guarantee Rules Cannot Be Sound and Complete
In: Foundations of software science and computation structures : 6th International Conference, FOSSACS 2003, 343-357
Proceedings Article
1
Hide details for Maier [Marcinkowski, Tarlecki]Maier [Marcinkowski, Tarlecki]
2004Intuitionistic LTL and a New Characterization of Safety and Liveness
In: Computer science logic : 18th International Workshop CSL 2004, 13th Annual Conference of the EACSL, 295-309
Proceedings Article
1
Hide details for Maier [Orejas, Spirakis, van Leeuwen]Maier [Orejas, Spirakis, van Leeuwen]
2001A Set-Theoretic Framework for Assume-Guarantee Reasoning
In: Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP-2001), 821-834
Proceedings Article
2
Hide details for Makinson, van der Torre [Makinson]Makinson, van der Torre [Makinson]
2001Input-output logics
In: Proceedings of the 5th International Workshop on Deontic Logic in Computer Science (Deon-00),, 29
Proceedings Article
2000Input-output logics
In: Journal of Philosophical Logic [29], 383-408
Journal Article
1
Hide details for Malkis, Podelski, Rybalchenko [Barkaoui, Cavalcanti, Cerone]Malkis, Podelski, Rybalchenko [Barkaoui, Cavalcanti, Cerone]
2006Thread-Modular Verification is Cartesian Abstract Interpretation
In: Theoretical Aspects of Computing - ICTAC 2006 : Third International Colloquium, 183-197
Proceedings Article
1
Hide details for Malkis, Podelski, Rybalchenko [Gopalakrishnan, O'Leary]Malkis, Podelski, Rybalchenko [Gopalakrishnan, O'Leary]
2006Attachment IconThread-Modular Verification and Cartesian AbstractionUnpublished/Draft
5
Hide details for Matthews [-]Matthews [-]
1997A practical implementation of simple consequence relations using inductive definitions
In: Proceedings of the 14th International Conference on Automated Deduction (CADE-14), 306-320
Proceedings Article
1997Extending a logical framework with a modal connective for validity
In: Proceedings of the 3rd Symposium on Theoretical Aspects of Computer Software (TACS-97), 491-514
Proceedings Article
1996Implementing $\textrm FS_0$ in Isabelle: Adding Structure at the Metalevel
In: Design and Implementation of Symbolic Computation Systems (DISCO'96), 228-239
Proceedings Article
1994A Theory and its Metatheory in $FS_0$
In: What is a logical system?, 329-354
Part of a Book
1992Reflection in a Logical System
In: Proc.~IMSA '92 Workshop on Reflection and Meta-Level Architecture, 178-183
Proceedings Article
2
Hide details for Matthews, Basin [Basin]Matthews, Basin [Basin]
2000Structuring Metatheory on Inductive Definitions
In: Information and Computation [162], 80-95
Journal Article
1998Scoped Metatheorems
In: Electronic Notes in Computer Science [15], 1-14
Journal Article
1
Hide details for Matthews, Simpson [Simpson]Matthews, Simpson [Simpson]
1996Reflection using the derivability conditions
In: Logic and Algebra, 603-616
Part of a Book
1
Hide details for Matthews, Smaill, Basin [-]Matthews, Smaill, Basin [-]
1993Experience with $FS_0$ as a Framework Theory
In: Logical Environments, 61-82
Part of a Book
1
Hide details for Meter [-]Meter [-]
2009Just a test entry
In: Booktitle, 1001-1010
Proceedings Article
2
Hide details for Meyer [-]Meyer [-]
1999Soft Typing for Clausal Inference Systems
Universität des Saarlandes
Thesis - PhD thesis
1996Attachment IconParallel Unit Resulting Resolution
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Meyer, Faber, Rybalchenko [Meyer, Faber, Barkaoui, Cavalcanti, Cerone]Meyer, Faber, Rybalchenko [Meyer, Faber, Barkaoui, Cavalcanti, Cerone]
2006Model checking Duration Calculus: a practical approach
In: Theoretical Aspects of Computing - ICTAC 2006 : Third International Colloquium, 332-346
Proceedings Article
1
Hide details for Mohr [-]Mohr [-]
1995Resolution-Based Calculi for Modal Logics
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Mukhopadhyay [-]Mukhopadhyay [-]
2001Attachment IconA Uniform Constraint-based Framework for the Verification of Infinite State Systems
Universität des Saarlandes
Thesis - PhD thesis
2
Hide details for Mukhopadhyay, Podelski [-]Mukhopadhyay, Podelski [-]
2001Accurate Widenings and Boundedness Properties of Timed Systems
In: Perspectives of System Informatics: 4th International Andrei Ershov Memorial Conference, 79-94
Proceedings Article
2000Model Checking for Timed Logic Processes
In: Proceedings of the 1st International Conference on Computational Logic, 598-612
Proceedings Article
1
Hide details for Mukhopadhyay, Podelski [Koenig, Holte]Mukhopadhyay, Podelski [Koenig, Holte]
2002An Algebraic Framework for Abstract Model Checking
In: Abstraction, reformulation, and approximation : 5th International Symposium, SARA 2002, 152-169
Proceedings Article
1
Hide details for Mukhopadhyay, Podelski [Ramakrishnan]Mukhopadhyay, Podelski [Ramakrishnan]
2001Attachment IconConstraint Database Models Characterizing Timed Bisimilarity
In: Proceedings of the 3rd International Symposium on Practical Aspects of Declarative Languages, 245-258
Proceedings Article
1
Hide details for Mukhopadhyay, Podelski [Ramanujam, Raman]Mukhopadhyay, Podelski [Ramanujam, Raman]
1999Attachment IconBeyond Region Graphs: Symbolic Forward Analysis of Timed Automata
In: Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS-99), 232-244
Proceedings Article
1
Hide details for Müller, Niehren, Podelski [Müller, Niehren, Bidoit, Dauchet]Müller, Niehren, Podelski [Müller, Niehren, Bidoit, Dauchet]
1997Inclusion Constraints over Non-empty Sets of Trees
In: Proceedings of the 7th International Joint Conference CAAP/FASE: Theory and practice of software development (TAPSOFT-97), 345-356
Proceedings Article
1
Hide details for Müller, Niehren, Podelski [Müller, Niehren, Smolka]Müller, Niehren, Podelski [Müller, Niehren, Smolka]
1997Ordering Constraints over Feature Trees
In: Proceedings of the 3rd International Conference on Principles and Practice of Constraint Programming (CP-97), 549-562
Proceedings Article
1
Hide details for Müller, Niehren, Podelski [Müller, Niehren]Müller, Niehren, Podelski [Müller, Niehren]
2000Ordering Constraints over Feature Trees
In: Constraints [5], 7-41
Journal Article
1
Hide details for Naumann [-]Naumann [-]
1997Integration des automatischen Beweisers SPASS in die mathematische Assistenzumgebung OMEGA
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Nielson, Seidl [Seidl]Nielson, Seidl [Seidl]
2001Control-Flow Analysis in Cubic Time
In: Proceedings of the 10th European Symposium on Programming (ESOP-01) held as part of the Joint European Conferences on Theory and Practice of Software (ETAPS-01), 252-268
Proceedings Article
1
Hide details for Nieuwenhuis, Hillenbrand, Riazanov, Voronkov [Nieuwenhuis, Riazanov, Voronkov, Goré, Leitsch, Nipkow]Nieuwenhuis, Hillenbrand, Riazanov, Voronkov [Nieuwenhuis, Riazanov, Voronkov, Goré, Leitsch, Nipkow]
2001Attachment IconOn the Evaluation of Indexing Techniques for Theorem Proving
In: Automated reasoning : First International Joint Conference, IJCAR 2001, 257-271
Proceedings Article
1
Hide details for Nivat, Podelski [Nivat]Nivat, Podelski [Nivat]
1997Minimal Ascending and Descending Tree Automata
In: SIAM Journal on Computing [26], 39-58
Journal Article
3
Hide details for Nonnengart [-]Nonnengart [-]
2001Strong SkolemizationUnpublished/Draft
1998Modal Frame Characterization by Way of Auxiliary Modalities
In: Logic Journal of the IGPL [6], 875-899
Journal Article
1995A Resolution-Based Calculus for Temporal Logics
Universität des Saarlandes
Thesis - PhD thesis
1
Hide details for Nonnengart [Bajcsy]Nonnengart [Bajcsy]
1993First-Order Modal Logic Theorem Proving and Functional Simulation
In: Proc.~13th Intern.~Joint Conference on Artificial Intelligence (IJCAI '93), 80-85
Proceedings Article
1
Hide details for Nonnengart [MacNish, Pearce, Pereira]Nonnengart [MacNish, Pearce, Pereira]
1994How to Use Modalities and Sorts in Prolog
In: Logics in Artificial Intelligence: Proceedings of the JELIA'94, 365-378
Proceedings Article
1
Hide details for Nonnengart [McRobbie, Slaney]Nonnengart [McRobbie, Slaney]
1996Resolution-Based Calculi for Modal and Temporal Logics
In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), 598-612
Proceedings Article
1
Hide details for Nonnengart, Ohlbach [Bläsius, Bürckert]Nonnengart, Ohlbach [Bläsius, Bürckert]
1992Modal- und Temporallogik
In: Deduktionssysteme - Automatisierung des logischen Denkens, 239-284
Part of a Book
1
Hide details for Nonnengart, Ohlbach, Gabbay [Ohlbach, Gabbay]Nonnengart, Ohlbach, Gabbay [Ohlbach, Gabbay]
2001Encoding two-valued non-classical logics in classic logic
In: Handbook of Automated Reasoning, 1403-1486
Part of a Book
1
Hide details for Nonnengart, Ohlbach, Szalas [Szalas, Ohlbach]Nonnengart, Ohlbach, Szalas [Szalas, Ohlbach]
2001Quantifier Elimination for Second-Order Predicate LogicUnpublished/Draft
1
Hide details for Nonnengart, Rock, Weidenbach [Rock, Kirchner, Kirchner]Nonnengart, Rock, Weidenbach [Rock, Kirchner, Kirchner]
1998On Generating Small Clause Normal Forms
In: Proceedings of the 15th International Conference on Automated Deduction (CADE-98), 397-411
Proceedings Article
1
Hide details for Nonnengart, Szalas [Szalas, Orlowska]Nonnengart, Szalas [Szalas, Orlowska]
1999A Fixpoint Approach to Second-Order Quantifier Elimination with Applications to Correspondence Theory
In: Logic at Work: Essays Dedicated to the Memory of Helena Rasiowa, 18
Part of a Book
1
Hide details for Nonnengart, Weidenbach [Robinson, Voronkov]Nonnengart, Weidenbach [Robinson, Voronkov]
2001Computing small clause normal forms
In: Handbook of Automated Reasoning, 335-367
Part of a Book
8
Hide details for Ohlbach [-]Ohlbach [-]
1995Boolean Algebras with Functions - Correspondence, Completeness and Quantifier EliminationUnpublished/Draft
1995Clause Killer TransformationsUnpublished/Draft
1993Ein kurzes Tutorial über funktionale Übersetzung von Modallogik nach Prädikatenlogik
In: Bericht Nr. 15/93: Recommendations for Extensions to BGP-MS, 19-26
Proceedings Article
1993Thema der Antrittsvorlesung: Transformation logischer Systeme
Universität des Saarlandes
Thesis - Habilitation thesis
1993Translation Methods for Non-Classical Logics: An Overview
In: Bulletin of the Interest Group in Propositional and Predicate Logics (IGPL) [1], 69-90
Journal Article
1992Logic Engineering: Konstruktion von Logiken
In: KI [3], 34-38
Journal Article
1991Semantics Based Translation Methods for Modal Logics
In: Journal of Logic and Computation [1], 691-746
Journal Article
1988A Resolution Calculus for Modal Logics
Universität Kaiserslautern
Thesis - PhD thesis
1
Hide details for Ohlbach [McRobbie, Slaney]Ohlbach [McRobbie, Slaney]
1996SCAN-Elimination of Predicate Quantifiers
In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), 161-165
Proceedings Article
1
Hide details for Ohlbach [Voronkov]Ohlbach [Voronkov]
1993Optimized Translation of Multi Modal Logic into Predicate Logic
In: Proceedings of the 4th International Conference on Logic Programming and Automated Reasoning (LPAR'93), 253-264
Proceedings Article
1
Hide details for Ohlbach, Herzig [-]Ohlbach, Herzig [-]
1991Parameter Structures for Parametrized Modal Operators
In: Proc.~Intern.~Joint Conference on Artificial Intelligence (IJCAI'91), 512-517
Proceedings Article
1
Hide details for Ohlbach, Koehler [Koehler]Ohlbach, Koehler [Koehler]
1996Reasoning about Sets via Atomic DecompositionReport
1
Hide details for Ohlbach, Schmidt [-]Ohlbach, Schmidt [-]
1997Functional Translation and Second-Order Frame Properties of Modal Logics
In: Journal of Logic and Computation [7], 581-603
Journal Article
1
Hide details for Ohlbach, Schmidt, Hustadt [Borgida, Lenzerini, Nardi, Nebel]Ohlbach, Schmidt, Hustadt [Borgida, Lenzerini, Nardi, Nebel]
1995Symbolic Arithmetical Reasoning with Qualified Number Restrictions
In: Proceedings of International Workshop on Description Logics'95, 89-95
Proceedings Article
1
Hide details for Ohlbach, Schmidt, Hustadt [Wansing]Ohlbach, Schmidt, Hustadt [Wansing]
1996Translating Graded Modalities into Predicate Logic
In: Proof Theory of Modal Logic, 253-291
Part of a Book
1
Hide details for Ohlbach, Siekmann [-]Ohlbach, Siekmann [-]
1991The Markgraf Karl Refutation Procedure
In: Computational Logic, Essays in Honor of Alan Robinson, 41-112
Proceedings Article
1
Hide details for Ohlbach, Weidenbach [-]Ohlbach, Weidenbach [-]
1995A Note on Assumptions about Skolem Functions
In: Journal of Automated Reasoning [15], 267-275
Journal Article
1
Hide details for Pacholski, Podelski [Pacholski, Smolka]Pacholski, Podelski [Pacholski, Smolka]
1997Set Constraints: a Pearl in Research on Constraints
In: Proceedings of the 3rd International Conference on Principles and Practice of Constraint Programming (CP-97), 549-562
Proceedings Article
1
Hide details for Piskac [-]Piskac [-]
2005Formal Correctness of Result Checking for Priority Queues
Universität des Saarlandes
Thesis - Masters thesis
2
Hide details for Plaisted [-]Plaisted [-]
1994The Search Efficiency of Theorem Proving Strategies
In: Proceedings of the 12th International Conference on Automated Deduction (CADE-12), 57-71
Proceedings Article
1993Equational Reasoning and Term Rewriting Systems
In: Handbook of Logic in Artificial Intelligence and Logic Programming, 273-364
Proceedings Article
1
Hide details for Pnueli, Podelski, Rybalchenko [Pnueli, Halbwachs, Zuck]Pnueli, Podelski, Rybalchenko [Pnueli, Halbwachs, Zuck]
2005Separating Fairness and Well-Foundedness for the Analysis of Fair Discrete Systems
In: Tools and Algorithms for the Construction and Analysis of Systems: 11th International Conference, TACAS 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, 124-139
Proceedings Article
1
Hide details for Podelski (ed.) [-]Podelski (ed.) [-]
1995Constraint Programming: Basics and Trends
In: Constraint Programming: Basics and Trends, 328
Proceedings
2
Hide details for Podelski [-]Podelski [-]
1998Thema der Antrittsvorlesung: Alte Resultate aus der Automatentheorie
Universität des Saarlandes
Thesis - Habilitation thesis
1997Set-Based Analysis of Logic Programs and Reactive Logic Programs
In: Proceedings of the International Symposium on Logic Programming (ILPS-14), 35-36
Proceedings Article
1
Hide details for Podelski [Leuschel]Podelski [Leuschel]
2004Introduction to the Special Issue on Verification and Computational Logic
In: Theory and Practice of Logic Programming (TPLP) [4], 541-751
Journal Article
1
Hide details for Podelski [Palsberg]Podelski [Palsberg]
2000Model Checking as Constraint Solving
In: Proceedings of the 7th International Symposium on Static Analysis (SAS-00), 221-237
Proceedings Article
1
Hide details for Podelski [Zuck, Attie, Cortesi, Mukhopadhyay]Podelski [Zuck, Attie, Cortesi, Mukhopadhyay]
2003Software Model Checking with Abstraction Refinement
In: Verification, model checking, and abstract interpretation : 4th International Conference, VMCAI 2003, 1-13
Proceedings Article
1
Hide details for Podelski, Ball, Rajamani [Ball, Rajamani, Ball, Rajamani]Podelski, Ball, Rajamani [Ball, Rajamani, Ball, Rajamani]
2003Boolean and Cartesian Abstraction for Model Checking C Programs
In: International Journal on Software Tools for Technology Transfer (STTT) [5], 1-15
Journal Article
1
Hide details for Podelski, Ball, Rajamani [Ball, Rajamani, Kaoen, Stevens]Podelski, Ball, Rajamani [Ball, Rajamani, Kaoen, Stevens]
2002Relative Completeness of Abstraction Refinement for Software Model Checking
In: Tools and algorithms for the construction and analysis of systems : 8th International Conference, TACAS 2002, 158-172
Proceedings Article
1
Hide details for Podelski, Charatonik, Müller [Müller, Swierstra]Podelski, Charatonik, Müller [Müller, Swierstra]
1999Set-based Failure Analysis for Logic Programs and Concurrent Constraint Programs
In: Programming Languages and Systems: Proceedings of the 8th European Symposium on Programming (ESOP-99), 177-192
Proceedings Article
2
Hide details for Podelski, Rybalchenko [-]Podelski, Rybalchenko [-]
2007Transition Predicate Abstraction and Fair Termination
In: ACM Transactions on Programming Languages and Systems [29], 30
Journal Article
2004Transition Invariants
In: Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, LICS 2004, 32-41
Proceedings Article
1
Hide details for Podelski, Rybalchenko [Levi, Steffen]Podelski, Rybalchenko [Levi, Steffen]
2004A Complete Method for the Synthesis of Linear Ranking Functions
In: Verification, model checking, and abstract interpretation : 5th International Conference, VMCAI 2004, 239-251
Proceedings Article
1
Hide details for Podelski, Rybalchenko [Palsberg, Abadi]Podelski, Rybalchenko [Palsberg, Abadi]
2005Transition predicate abstraction and fair termination
In: Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2005, 124-139
Proceedings Article
1
Hide details for Podelski, Rybalchenko [Podelski]Podelski, Rybalchenko [Podelski]
2007Attachment IconARMC: The Logical Choice for Software Model Checking with Abstraction Refinement
In: Practical aspects of declarative languages : 9th International Symposium, PADL 2007, 245-259
Proceedings Article
1
Hide details for Podelski, Rybalchenko, Cook [Cook]Podelski, Rybalchenko, Cook [Cook]
2005Counterexample-Guided Abstraction Refinement for TerminationUnpublished/Draft
1
Hide details for Podelski, Schaefer, Wagner [-]Podelski, Schaefer, Wagner [-]
2004Attachment IconSummaries for While Programs with RecursionReport
1
Hide details for Podelski, Schaefer, Wagner [Sagiv]Podelski, Schaefer, Wagner [Sagiv]
2005Attachment IconSummaries for While Programs with Recursion
In: Programming Languages and Systems: 14th European Symposium on Programming, ESOP 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, 94-107
Proceedings Article
2
Hide details for Podelski, Smolka [-]Podelski, Smolka [-]
1995Operational Semantics of Constraint Logic Programming with Coroutining
In: Proceedings of the 12th International Conference on Logic Programming, 449-463
Proceedings Article
1995Situated Simplification
In: Proceedings of the First International Conference on Principles and Practice of Constraint Programming (CP'95), 328-344
Proceedings Article
1
Hide details for Podelski, Smolka [Smolka]Podelski, Smolka [Smolka]
1997Situated Simplification
In: Theoretical Computer Science [173], 235-252
Journal Article
1
Hide details for Podelski, Wagner [Hespanha, Tiwari]Podelski, Wagner [Hespanha, Tiwari]
2006Model Checking of Hybrid Systems: From Reachability towards Stability
In: Hybrid Systems: Computation and Control : 9th International Workshop, HSCC 2006
, 507-521
Proceedings Article
2
Hide details for Podelski, Wagner [Podelski]Podelski, Wagner [Podelski]
2007Attachment IconA Method and a Tool for Automatic Verification of Region Stability for Hybrid SystemsReport
2007Attachment IconA Sound and Complete Proof Rule for Region Stability of Hybrid Systems
In: Hybrid systems: computation and control : 10th International Conference, HSCC 2007, 750-753
Poster
1
Hide details for Podelski, Wies [Hankin, Siveroni]Podelski, Wies [Hankin, Siveroni]
2005Boolean Heaps
In: Static analysis : 12th International Symposium, SAS 2005, 268-283
Proceedings Article
1
Hide details for Prevosto [Coquand, Lombardi, Roy]Prevosto [Coquand, Lombardi, Roy]
2006Certified mathematical hierarchies: the FoCal system.
In: Proceedings of the MAP (Mathematics, Algorithms, Proofs) Workshop,
Electronic Proceedings Article
1
Hide details for Prevosto, Boulmé [Boulmé, Urzyczyn]Prevosto, Boulmé [Boulmé, Urzyczyn]
2005Proof Contexts with Late Binding
In: Typed Lambda Calculi and Applications: 7th International Conference, TLCA 2005, 325-339
Proceedings Article
1
Hide details for Prevosto, Waldmann [Prevosto, Sutcliffe, Schmidt, Schulz]Prevosto, Waldmann [Prevosto, Sutcliffe, Schmidt, Schulz]
2006SPASS+T
In: ESCoR: FLoC'06 Workshop on Empirically Successful Computerized Reasoning, 18-33
Proceedings Article
1
Hide details for Rahman, Rückert, Fischmann [Rahman, Rückert]Rahman, Rückert, Fischmann [Rahman, Rückert]
1997Dialogues and Ontology, the Dialogical Approach to Free Logic
In: Logique et Analyse [160], 357-374
Journal Article
2
Hide details for Ratschan [-]Ratschan [-]
2006Efficient Solving of Quantified Inequality Constraints over the Real Numbers
In: ACM Transactions on Computational Logic [7], 723-748
Journal Article
2004Convergent Approximate Solving of First-order Constraints by Approximate Quantifiers
In: ACM Transactions on Computational Logic [5], 264-281
Journal Article
1
Hide details for Ratschan [Dolzmann, Seidl, Sturm]Ratschan [Dolzmann, Seidl, Sturm]
2005Solving Undecidable Problems in the Theory of Real Numbers and Hybrid Systems
In: Algorithmic Algebra and Logic; Conference in Honor of the 60th Birthday of Volker Weispfenning, 213-216
Proceedings Article
1
Hide details for Ratschan [Rossi]Ratschan [Rossi]
2003Solving Existentially Quantified Constraints with One Equality and Arbitrarily Many Inequalities
In: Principles and practice on constraint programming - CP 2003 : 9th International Conference, CP 2003, 615-633
Proceedings Article
2
Hide details for Ratschan, She [-]Ratschan, She [-]
2007Attachment IconSafety Verification of Hybrid Systems by Constraint Propagation Based Abstraction Refinement
In: ACM Transactions in Embedded Computing Systems [6], 1-23
Journal Article
2005Safety Verification of Hybrid Systems by Constraint Propagation Based Abstraction Refinement
In: Hybrid Systems: Computation and Control: 8th International Workshop, HSCC 2005, 573-589
Proceedings Article
1
Hide details for Ratschan, She [Calmet, Ida, Wang]Ratschan, She [Calmet, Ida, Wang]
2006Constraints for Continuous Reachability in the Verification of Hybrid Systems
In: Artificial Intelligence and Symbolic Computation, 8th International Conference, AISC 2006, 196-210
Proceedings Article
1
Hide details for Ratschan, Smaus [Smaus, Cassandras, Giua, Seatzu, Zaytoon]Ratschan, Smaus [Smaus, Cassandras, Giua, Seatzu, Zaytoon]
2006Verification-Integrated Falsification of Non-Deterministic Hybrid Systems
In: 2nd IFAC Conference on Analysis and Design of Hybrid Systems, ?
Proceedings Article
1
Hide details for Ratschan, Vehi [Bittanti]Ratschan, Vehi [Bittanti]
2004Attachment IconRobust Pole Clustering of Parametric Uncertain Systems Using Interval Methods
In: Robust control design 2003 : (ROCOND 2003) ; a proceedings volume from the 4th IFAC symposium, 323-328
Proceedings Article
1
Hide details for Rau [-]Rau [-]
1997Adaption of a Fuzzy Controller for a Cybernetic System through an Evolutionary Algorithm
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Reinold [-]Reinold [-]
1991Transformation in dichten Wäldern
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Rock [-]Rock [-]
1995Attachment IconTransformations of First-Order Formulae for Automated Reasoning
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Rybalchenko [-]Rybalchenko [-]
2002Attachment IconA Model Checker based on Abstraction Refinement
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Rybalchenko [Malkis, Podelski, Filé, Nielson]Rybalchenko [Malkis, Podelski, Filé, Nielson]
2007Precise Thread-Modular Verification
In: 14th International Static Analysis Symposium (SAS 2007), ?
Proceedings Article
1
Hide details for Rybalchenko, Sofronie-Stokkermans [Cook, Podelski]Rybalchenko, Sofronie-Stokkermans [Cook, Podelski]
2007Constraint Solving for Interpolation
In: 8th International Conference on Verification, Model Checking and Abstract Interpretation (VMCAI 2007), ?
Proceedings Article
1
Hide details for Schäf [-]Schäf [-]
2006Attachment IconAbstrakte Übergangsrelationen als Mittel zur Verifikation von Programmeigenschaften
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Schlobach [-]Schlobach [-]
1996Untersuchung nicht-monotoner Logiken - Fallstudie zur Automatisierung
Universität des Saarlandes
Thesis - Masters thesis
6
Hide details for Schmidt [-]Schmidt [-]
1999Decidability by Resolution for Propositional Modal Logics
In: Journal of Automated Reasoning [22], 379-396
Journal Article
1997Optimised Modal Translation and Resolution
Universität des Saarlandes
Thesis - PhD thesis
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
1994Peirce Algebras and Their Applications in Artificial Intelligence and Computational Linguistics: Abstract
In: SIGALA Newsletter [2], 27-27
Journal Article
1994Terminological Logics and Conceptual Graphs: An Historical Perspective
In: KI-94 Workshops: Extended Abstracts, 135-136
Proceedings Article
1993Terminological Representation, Natural Language \& Relation Algebra
In: GWAI-92: Advances in Artificial Intelligence: Proc.~16th German Workshop on Artificial Intelligence, 357-371
Proceedings Article
1
Hide details for Schmidt [Böttner, Thümmel]Schmidt [Böttner, Thümmel]
2000Relational Grammars for Knowledge Representation
In: Variable-Free Semantics, 162-180
Part of a Book
1
Hide details for Schmidt [Kracht, de Rijke, Wansing, Zakharyaschev]Schmidt [Kracht, de Rijke, Wansing, Zakharyaschev]
1998Resolution is a Decision Procedure for Many Propositional Modal Logics
In: Advances in Modal Logic, Volume 1, 189-208
Part of a Book
1
Hide details for Schmidt [Nipkow]Schmidt [Nipkow]
1998E-Unification for Subsystems of S4
In: Proceedings of the 9th International Conference on Rewriting Techniques and Applications (RTA-98), 106-120
Proceedings Article
1
Hide details for Schmidt, Hustadt [Hustadt, Baader]Schmidt, Hustadt [Hustadt, Baader]
2003A Principle for Incorporating Axioms into the First-Order Translation of Modal Formulae
In: Automated deduction, CADE-19 : 19th International Conference on Automated Deduction, 412-426
Proceedings Article
1
Hide details for Schmidt, Orłowska, Hustadt [Or{Schmidt, Orłowska, Hustadt [Or{
1
Hide details for l}owska, Hustadt, Berghammer, Möller, Struth]l}owska, Hustadt, Berghammer, Möller, Struth]
2004Two Proof Systems for Peirce Algebras
In: Relational and Kleene-Algebraic Methods in Computer Science: 7th International Seminar on Relational Methods in Computer Science and 2nd International Workshop on Applications of Kleene Algebra, 238-251
Proceedings Article
1
Hide details for Schmidt, Tishkovsky [Balbiani, Suzuki, Wolter, Zakharyaschev, Schmidt, Tishkovsky]Schmidt, Tishkovsky [Balbiani, Suzuki, Wolter, Zakharyaschev, Schmidt, Tishkovsky]
2003Combining Dynamic Logic and Doxastic Modal Logics
In: Advances in Modal Logic, 371-391
Part of a Book
1
Hide details for Schmidt, Tishkovsky [Schmidt, Tishkovsky, Flesca, Greco, Leone, Ianni]Schmidt, Tishkovsky [Schmidt, Tishkovsky, Flesca, Greco, Leone, Ianni]
2002Multi-Agent Logic of Dynamic Belief and Knowledge
In: Proceedings of the 8th European Conference on Logics in Artificial Intelligence (JELIA), 38-49
Proceedings Article
1
Hide details for Schmidt, Tishkovsky [Schmidt, Tishkovsky]Schmidt, Tishkovsky [Schmidt, Tishkovsky]
2003Multi-Agent Logic of Dynamic Belief and KnowledgeUnpublished/Draft
1
Hide details for Schmidt, Tishkovsky [Tishkovsky]Schmidt, Tishkovsky [Tishkovsky]
2004Multi-Agent Dynamic Logics with Informational Test
In: Annals of Mathematics and Artificial Intelligence [42], 5-36
Journal Article
1
Hide details for Schmidt, Tishkovsky, Hustadt [Schmidt, Tishkovsky, Hustadt]Schmidt, Tishkovsky, Hustadt [Schmidt, Tishkovsky, Hustadt]
2002Interaction between Knowledge, Action and Commitment within Agent Dynamic LogicUnpublished/Draft
1
Hide details for Schmidt, Tishkovsky, Hustadt [Tishkovsky, Hustadt]Schmidt, Tishkovsky, Hustadt [Tishkovsky, Hustadt]
2004Interaction between Knowledge, Action and Commitment within Agent Dynamic Logic
In: Studia Logica [78], 381-415
Journal Article
1
Hide details for Schmolzi [-]Schmolzi [-]
1999Kooperative koevolutionäre Entwicklung von Fuzzy-Reglern
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for She, Ratschan [-]She, Ratschan [-]
2006Providing a Basin of Attraction to a Target Region by Computation of Lyapunov-like Functions
In: 4th IEEE International Conference on Computational Cybernetics, 245-249
Proceedings Article
1
Hide details for She, Xia, Xiao [Xiao, Kovalerchuk]She, Xia, Xiao [Xiao, Kovalerchuk]
2006A Semi-Algebraic Approach for the Computation of Lyapunov Functions
In: 2th IASTED International Conference on COMPUTATIONAL INTELLIGENCE, 7-12
Proceedings Article
1
Hide details for Simon, Freiheit, Olbrich [Simon, Olbrich, Nüttgens, Rump, Mendling]Simon, Freiheit, Olbrich [Simon, Olbrich, Nüttgens, Rump, Mendling]
2006Using BPEL processes defined by Event-driven Process Chains
In: 5. GI-Workshop "EPK 2006 - Geschäftsprozessmanagement mit Ereignisgesteuerten Prozessketten", 121-135
Proceedings Article
1
Hide details for Smaus [-]Smaus [-]
1996Finding Resolution K-Transformations
Universität des Saarlandes
Thesis - Masters thesis
8
Hide details for Socher-Ambrosius [-]Socher-Ambrosius [-]
1994A Refined Version of General E-Unification
In: Proceedings of the 12th International Conference on Automated Deduction (CADE-12), 665-677
Proceedings Article
1993Unification in Order-Sorted Logic with Term Declarations
In: Proceedings of the 4th Conference on Logic Programming and Automated Reasoning (LPAR-93), 301-308
Proceedings Article
1992A Goal Oriented Strategy Based on Completion
In: Proc.~3rd Intern.~Conference on Algebraic and Logic Programming, 435-445
Proceedings Article
1992How to Avoid the Derivation of Redundant Clauses in Reasoning Systems
In: Journal of Automated Reasoning [9], 325-336
Journal Article
1991Boolean Algebra Admits no Convergent Term Rewriting System
In: Proceedings of the 4th International Conference on Rewriting Techniques and Applications (RTA-91), 264-274
Proceedings Article
1991On the Church-Rosser Property in Left-Linear SystemsReport
1991On the Relation Between Completion Based and Resolution Based Theorem Proving
In: Journal of Symbolic Computation [11], 129-148
Journal Article
1991Optimizing the Clausal Normal Form Transformation
In: Journal of Automated Reasoning [7], 325-336
Journal Article
14
Hide details for Sofronie-Stokkermans [-]Sofronie-Stokkermans [-]
2007Attachment IconAutomated theorem proving by resolution in non-classic logics
In: Discrete Applied Mathematics [?], ?
Journal Article
2007Attachment IconOn unification for bounded distributive lattices
In: ACM Transactions on Computational Logic [8], ?
Journal Article
2006Sheaves and geometric logic in concurrency
In: Proceedings of the Eighth Workshop on Geometric and Topological Methods in Concurrency (GETCO 2006), ?
Proceedings Article
2004Algebraic and logical methods in automated theorem proving and in the study of concurrency
Universität des Saarlandes
Thesis - Habilitation thesis
2004Resolution-based decision procedures for the positive theory of some finitely generated varieties of algebras
In: Proceedings of the 34th International Symposium on Multiple-Valued Logic (ISMVL-2004), 32-37
Proceedings Article
2003Attachment IconResolution-based decision procedures for the universal theory of some classes of distributive lattices with operators
In: Journal of Symbolic Computation [36], 891-924
Journal Article
2001Attachment IconAutomated Theorem Proving by Resolution for Finitely-Valued Logics Based on Distributive Lattices with Operators
In: Multiple-Valued Logic - An International Journal [6], 289-344
Journal Article
2001Representation theorems and the semantics of (semi)lattice-based logics
In: Proceedings of the 31st IEEE International Symposium on Multiple-Valued Logics, 125-134
Proceedings Article
2000Attachment IconDuality and Canonical Extensions of Bounded Distributive Lattices with Operators and Applications to the Semantics of Non-Classical Logics. Part I
In: Studia Logica [64], 93-132
Journal Article
2000Attachment IconDuality and Canonical Extensions of Bounded Distributive Lattices with Operators and Applications to the Semantics of Non-Classical Logics. Part II
In: Studia Logica [64], 151-172
Journal Article
2000Attachment IconPriestley Duality for SHn-algebras and Applications to the Study of Kripke-style Models for SHn-logics
In: Multiple-Valued Logic - An International Journal [5], 281-305
Journal Article
1999Attachment IconOn the Universal Theory of Varieties of Distributive Lattices with Operators: Some Decidability and Complexity Results
In: Proceedings of the 16th International Conference on Automated Deduction (CADE-16), 157-171
Proceedings Article
1999Representation Theorems and Automated Theorem Proving in Non-Classical Logics
In: Proceedings of the 29th IEEE International Symposium on Multiple-Valued Logic (ISMVL-99), 242-247
Proceedings Article
1998Attachment IconResolution-based Theorem Proving for SHn-LogicsReport
1
Hide details for Sofronie-Stokkermans [Autexier, Mantel]Sofronie-Stokkermans [Autexier, Mantel]
2006Local reasoning in verification
In: Proceedings of VERIFY'06: Verification Workshop, 128-145
Electronic Proceedings Article
1
Hide details for Sofronie-Stokkermans [Cachro, Kijania-Placek]Sofronie-Stokkermans [Cachro, Kijania-Placek]
1999Resolution-based theorem proving for non-classical logics based on distributive lattices with operators
In: Proceedings of the 11th International Congress of Logic, Methodology and Philosophy of Science. Volume of abstracts, 481-481
Proceedings Article
1
Hide details for Sofronie-Stokkermans [Caferra, Salzer, Caferra, Salzer]Sofronie-Stokkermans [Caferra, Salzer, Caferra, Salzer]
2000Attachment IconResolution-based theorem proving for SHn-logics
In: Automated Deduction in Classical and Non-Classical Logic (Selected Papers of FTP'98), 268-282
Proceedings Article
1
Hide details for Sofronie-Stokkermans [Egly, Fermüller]Sofronie-Stokkermans [Egly, Fermüller]
2002Attachment IconOn uniform word problems involving bridging operators on distributive lattices
In: Automated Reasoning with Analytic and Related Methods : International Conference, TABLEAUX 2002, 235-250
Proceedings Article
1
Hide details for Sofronie-Stokkermans [Eklund, Escalada-Imaz, Haehnle, Vojtas]Sofronie-Stokkermans [Eklund, Escalada-Imaz, Haehnle, Vojtas]
1998Representation Theorems and Automated Theorem Proving in Certain Classes of Non-Classical Logics
In: Proceedings of the Workshop on Many-Valued Logic for AI Applications (ECAI-98), ?-?
Proceedings Article
1
Hide details for Sofronie-Stokkermans [Fitting, Orlowska]Sofronie-Stokkermans [Fitting, Orlowska]
2003Attachment IconRepresentation Theorems and the Semantics of Non-classical Logics, and Applications to Automated Theorem Proving
In: Beyond Two: Theory and Applications of Multiple Valued Logic, 59-100
Part of a Book
1
Hide details for Sofronie-Stokkermans [Furbach, Shankar]Sofronie-Stokkermans [Furbach, Shankar]
2006Attachment IconInterpolation in local theory extensions
In: Proceedings of IJCAR 2006, 235-250
Proceedings Article
1
Hide details for Sofronie-Stokkermans [Iturrioz, Orlowska, Turunen]Sofronie-Stokkermans [Iturrioz, Orlowska, Turunen]
2000Some properties of Kleene algebras
In: COST Action 15 (Many-Valued Logics for Computer Science Applications) ATLAS of Many-Valued Structures, 1-7
Part of a Book
1
Hide details for Sofronie-Stokkermans [McAllester]Sofronie-Stokkermans [McAllester]
2000Attachment IconOn unification for bounded distributive lattices
In: Proceedings of the 17th International Conference on Automated Deduction (CADE-17), 465-481
Proceedings Article
1
Hide details for Sofronie-Stokkermans [Nadif, Napoli, SanJuan, Sigayret]Sofronie-Stokkermans [Nadif, Napoli, SanJuan, Sigayret]
2003Attachment IconAutomated theorem proving by resolution in non-classical logics
In: Fourth International Conference Journees de l'Informatique Messine: Knowledge Discovery and Discrete Mathematics (JIM-03), 151-167
Proceedings Article
1
Hide details for Sofronie-Stokkermans [Nieuwenhuis]Sofronie-Stokkermans [Nieuwenhuis]
2005Attachment IconHierarchic reasoning in local theory extensions
In: Automated deduction - CADE-20 : 20th International Conference on Automated Deduction, 219-234
Proceedings Article
1
Hide details for Sofronie-Stokkermans [Prade]Sofronie-Stokkermans [Prade]
1998On Translation of Finitely-Valued Logics to Classical First-Order Logic
In: Proceedings of the 13th European Conference on Artificial Intelligence (ECAI-98), 410-411
Proceedings Article
1
Hide details for Sofronie-Stokkermans [Vaz de Carvalho, Ferreirim]Sofronie-Stokkermans [Vaz de Carvalho, Ferreirim]
1999Priestley representation for distributive lattices with operators and applications to automated theorem proving
In: Dualities, Interpretability and Ordered Structures, 43-54
Proceedings Article
1
Hide details for Sofronie-Stokkermans, Stokkermans [Stokkermans, Ciobanu, Paun]Sofronie-Stokkermans, Stokkermans [Stokkermans, Ciobanu, Paun]
1999Attachment IconModeling Interaction by Sheaves and Geometric Logic
In: Proceedings of the 12th International Symposium Fundamentals of Computation Theory (FCT-99), 512-523
Proceedings Article
3
Hide details for Struth [-]Struth [-]
1998Canonical Transformation in Algebra, Universal Algebra and Logic
Universität des Saarlandes
Thesis - PhD thesis
1994Intensionality, Possible Worlds and Propositional Attitudes: Formal and Philosophical Foundations of Modal Semantics
In: KI-94 Workshops: Extended Abstracts, 108-109
Proceedings Article
1994Philosophical Logics: A Survey and a BibliographyReport
1
Hide details for Struth [Comon]Struth [Comon]
1997On the Word Problem for Free Lattices
In: Proceedings of the 8th International Conference on Rewriting Techniques and Applications (RTA-97), 128-141
Proceedings Article
6
Hide details for Stuber [-]Stuber [-]
2000Deriving Theory Superposition Calculi from Convergent Term Rewriting Systems
In: Proceedings of the 11th International Conference Rewriting Techniques and Applications (RTA-00), 229-245
Proceedings Article
1999Attachment IconSuperposition Theorem Proving for Commutative Algebraic Theories
Universität des Saarlandes
Thesis - PhD thesis
1998Superposition theorem proving for abelian groups represented as integer modules
In: Theoretical Computer Science [208], 149-177
Journal Article
1996Superposition Theorem Proving for Abelian Groups Represented as Integer Modules
In: Rewriting Techniques and Applications, 7th International Conference, RTA-96, 33-47
Proceedings Article
1994Computing Stable Models by Program Transformation
In: Proceedings of the 11th International Conference on Logic Programming (ICLP'94), 58-73
Proceedings Article
1991Attachment IconInductive Theorem Proving for Horn Clauses
Universität Dortmund
Thesis - Masters thesis
1
Hide details for Stuber [Bibel, Schmitt]Stuber [Bibel, Schmitt]
1998Superposition theorem proving for commutative rings
In: Automated Deduction - A Basis for Applications. Volume III. Applications, 31-55
Part of a Book
1
Hide details for Stuber [Bonacina, Furbach]Stuber [Bonacina, Furbach]
1997Strong Symmetrization, Semi-Compatibility of Normalized Rewriting and First-Order Theorem Proving
In: Proceedings of the International Workshop on First-Order Theorem Proving (FTP-97), 125-129
Proceedings Article
1
Hide details for Stuber [Narendran, Rusinowitch]Stuber [Narendran, Rusinowitch]
1999Theory path orderings
In: Proceedings of the 10th International Conference on Rewriting Techniques and Applications (RTA-99), 148-162
Proceedings Article
1
Hide details for Suchanek [-]Suchanek [-]
2005Ontological Reasoning for Natural Language Understanding
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Talbot [-]Talbot [-]
2000The $\exists \forall^2$ fragment of the First-Order Theory of Set Constraints is $\pi^0_1$-hard
In: Information Processing Letters [74], 27-33
Journal Article
1
Hide details for Talbot [Parigot, Voronkov]Talbot [Parigot, Voronkov]
2000On the Alternation-free Horn mu-calculus
In: Proceedings of the 7th International Conference on Logic for Programming and Automated Reasoning (LPAR-2000), 418-435
Proceedings Article
1
Hide details for Talbot, Devienne, Tison [Devienne, Tison]Talbot, Devienne, Tison [Devienne, Tison]
2000Generalized Definite Set Constraints
In: Constraints [5], 161-202
Journal Article
1
Hide details for Talbot, Niehren, Müller [Niehren, Müller, Longo]Talbot, Niehren, Müller [Niehren, Müller, Longo]
1999Entailment of Atomic Set Constraints is PSPACE-Complete
In: Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science (LICS-99), 285-294
Proceedings Article
1
Hide details for Thiebaux, Hoffmann, Nebel [Thiebaux, Nebel, Gottlob]Thiebaux, Hoffmann, Nebel [Thiebaux, Nebel, Gottlob]
2003In Defense of PDDL Axioms
In: 18th International Joint Conference on Artificial Intelligence, 961-966
Proceedings Article
1
Hide details for Timm [-]Timm [-]
1997Attachment IconTesting the Satisfiability of RPO Constraints
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Trueg, Hoffmann, Nebel [Trueg, Nebel, Biundo, Frühwirth, Palm]Trueg, Hoffmann, Nebel [Trueg, Nebel, Biundo, Frühwirth, Palm]
2004Applying Automatic Planning Systems to Airport Ground Traffic Control -- A Feasibility Study
In: KI 2004: Advances in Artificial Intelligence: 27th Annual German Conference on AI, KI 2004, 183-197
Proceedings Article
1
Hide details for Tzakova [-]Tzakova [-]
1999Hybrid Languages
Universität des Saarlandes
Thesis - PhD thesis
1
Hide details for Tzakova [Murray]Tzakova [Murray]
1999Tableau Calculi for Hybrid Logics
In: Proceedings of the International Conference TABLEAUX'99 - Automated Reasoning with Analytic Tableaux and Related Methods, 278-292
Proceedings Article
2
Hide details for van der Torre [-]van der Torre [-]
1998Labeled logics of conditional goals
In: Proceedings of the 13th European Conference on Artificial Intelligence (ECAI-98), 368-369
Proceedings Article
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
1
Hide details for van der Torre [Hunter, Parsons]van der Torre [Hunter, Parsons]
1999Defeasible Goals
In: Proceedings of the 5th European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty (ECSQARU-99), 374-385
Proceedings Article
1
Hide details for van der Torre, Tan [Tan, Cavalcanti]van der Torre, Tan [Tan, Cavalcanti]
1999Contextual Deontic Logic: violation contexts and factual defeasibility
In: Formal Aspects in Context, 173-192
Part of a Book
1
Hide details for van der Torre, Tan [Tan, Laskey, Prade]van der Torre, Tan [Tan, Laskey, Prade]
1999An Update Semantics for Defeasible Obligations
In: Proceedings of the 15th Conference on Uncertainty in Artificial Intelligence (UAI-99), 631-638
Proceedings Article
1
Hide details for van der Torre, Tan [Tan, McNamara, Prakken]van der Torre, Tan [Tan, McNamara, Prakken]
1999An update semantics for deontic reasoning
In: Norms, Logics and Information Systems: New Studies on Deontic Logic and Computer Science, 73-90
Part of a Book
8
Hide details for van der Torre, Tan [Tan]van der Torre, Tan [Tan]
1999Contrary-to-duty reasoning with preference-based dyadic obligations
In: Annals of Mathematics and Artificial Intelligence [27], 49-78
Journal Article
1999Diagnosis and Decision Making in Normative Reasoning
In: Journal of Artificial Intelligence and Law [7], 51-67
Journal Article
1999Rights, Duties and Commitments Between Agents
In: Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99), 1239-1244
Proceedings Article
1998An update semantics for prima facie obligations
In: Proceedings of the 13th European Conference on Artificial Intelligence (ECAI-98), 38-42
Proceedings Article
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
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
1997Distinguishing different roles in normative reasoning
In: Proceedings of the 6th International Conference on Artificial Intelligence and Law (ICAIL-97), 225-232
Proceedings Article
1997Reasoning about exceptions
In: Proceedings of the 21st Annual German Conference on Artificial Intelligence (KI-97): Advances in Artificial Intelligence, 405-408
Proceedings Article
1
Hide details for van der Torre, Weydert [van der Torre]van der Torre, Weydert [van der Torre]
2001Parameters for Utilitarian Desires in a Qualitative Decision Theory
In: Applied Artificial Intelligence [14], 285-301
Journal Article
2
Hide details for Veanes [-]Veanes [-]
2000Farmer's Theorem Revisited
In: Information Processing Letters [74], 47-53
Journal Article
1998The Relation Between Second-Order Unification and Simultaneous Rigid E-Unification
In: Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science (LICS-98), 264-275
Proceedings Article
1
Hide details for Veit [-]Veit [-]
1999Formal Fairness Proofs for Optimistic Contract Signing Protocols
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Viganò [-]Viganò [-]
1997A Framework for Non-Classical Logics
Universität des Saarlandes
Thesis - PhD thesis
5
Hide details for Vorobyov [-]Vorobyov [-]
2002The undecidability of the first-order theories of one step rewriting in linear canonical systems
In: Information and Computation [175], 182-213
Journal Article
2002$\forall\exists^5$-equational theory of context unification is undecidable
In: Theoretical Computer Science [275], 463-479
Journal Article
1998Attachment Icon$\forall\exists^\ast$-Equational Theory of Context Unification is $\Pi_1^0$-Hard
In: Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science (MFCS-98), 597-606
Proceedings Article
1995Fsub with recursive types: `Types-As-Propositions´ Interpretations in M. Rabin's S2S
In: Proceedings of JFLA'95: Journées Francophones des Langages Applicatifs (JFLA'95), 49-73
Proceedings Article
1995Structural decidable extensions of bounded quantification
In: Proceedings of the 22nd ACM Symposium on Principles of Programming Languages (POPL'95), 164-175
Proceedings Article
1
Hide details for Vorobyov [Comon]Vorobyov [Comon]
1997The first-order theory of one step rewriting in linear noetherian systems is undecidable
In: Proceedings of the 8th International Conference on Rewriting Techniques and Applications (RTA-97), 254-268
Proceedings Article
1
Hide details for Vorobyov [Gottlob, Grandjean, Seyr]Vorobyov [Gottlob, Grandjean, Seyr]
1999Attachment IconSubtyping Functional+Nonempty Record Types
In: Proceedings of the 12th International Workshop on Computer Science Logic (CSL-98), Annual Conference on the EACSL, 285-297
Proceedings Article
1
Hide details for Vorobyov [Jaffar, Yap]Vorobyov [Jaffar, Yap]
1996On the bounded theories of finite trees
In: Second Asian Computing Science Conference, ASIAN'96, 152-161
Proceedings Article
1
Hide details for Vorobyov [McRobbie, Slaney]Vorobyov [McRobbie, Slaney]
1996An improved lower bound for the elementary theories of trees
In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), 275-287
Proceedings Article
1
Hide details for Vorobyov [Winskel]Vorobyov [Winskel]
1997The `hardest´ natural decidable theory
In: Proceedings of the Twelfth Annual IEEE Symposium on Logic in Computer Science (LICS-97), 294-305
Proceedings Article
1
Hide details for Vorobyov, Voronkov [-]Vorobyov, Voronkov [-]
1998Attachment IconComplexity of Nonrecursive Logic Programs with Complex Values
In: Proceedings of the 17th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS-98), 244-253
Proceedings Article
1
Hide details for Voronkov [-]Voronkov [-]
1999The ground-negative fragment of first-order logics is $\pi^p_2$-complete
In: The Journal of Symbolic Logic [64], 984-990
Journal Article
1
Hide details for Wagner, Podelski [Podelski, Raskin, Thiagarajan]Wagner, Podelski [Podelski, Raskin, Thiagarajan]
2007Region Stability Proofs for Hybrid Systems
In: Formal Modelling and Analysis of Timed Systems: 5th International Conference, FORMATS 2007, 16
Proceedings Article
6
Hide details for Waldmann [-]Waldmann [-]
2002A New Input Technique for Accented Letters in Alphabetical Scripts
In: Proceedings of the 20th International Unicode Conference, C12
Proceedings Article
2002Cancellative Abelian Monoids and Related Structures in Refutational Theorem Proving (Part II)
In: Journal of Symbolic Computation [33], 831-861
Journal Article
2002Cancellative Abelian Monoids and Related Structures in Refutational Theorem Proving (Part I)
In: Journal of Symbolic Computation [33], 777-829
Journal Article
1998Extending reduction orderings to ACU-compatible reduction orderings
In: Information Processing Letters [67], 43-49
Journal Article
1997Cancellative Abelian Monoids in Refutational Theorem Proving
Universität des Saarlandes
Thesis - PhD thesis
1992Semantics of Order-Sorted Specifications
In: Theoretical Computer Science [94], 1-35
Journal Article
1
Hide details for Waldmann [Bonacina, Furbach]Waldmann [Bonacina, Furbach]
1997A Superposition Calculus for Divisible Torsion-Free Abelian Groups
In: Proceedings of the International Workshop on First-Order Theorem Proving (FTP-97), 130-134
Proceedings Article
1
Hide details for Waldmann [Goré, Leitsch, Nipkow]Waldmann [Goré, Leitsch, Nipkow]
2001Superposition and Chaining for Totally Ordered Divisible Abelian Groups (Extended Abstract)
In: Automated reasoning : First International Joint Conference, IJCAR 2001, 226-241
Proceedings Article
1
Hide details for Waldmann [Kirchner, Kirchner]Waldmann [Kirchner, Kirchner]
1998Superposition for Divisible Torsion-Free Abelian Groups
In: Proceedings of the 15th International Conference on Automated Deduction (CADE-98), 144-159
Proceedings Article
1
Hide details for Waldmann [McAllester, Voronkov]Waldmann [McAllester, Voronkov]
1999Cancellative Superposition Decides the Theory of Divisible Torsion-Free Abelian Groups
In: Proceedings of the 6th International Conference on Logic for Programming and Automated Reasoning (LPAR-99), 131-147
Proceedings Article
3
Hide details for Wang [-]Wang [-]
1999Randomness, Stochasticity, and Approximation
In: Theory of Computing Systems [32], 517-529
Journal Article
1997NP-hard sets are superterse unless NP is small
In: Information Processing Letters [61], 1-6
Journal Article
1997Randomization and Approximation Techniques in Computer Science
In: Proceedings of the International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM-97), 209-225
Proceedings Article
11
Hide details for Weidenbach [-]Weidenbach [-]
2000Entscheidbarkeitsprobleme für monadische (Horn)Klauselklassen
Universität des Saarlandes, Naturwissenschaftlich-Technische Fakultät
Thesis - Habilitation thesis
1999SPASS V0.95TPTP
In: Journal of Automated Reasoning [23], 21-21
Journal Article
1999Towards an Automatic Analysis of Security Protocols in First-Order Logic
In: Proceedings of the 16th International Conference on Automated Deduction (CADE-16), 378-382
Proceedings Article
1997SPASS Version 0.49
In: Journal of Automated Reasoning [18], 247-252
Journal Article
1996Computational Aspects of a First-Order Logic with Sorts
Universität des Saarlandes
Thesis - PhD thesis
1996Unification in Sort Theories and its Applications
In: Annals of Mathematics and Artificial Intelligence [18], 261-293
Journal Article
1995First-Order Tableaux with Sorts
In: Journal of the Interest Group in Pure and Applied Logics [3], 887-906
Journal Article
1994First-Order Tableaux with Sorts
In: TABLEAUX-'94, 3rd Workshop on Theorem Proving with Analytic Tableaux and Related Methods, 247-261
Proceedings Article
1994Sorts, Resolution, Tableaux and Propositional Logic
In: KI-94 Workshops: Extended Abstracts, 315-316
Proceedings Article
1993A New Sorted Logic
In: GWAI-92: Advances in Artificial Inteligence, Proceedings 16th German Workshop on Artificial Intelligence, 43-54
Proceedings Article
1993Extending the Resolution Method with Sorts
In: Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI '93), 60-65
Proceedings Article
1
Hide details for Weidenbach [Bibel, Schmitt]Weidenbach [Bibel, Schmitt]
1998Sorted Unification and Tree Automata
In: Automated Deduction - A Basis for Applications, 291-320
Part of a Book
1
Hide details for Weidenbach [Fiedler, Gorny, Grass, Hoelldobler, Hotz, Kerner, Reischuk]Weidenbach [Fiedler, Gorny, Grass, Hoelldobler, Hotz, Kerner, Reischuk]
1998Rechnen in sortierter Prädikatenlogik
In: Ausgezeichnete Informatikdissertationen 1997, 183-197
Part of a Book
1
Hide details for Weidenbach [Hermann, Salzer]Weidenbach [Hermann, Salzer]
1996Sorted Unification and Its Application to Automated Theorem Proving
In: Proceedings of the CADE-13 Workshop: Term Schematizations and Their Applications, 67-76
Proceedings Article
1
Hide details for Weidenbach [McRobbie, Slaney]Weidenbach [McRobbie, Slaney]
1996Unification in Pseudo-Linear Sort Theories is Decidable
In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), 343-357
Proceedings Article
1
Hide details for Weidenbach [Robinson, Voronkov]Weidenbach [Robinson, Voronkov]
2001Combining Superposition, Sorts and Splitting
In: Handbook of Automated Reasoning, 1965-2013
Part of a Book
1
Hide details for Weidenbach [Schulz, Kepser]Weidenbach [Schulz, Kepser]
1996Unification in Sort Theories
In: Proceedings of the 10th International Workshop on Unification, UNIF'96, 16-25
Proceedings Article
1
Hide details for Weidenbach, Afshordel, Brahm, Cohrs, Engel, Keen, Theobalt, Topić [-]Weidenbach, Afshordel, Brahm, Cohrs, Engel, Keen, Theobalt, Topić [-]
1999System Description: SPASS Version 1.0.0
In: Proceedings of the 16th International Conference on Automated Deduction (CADE-16), 314-318
Proceedings Article
1
Hide details for Weidenbach, Brahm, Hillenbrand, Keen, Theobalt, Topić [Voronkov]Weidenbach, Brahm, Hillenbrand, Keen, Theobalt, Topić [Voronkov]
2002Attachment IconSPASS Version 2.0
In: Automated deduction, CADE-18 : 18th International Conference on Automated Deduction, 275-279
Proceedings Article
1
Hide details for Weidenbach, Gaede, Rock [Gaede, Rock, McRobbie, Slaney]Weidenbach, Gaede, Rock [Gaede, Rock, McRobbie, Slaney]
1996SPASS & FLOTTER, Version 0.42
In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), 141-145
Proceedings Article
1
Hide details for Weidenbach, Meyer, Cohrs, Engel, Keen [-]Weidenbach, Meyer, Cohrs, Engel, Keen [-]
1998SPASS V0.77
In: Journal of Automated Reasoning [21], 113-113
Journal Article
3
Hide details for Werner, Bockmayr, Krischer [-]Werner, Bockmayr, Krischer [-]
1993A Concept for the Implementation of LSE Narrowing
In: 9.~Workshop Logische Programmierung, ?
Proceedings Article
1993How to Realize LSE NarrowingReport
1993How to Realize LSE Narrowing
In: Proceedings of the 2nd International Workshop on Functional/Logic Programming, ?-?
Proceedings Article
2
Hide details for Werner, Bockmayr, Krischer [Werner, Krischer]Werner, Bockmayr, Krischer [Werner, Krischer]
1998How to realize LSE narrowing
In: New Generation Computing [16], 397-434
Journal Article
1994How to realize LSE narrowing
In: Proceedings of the 4th International Conference on Algebraic and Logic Programming (ALP'94), 59-76
Proceedings Article
7
Hide details for Weydert [-]Weydert [-]
2001Defaults, Logic and Probability - A theoretical perspective
In: KI - Künstliche Intelligenz [4/01], 44-49
Journal Article
2001Rankings we prefer: a minimal construction semantics for default reasoning
In: Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU-01), 616-627
Proceedings Article
2000Thoughts on Evolving Science and Belief
In: Proceedings of the Workshop "Scientific Reasoning in AI and Philosophy of Science" at the 14th European Conference on Artificial Intelligence (ECAI-00), 62-69
Proceedings Article
1998Some Notes on Nonmonotonic Probabilistic InferenceMiscellaneous
1994Hyperrational Conditionals
In: Foundations of Knowledge Representation and Reasoning, 310-332
Proceedings Article
1993Default Quantifiers: About Plausible Reasoning in First-Order Contexts
In: Working Notes of the Dutch/German Workshop on Nonmonotonic Reasoning Techniques and their Applications, ?
Proceedings Article
1993Plausible Inference for Default Conditionals
In: Symbolic and Quantitative Approaches to Reasoning and Uncertainty: Proceedings of the European Conference ECSQARU '93, 356-363
Proceedings Article
1
Hide details for Weydert [Besnard, Hanks]Weydert [Besnard, Hanks]
1995Defaults and Infinitesimals. Defeasible inference by nonarchimedean entropy maximization
In: Proceedings of the 11th Conference on Uncertainty in Artificial Intelligence (UAI 95), 540-547
Proceedings Article
1
Hide details for Weydert [Brewka, Witteveen, Schaub]Weydert [Brewka, Witteveen, Schaub]
2001Rankings we prefer: a rational minimal construction semantics for default reasoning
In: Proceedings of the 5th Dutch-German Workshop on Nonmonotonic Reasoning Techniques and their Applications (DGNMR-01), 1-12
Proceedings Article
1
Hide details for Weydert [Brewka, Witteveen]Weydert [Brewka, Witteveen]
1997Qualitative Entropy Maximization - A preliminary report
In: Proceedings of the 3rd Dutch/German Workshop on Nonmonotonic Reasoning Techniques and their Applications (DGNMR-97), 63-72
Proceedings Article
1
Hide details for Weydert [Cohn, Schubert, Shapiro]Weydert [Cohn, Schubert, Shapiro]
1998System JZ : How to build a canonical ranking model of a default knowledge base
In: Proceedings of the 6th International Conference on Principles of Knowledge Representation and Reasoning (KR-98), 190-201
Proceedings Article
1
Hide details for Weydert [Cunningham, Gabbay]Weydert [Cunningham, Gabbay]
2000Rankings in flux
In: Proceedings of the 3rd International Conference on Formal and Applied Practical Reasoning (FAPR-00), 37-48
Proceedings Article
1
Hide details for Weydert [de Leon, Wallin, Hulth]Weydert [de Leon, Wallin, Hulth]
1999JZBR - Iterated Belief Change for Conditional Ranking Constraints
In: Spinning Ideas - Electronic Essays Dedicated to Peter Gaerdenfors on His Fiftieth Birthday, 1-11
Part of a Book
1
Hide details for Weydert [Delgrande, Truszczynski]Weydert [Delgrande, Truszczynski]
1998Minimal information entailment : A preliminary account
In: Proceedings of the 7th International Workshop on Nonmonotonic Reasoning (Workshop on Formal Aspects and Applications of Nonmonotonic Reasoning), 64-72
Proceedings Article
1
Hide details for Weydert [Froideveaux, Kohlas]Weydert [Froideveaux, Kohlas]
1995Numeric Defaults. About an expressive first-order framework for reasoning with infinitesimal probabilities
In: Symbolic and Quantitative Approaches to Reasoning and Uncertainty (ECSQARU 95), 420-427
Proceedings Article
1
Hide details for Weydert [Fuhrmann, Rott]Weydert [Fuhrmann, Rott]
1996Doxastic Normality Logic: A Qualitative Probabilistic Modal Framework for Defaults and Belief
In: Logic, Action, and Information, 152-171
Part of a Book
1
Hide details for Weydert [Gabbay, Kruse]Weydert [Gabbay, Kruse]
1997Rational Default Quantifier Logic
In: Proceedings of the 1st International Joint Conference on Qualitative and Quantitative Practical Reasoning (ESQARU-FAPR-97), 589-600
Proceedings Article
1
Hide details for Weydert [Gabbay, Ohlbach]Weydert [Gabbay, Ohlbach]
1996System J - Revision Entailment: Default Reasoning through Ranking Measure Updates
In: Practical Reasoning - International Conference on Formal and Applied Practical Reasoning, FAPR'96, 637-649
Proceedings Article
1
Hide details for Weydert [Horn]Weydert [Horn]
2000How to revise ranked probabilities
In: Proceedings of the 14th European Conference on Artificial Intelligence (ECAI-00), 38-42
Proceedings Article
1
Hide details for Weydert [Lopez de Mantaraz, Poole]Weydert [Lopez de Mantaraz, Poole]
1994General Belief Measures
In: Proceedings of the 10th Conference on Uncertainty in Artificial Intelligence, 575-582
Proceedings Article
1
Hide details for Weydert [Niemelä]Weydert [Niemelä]
1996Default Quantifier Logic
In: Proceedings of the ECAI'96 Workshop on Integrating Nonmonotonicity into Automated Reasoning Systems, -
Proceedings Article
1
Hide details for Weydert [Rott, Albert, Brewka, Witteveen]Weydert [Rott, Albert, Brewka, Witteveen]
1999JZBR - Iterated Belief Change for Conditional Ranking Constraints
In: Proceedings of the 4th Dutch-German Workshop on Nonmonotonic Reasoning Techniques and their Applications (DGNMR-99), 57-66
Proceedings Article
1
Hide details for Weydert [Wachsmuth, Rollinger, Brauer]Weydert [Wachsmuth, Rollinger, Brauer]
1995Default Entailment. A preferential construction semantics for defeasible inference
In: Advances in Artificial Intelligence: Proceedings of the 19th German Annual Conference on Artificial Intelligence, 173-184
Proceedings Article
1
Hide details for Weydert, Brewka, Witteveen (ed.) [Brewka, Witteveen]Weydert, Brewka, Witteveen (ed.) [Brewka, Witteveen]
1997Proceedings of the 3rd Dutch/German Workshop on Nonmonotonic Reasoning Techniques and their Applications (DGNMR-97)Proceedings
1
Hide details for Weydert, van der Torre [Lang]Weydert, van der Torre [Lang]
1998Goals, desires, utilities and preferences
In: Proceedings of the ECAI-98 Workshop : Decision theory meets artificial intelligence - qualitative and quantitative approaches, 57-64
Proceedings Article
1
Hide details for Weydert, van der Torre [van der Torre]Weydert, van der Torre [van der Torre]
1999Risk parameters for utilitarian desires
In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-99), Workshop on Practial Reasoning and Rationality, 48-54
Proceedings Article
1
Hide details for Wies [-]Wies [-]
2004Attachment IconSymbolic Shape Analysis
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Wies, Kuncak, Lam, Podelski, Rinard [Kuncak, Lam, Rinard, Emerson, Namjoshi]Wies, Kuncak, Lam, Podelski, Rinard [Kuncak, Lam, Rinard, Emerson, Namjoshi]
2006Attachment IconField Constraint Analysis
In: Verification, Model Checking, and Abstract Interpretation : 7th International Conference, VMCAI 2006, 157-173
Proceedings Article
1
Hide details for Wu [Gao, Wang]Wu [Gao, Wang]
2000First-Order Polynomial based Theorem Proving
In: Mathematics Mechanizations and Applications, 273-294
Part of a Book
1
Hide details for Wu, Liu [Liu]Wu, Liu [Liu]
1998Well-Behaved Inference Rules for First-Order Theorem Proving
In: Journal of Automated Reasoning [21], 381-400
Journal Article
1
Hide details for Wu, Lu [Lu]Wu, Lu [Lu]
1998CWA in Multi-Valued Logics
In: Proceedings of the 3rd Asian Symposium on Computer Mathematics (ASCM-98), 259-270
Proceedings Article
1
Hide details for Wu, Tan, Li [Tan, Li]Wu, Tan, Li [Tan, Li]
1998An Algebraic Method to Decide the Deduction Problem in Many-Valued Logics
In: Journal of Applied Non-Classical Logics [8], 353-360
Journal Article
1
Hide details for Xia, Yang [Yang]Xia, Yang [Yang]
2002An Algorithm for Isolating the Real Solutions of Semi-algebraic Systems
In: Journal of Symbolic Computation [34], 461-477
Journal Article
1
Hide details for Yoshida, Bundy, Green, Walsh, Basin [Yoshida, Green, Walsh]Yoshida, Bundy, Green, Walsh, Basin [Yoshida, Green, Walsh]
1994Coloured Rippling: An Extension of a Theorem Proving Heuristic
In: Proceedings of the 12th European Conference on Artificial Intelligence (ECAI'94), 85-89
Proceedings Article
1
Hide details for Yuan, Billington, Freiheit [Yuan, Billington]Yuan, Billington, Freiheit [Yuan, Billington]
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
1
Hide details for Zeyer [-]Zeyer [-]
1997Eine Beobachtungs-Logik für modulare Sprachen
Universität des Saarlandes
Thesis - PhD thesis
782

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