| 2008 |
|---|
| 80 | EE | Christoph Beierle,
Gabriele Kern-Isberner:
A Verified AsmL Implementation of Belief Revision.
ABZ 2008: 98-111 |
| 79 | EE | Christoph Beierle,
Gabriele Kern-Isberner,
Nicole Koch:
A High-Level Implementation of a System for Automated Reasoning with Default Rules (System Description).
IJCAR 2008: 147-153 |
| 2007 |
|---|
| 78 | | Jens Fisseler,
Gabriele Kern-Isberner,
Christoph Beierle:
Learning Uncertain Rules with CONDORCKD.
FLAIRS Conference 2007: 74-79 |
| 77 | EE | Jens Fisseler,
Gabriele Kern-Isberner,
Christoph Beierle,
Andreas Koch,
Christian Müller:
Algebraic Knowledge Discovery Using Haskell.
PADL 2007: 80-93 |
| 2006 |
|---|
| 76 | | Manfred Widera,
Barbara Messing,
Gabriele Kern-Isberner,
Malte Isberner,
Christoph Beierle:
Computer Science Exercises in a Virtual University.
CSREA EEE 2006: 23-29 |
| 75 | | Immo Schulz-Gerlach,
Christoph Beierle:
Ein erweiterbares interaktives Online-Übungssystem mit Aufgaben zu Aussagen- und Prädikatenlogik.
DeLFI 2006: 243-254 |
| 74 | EE | Manfred Widera,
Barbara Messing,
Gabriele Kern-Isberner,
Malte Isberner,
Christoph Beierle:
An Extendable System for the Specification and Generation of Interactive Self-tests.
Edutainment 2006: 316-321 |
| 73 | | Christoph Beierle,
Gabriele Kern-Isberner:
A Note on Comparing Semantics for Conditionals.
FLAIRS Conference 2006: 794-799 |
| 2005 |
|---|
| 72 | | Christoph Beierle,
Malte Isberner,
Gabriele Kern-Isberner,
Barbara Messing,
Manfred Widera:
Generierung interaktiver Selbsttestaufgaben im Bereich der formalen Grundlagen der Informatik aus XML-Spezifikationen.
DeLFI 2005: 523-524 |
| 71 | EE | Christoph Beierle,
Oliver Dusso,
Gabriele Kern-Isberner:
Using Answer Set Programming for a Decision Support System.
LPNMR 2005: 374-378 |
| 70 | EE | Christoph Beierle,
Gabriele Kern-Isberner:
Footprints of Conditionals.
Mechanizing Mathematical Reasoning 2005: 99-119 |
| 69 | EE | Gabriele Kern-Isberner,
Christoph Beierle,
Oliver Dusso:
Modelling and Implementing a Knowledge Base for Checking Medical Invoices with DLV.
Nonmonotonic Reasoning, Answer Set Programming and Constraints 2005 |
| 2004 |
|---|
| 68 | EE | Christoph Beierle,
Marija Kulas,
Manfred Widera:
A Pragmatic Approach to Pre-testing Prolog Programs.
INAP/WLP 2004: 294-308 |
| 2003 |
|---|
| 67 | EE | Christoph Beierle,
Gabriele Kern-Isberner:
Modelling Conditional Knowledge Discovery and Belief Revision by Abstract State Machines.
Abstract State Machines 2003: 186-203 |
| 66 | | Christoph Beierle,
Marjaa Kulaa,
Manfred Widera:
Automatic Analysis of Programming Assignments.
DeLFI 2003: 144-153 |
| 65 | EE | Christoph Beierle,
Gabriele Kern-Isberner:
An Alternative View of Knowledge Discovery.
HICSS 2003: 68 |
| 64 | EE | Christoph Beierle,
Gabriele Kern-Isberner:
A Logical Study on Qualitative Default Reasoning with Probabilities.
LPAR 2003: 376-388 |
| 2002 |
|---|
| 63 | | Christoph Beierle,
Gabriele Kern-Isberner:
On the Interpretation of Uncertain Rules in Prepositional Logic.
IC-AI 2002: 522-528 |
| 62 | EE | Christoph Beierle,
Gabriele Kern-Isberner:
Using Institutions for the Study of Qualitative and Quantitative Conditional Logics.
JELIA 2002: 161-172 |
| 61 | EE | Christoph Beierle,
Gabriele Kern-Isberner:
Looking at Probabilistic Conditionals from an Institutional Point of View.
WCII 2002: 162-179 |
| 2001 |
|---|
| 60 | | Manfred Widera,
Christoph Beierle:
Function Types in Complete Type Inference.
Scottish Functional Programming Workshop 2001: 111-122 |
| 2000 |
|---|
| 59 | | Manfred Widera,
Christoph Beierle:
Detecting common elements of types.
Scottish Functional Programming Workshop 2000: 173-184 |
| 58 | EE | Marija Kulas,
Christoph Beierle:
Defining Standard Prolog in Rewriting Logic.
Electr. Notes Theor. Comput. Sci. 36: (2000) |
| 1999 |
|---|
| 57 | | Christoph Beierle,
Gregor Meyer:
Using Types as Approximations for Type Checking Prolog Programs.
Fuji International Symposium on Functional and Logic Programming 1999: 251-266 |
| 56 | | Manfred Widera,
Christoph Beierle:
Combining Strict and Soft Typing in Functional Programming.
GI Jahrestagung 1999: 350-359 |
| 55 | | Manfred Widera,
Christoph Beierle:
How to Combine the Benefits of Strict and Soft Typing.
Scottish Functional Programming Workshop 1999: 68-78 |
| 54 | EE | Christoph Beierle,
Reinhold Kloos,
Gregor Meyer:
A Pragmatic Type Concept for Prolog Supporting Polymorphism, Subtyping, and Meta-Programming.
Electr. Notes Theor. Comput. Sci. 30(1): (1999) |
| 1996 |
|---|
| 53 | | Christoph Beierle,
Egon Börger:
Specification and Correctness Proof of a WAM Extension with Abstract Type Constraints.
Formal Asp. Comput. 8(4): 428-462 (1996) |
| 52 | | Christoph Beierle,
Egon Börger:
Refinement of a Typed WAM Extension by Polymorphic Order-Sorted Types.
Formal Asp. Comput. 8(5): 539-564 (1996) |
| 1995 |
|---|
| 51 | | Christoph Beierle,
Egon Börger,
Igor Durdanovic,
Uwe Glässer,
Elvinia Riccobene:
Refining Abstract Machine Specifications of the Steam Boiler Control to Well Documented Executable Code.
Formal Methods for Industrial Applications 1995: 52-78 |
| 50 | | Christoph Beierle:
Type Inferencing for Polymorphic Order-Sorted Logic Programs.
ICLP 1995: 765-779 |
| 49 | | Christoph Beierle:
Concepts, Implementation, and Applications of a Typed Logic Programming Language.
Logic Programming: Formal Methods and Practical Applications 1995: 139-167 |
| 1994 |
|---|
| 48 | | Christoph Beierle:
Formal Design of an Abstract Machine for Constraint Logic Programming.
IFIP Congress (1) 1994: 377-382 |
| 47 | | Christoph Beierle,
Gregor Meyer:
Run-Time Type Computations in the Warren Abstract Machine.
J. Log. Program. 18(2): 123-148 (1994) |
| 1993 |
|---|
| 46 | EE | Christoph Beierle,
Udo Pletat,
Rudi Studer:
Knowledge Representation for Natural Language Understanding: The LLILOG Approach.
IEEE Trans. Knowl. Data Eng. 5(3): 386-401 (1993) |
| 1992 |
|---|
| 45 | | Christoph Beierle:
Knowledge Based PPS Applications in PROTOS-L.
Logic Programming Summer School 1992: 80-90 |
| 44 | | Christoph Beierle,
Ulrich Hedtstück,
Udo Pletat,
Peter H. Schmitt,
Jörg H. Siekmann:
An Order-Sorted Logic for Knowledge Representation Systems.
Artif. Intell. 55(2): 149-191 (1992) |
| 43 | | Christoph Beierle:
Logic programming with typed unification and its realization on an abstract machine.
IBM Journal of Research and Development 36(3): 375-390 (1992) |
| 42 | | Michel Bénichou,
Henri Beringer,
Jean-Michel Gauthier,
Christoph Beierle:
Prolog at IBM: An Advanced and Evolving Application Development Technology.
IBM Systems Journal 31(4): 755-773 (1992) |
| 41 | | Gregor Meyer,
Christoph Beierle,
Ralph Scheubrein:
Persistente Datenspeicherung in einer logischen Programmiersprache mit relationalen und deduktiven Datenbanken
IWBS Report 219: (1992) |
| 1991 |
|---|
| 40 | | Christoph Beierle,
Egon Börger:
Correctness Proof For the WAM with Types.
CSL 1991: 15-34 |
| 39 | | Christoph Beierle,
Gregor Meyer,
Heiner Semle:
Extending the Warren Abstract Machine to Polymorphic Order-Sorted Resolution.
ISLP 1991: 272-286 |
| 38 | | Christoph Beierle,
Gregor Meyer,
Heiner Semle:
A Brief Description of the PROTOS-L System.
PDK 1991: 402-404 |
| 37 | | Christoph Beierle:
An Overview on Planning Applications in PROTOS-L
IWBS Report 163: (1991) |
| 36 | | Christoph Beierle,
Stefan Böttcher,
Gregor Meyer:
Draft Report of the Logic Programming Language PROTOS-L
IWBS Report 175: (1991) |
| 35 | | Christoph Beierle,
Gregor Meyer,
Heiner Semle:
Extending the Warren Abstract Machine to Polymorphic Order-Sorted Resolution
IWBS Report 181: (1991) |
| 34 | | Christoph Beierle,
Egon Börger:
A WAM Extension for Type-Constraint Logic Programming: Specification and Correctness Proof
IWBS Report 200: (1991) |
| 33 | | Christoph Beierle,
Egon Börger:
Correctness Proof for the WAM
IWBS Report 205: (1991) |
| 1990 |
|---|
| 32 | | Christoph Beierle,
Ulrich Hedtstück,
Udo Pletat,
Peter H. Schmitt,
Jörg H. Siekmann:
An Order-Sorted Logic for Knowledge Representation Systems
IWBS Report 113: (1990) |
| 31 | | Christoph Beierle,
Angi Voß:
Stepwise Software Development with Algebraic Specifications
IWBS Report 140: (1990) |
| 1989 |
|---|
| 30 | | Christoph Beierle:
Types, Modules and Databases in the Logic Programming Language PROTOS-L.
Sorts and Types in Artificial Intelligence 1989: 73-110 |
| 29 | | Christoph Beierle,
Stefan Böttcher:
PROTOS-L: Towards a Knowledge Base Programming Language.
Wissensbasierte Systeme 1989: 388-400 |
| 28 | | Stefan Böttcher,
Christoph Beierle:
Database Support for the PROTOS-L System
IWBS Report 71: (1989) |
| 27 | | Christoph Beierle,
Ulrich Hedtstück,
Udo Pletat,
Jörg H. Siekmann:
An Order Sorted Predicate Logic with Closely Coupled Taxonomic Information
IWBS Report 86: (1989) |
| 26 | | Christoph Beierle:
Types, Modules and Databases in the Logic Programming Language PROTOS-L
IWBS Report 88: (1989) |
| 25 | | Christoph Beierle,
Stefan Böttcher:
PROTOS-L: Towards a Knowledge Base Programming Language
IWBS Report 89: (1989) |
| 24 | | Christoph Beierle,
Udo Pletat:
The Algebra of Feature Graph Specifications
IWBS Report 94: (1989) |
| 1988 |
|---|
| 23 | | Christoph Beierle,
Udo Pletat:
Integrating Logic Programming and Equational Specification of Abstract Data Types.
ALP 1988: 71-82 |
| 22 | | Christoph Beierle,
Udo Pletat:
Feature graphs and abstract data types: a unifying approach.
COLING 1988: 40-45 |
| 21 | | Christoph Beierle,
Jochen Dörre,
Udo Pletat,
Claus-Rainer Rollinger,
Peter H. Schmitt,
Rudi Studer:
The Knowledge Representation Language LLILOG.
CSL 1988: 14-51 |
| 20 | | Christoph Beierle,
Udo Pletat,
Hans Uszkoreit:
An Algebraic Characterization of STUF.
Computerlinguistik und ihre theoretischen Grundlagen 1988: 15-32 |
| 19 | | Christoph Beierle,
Walter G. Olthoff,
Angi Voß:
Qualitätssicherung durch Programmverifikation und algebraische Methoden in der Softwareentwicklung.
Informatik Spektrum 11(6): 292-302 (1988) |
| 18 | | Christoph Beierle,
Udo Pletat:
Semantics of Logic Programs with Equational Abstract Data Type Specifications
LILOG-Report 38: (1988) |
| 17 | | Christoph Beierle,
Udo Pletat:
Feature Graphs and Abstract Data Types: A Unifying Approach
LILOG-Report 39: (1988) |
| 16 | | Christoph Beierle,
Udo Pletat,
Hans Uszkoreit:
An Algebraic Characterization of STUF
LILOG-Report 40: (1988) |
| 15 | | Christoph Beierle,
Jochen Dörre,
Udo Pletat,
Claus-Rainer Rollinger,
Peter H. Schmitt,
Rudi Studer:
The Knowledge Representation Language LLILOG
LILOG-Report 41: (1988) |
| 14 | | Christoph Beierle,
Walter G. Olthoff,
Angi Voß:
Qualitätssicherung durch Programmverifikation und algebraische Methoden in der Softwareentwicklung
LILOG-Report 42: (1988) |
| 1987 |
|---|
| 13 | | Christoph Beierle,
Udo Pletat:
On the Integration of Equality, Sorts, and Logic Programming.
ÖGAI 1987: 133-144 |
| 12 | | Christoph Beierle,
Angi Voß:
Viewing Implementations as an Institution.
Category Theory and Computer Science 1987: 196-218 |
| 11 | | Christoph Beierle,
Angi Voß:
On Implementations of Loose Abstract Data Type Specifications and Their Vertical Composition.
STACS 1987: 245-259 |
| 10 | | Christoph Beierle,
Angi Voß:
Theory and Practice of Canonical Term Functors in Abstract Data Type Specifications.
TAPSOFT, Vol.2 1987: 320-334 |
| 9 | | Christoph Beierle,
Udo Pletat:
On the Interpretation of Equality, Sorts, and Logic Programming
LILOG-Report 37: (1987) |
| 8 | | Udo Pletat,
Christoph Beierle:
The Semantics of Asserting and Retracting Clauses to Logic Programs
LILOG-Report 7: (1987) |
| 1986 |
|---|
| 7 | | Christoph Beierle:
Vertical and Horizontal Compositions of Implementation Specifications.
ADT 1986 |
| 6 | | Christoph Beierle,
Walter G. Olthoff,
Angi Voß:
Automatic Theorem Proving in the ISDV System.
CADE 1986: 670-671 |
| 5 | | Christoph Beierle,
Walter G. Olthoff,
Angi Voß:
A Software Development Environment Integrating Specification and Programming Languages.
Software-Architektur 1986: 9-25 |
| 1984 |
|---|
| 4 | | Christoph Beierle,
Angi Voß:
Implementation Specifications.
ADT 1984: 39-53 |
| 1983 |
|---|
| 3 | | Christoph Beierle,
Angi Voß:
A Parameterization Concept for Hierarchies of Specifications.
ADT 1983 |
| 1982 |
|---|
| 2 | | Christoph Beierle,
Angi Voß:
Hierarchical Specification of Parameterized Abstract Data Types by Means of Canonical Term Algebras.
ADT 1982 |
| 1 | | Christoph Beierle:
Synthesizing Minimal Programs from Traces of Observable Behaviour.
ECAI 1982: 96-101 |
