max planck institut
informatik

# Publications Master Template

## Publications Master Template

### Entries sorted by: 5. Year - 8. Counting Publications

#### 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

#YAuthor/EditorTitle
1
 Thesis - Masters thesis
2
 2009
16
 2007
43
 2006
41
 2005
37
 2004
36
 2003
39
 2002
58
 2001
48
 2000
61
 1999
73
 1998
42
 1997
64
 1996
1
 Book
6
 Part of a Book
1
 Proceedings
35
 Proceedings Article
Ayari, Abdelwaheb
Basin, David A.
Generic System Support for Deductive Program Development
In: Second International Workshop, TACAS'96: Tools and Algorithms for the Construction and Analysis of Systems, 313-328
Barth, Peter
Bockmayr, Alexander
Modelling 0-1 Problems in CLP($\cal PB$)
In: Proceedings of the Second International Conference on Practical Application of Constraint Technology, 1-9
Basin, David A.
Friedrich, Stefan
Modeling a hardware synthesis methodology in Isabelle
In: Theorem Proving in Higher Order Logics. 9th International Conference, TPHOLs'96, 33-50
Basin, David A.
Ganzinger, Harald
Complexity Analysis Based on Ordered Resolution
In: Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science (LICS'96), 456-465
Basin, David A.
Matthews, Seán
Structuring metatheory on inductive definitions
In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), 171-185
Basin, David A.
Matthews, Seán
Viganò, Luca
Implementing 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
Bockmayr, AlexanderConstraints in functional logic programming (Abstract)
In: Integration of functional and logic languages, 4
Bockmayr, Alexander
Barth, Peter
Kasper, Thomas
Methods and Tools for Pseudo-Boolean Problems
In: 2. Workshop Boolesche Probleme, 105-109
Bockmayr, Alexander
Kasper, Thomas
Pseudo-Boolean and Finite Domain Constraint Programming: A Case Study
In: Deklarative Constraint Programmierung, 29-41
Cantu, Francisco
Bundy, Alan
Smaill, Alan
Basin, David A.
Experiments in Automating Hardware Verification using Inductive Proof Planning
In: Proceedings of the Formal Methods for Computer-Aided Design Conference (FMCAD'96), 94-108
Charatonik, Witold
Podelski, Andreas
The 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
Ganzinger, HaraldSaturation-based theorem proving (abstract)
In: Automata, Languages and Programming: International Colloquium (ICALP-23), 1-3
Ganzinger, Harald
Waldmann, Uwe
Theorem Proving in Cancellative Abelian Monoids (Extended Abstract)
In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), 388-402
Graf, PeterPath indexing for AC-theories
In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), 718-732
Graf, Peter
Meyer, Christoph
Advanced indexing operations on substitution trees
In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), 553-567
Hopf, Jörn
Rau, Rainer
Decision Making in an Economy Exploiting Fuzzy Rules Obtained from a Genetic Algorithm
In: Soft Computing with Industrial Applications, 331-336
Jaeger, ManfredRepresentation Independence of Nonmonotonic Inference Relations
In: Principles of Knowledge Representation and Reasoning, Proceedings of the 5th International Conference (KR-96), 461-472
Jaeger, Manfred
Mannila, Heikki
Weydert, Emil
Data Mining as Selective Theory Extraction in Probabilistic Logic
In: Proceedings of the 1996 SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, -
Krishna Rao, M. R. K.A class of Prolog programs inferable from positive data
In: Algorithmic Learning Theory, 272-284
Krishna Rao, M. R. K.Completeness results for basic narrowing in non-copying implementations
In: Logic Programming, 393-407
Krishna Rao, M. R. K.Learning Prolog programs from examples
In: Knowledge Based Computer Systems, 19-30
Krishna Rao, M. R. K.Modularity of termination in term graph rewriting
In: Rewriting Techniques and Applications, 230-244
Krishna Rao, M. R. K.Some characteristics of strong innermost normalization
In: Algebraic Methodology and Software Technology, 5th International Conference, AMAST '96, 406-420
Matthews, SeánImplementing $\textrm FS_0$ in Isabelle: Adding Structure at the Metalevel
In: Design and Implementation of Symbolic Computation Systems (DISCO'96), 228-239
Nonnengart, AndreasResolution-Based Calculi for Modal and Temporal Logics
In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), 598-612
Ohlbach, Hans JürgenSCAN-Elimination of Predicate Quantifiers
In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), 161-165
Stuber, JürgenSuperposition Theorem Proving for Abelian Groups Represented as Integer Modules
In: Rewriting Techniques and Applications, 7th International Conference, RTA-96, 33-47
Vorobyov, SergeiAn improved lower bound for the elementary theories of trees
In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), 275-287
Vorobyov, SergeiOn the bounded theories of finite trees
In: Second Asian Computing Science Conference, ASIAN'96, 152-161
Weidenbach, ChristophSorted Unification and Its Application to Automated Theorem Proving
In: Proceedings of the CADE-13 Workshop: Term Schematizations and Their Applications, 67-76
Weidenbach, ChristophUnification in Pseudo-Linear Sort Theories is Decidable
In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), 343-357
Weidenbach, ChristophUnification in Sort Theories
In: Proceedings of the 10th International Workshop on Unification, UNIF'96, 16-25
Weidenbach, Christoph
Gaede, Bernd
Rock, Georg
SPASS & FLOTTER, Version 0.42
In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), 141-145
Weydert, EmilDefault Quantifier Logic
In: Proceedings of the ECAI'96 Workshop on Integrating Nonmonotonicity into Automated Reasoning Systems, -
Weydert, EmilSystem J - Revision Entailment: Default Reasoning through Ranking Measure Updates
In: Practical Reasoning - International Conference on Formal and Applied Practical Reasoning, FAPR'96, 637-649
7
 Journal Article
6
 Report
6
 Thesis - Masters thesis
1
 Thesis - PhD thesis
1
 Thesis - Habilitation thesis
55
 1995
64
 1994
47
 1993
26
 1992
26
 1991
2
 1990
1
 1988
782

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