Contextual Web Services for Teaching (2009)
Oettingenstraße D– München, Georg Schneemayer, Betreuer Prof, Dr. François Bry, Dr. Norbert Eisinger
Hiermit versichere ich, dass ich diese Diplomarbeit selbständig verfasst habe. Ich habe dazu keine anderen als die angegebenen Quellen und Hilfsmittel verwendet. München, den 10. Oktober 2002 Georg...
Reduction Rules for Resolution Based Systems (2008)
Norbert Eisinger, Hans Jürgen Ohlbach, Axel Präcklein, Fb Informatik
Abstract: Inference rules for resolution based systems can be classified into deduction rules, which add new objects, and reduction rules, which remove objects. Traditional reduction rules like...
Automated reasoning on the web (2008)
Slim Abdennadher, José Júlio, Alves Alferes, Grigoris Antoniou, Uwe Aßmann, Rolf Backofen, ...
Automated reasoning is becoming an essential issue in many Web systems and applications, especially in emerging Semantic Web applications. This article first discusses reasons for this evolution....
Table of Contents Foundations of Rule-Based Query Answering........................ 1 (2008)
François Bry, Norbert Eisinger, Thomas Eiter, Tim Furche, Georg Gottlob, Clemens Ley, ...
Chaining with Memory in Xcerpt (2008)
Benedikt Linse, Norbert Eisinger, Clemens Ley, Tim Furche, François Bry
Moving from single-rule Xcerpt programs as described in previous deliverables to full Xcerpt programs requires to address the issue of efficient rule chaining. In this deliverable, we first survey...
Foundations of rule-based query answering (2007)
François Bry, Norbert Eisinger, Thomas Eiter, Tim Furche, Georg Gottlob, Clemens Ley, ...
Abstract. This survey article introduces into the essential concepts and methods underlying rule-based query languages. It covers four complementary areas: declarative semantics based on adaptations...
This document describes “Reasoning Web 2005”, the first REWERSE Summer School. The summer school proceedings [Ma̷luszynski and Eisinger, 2005] published in the “Lecture Notes in Computer...
Web Services for Teaching: A Case Study (2003)
Francois Bry, Norbert Eisinger, Norbert Eisinger, Georg Schneemayer, Georg Schneemayer
Abstract The area of software applications for teaching (teaching applications for short), whether for distance teaching or for traditional presence teaching, is characterized by a multitude of...
Web Services for Teaching: A Case Study (2003)
François Bry, Norbert Eisinger, Georg Schneemayer
Abstract The area of software applications for teaching (teaching applications for short), whether for distance teaching or for traditional presence teaching, is characterized by a multitude of...
Data Modeling with Markup Languages: A Logic Programming Perspective (2000)
François Bry, Norbert Eisinger, Norbert Eisinger
This paper consists of three parts. In a first part, it is argued that generic markup languages such as SGML and XML, that have been developed primarily for modeling documents are also convenient for...
A Confluent Connection Calculus (1999)
Ur Informatik, Peter Baumgartner, Peter Baumgartner, Norbert Eisinger, Norbert Eisinger, ...
. This work 1 is concerned with basic issues of the design of calculi and proof procedures for first-order connection methods and tableaux calculi. Proof procedures for these type of calculi...
SIC: An Interactive Tool for the Design of Integrity Constraints (1998)
François Bry, Norbert Eisinger, Heribert Schütz, Sunna Torge
Introduction Integrity constraints are declarative expressions that serve to distinguish valid database states, corresponding to possible (so-called legal) states of the real world, from invalid ones...
SIC: Satisfiability Checking for Integrity Constraints (1998)
François Bry, Norbert Eisinger, Norbert Eisinger, Heribert Schütz, Heribert Schutz, Sunna Torge, ...
SIC is an interactive prototype to assist in the design of finitely satisfiable integrity constraints. Thus SIC addresses the constraint satisfiability problem during the schema design phase of a...
A Confluent Connection Calculus (1998)
Peter Baumgartner, Peter Baumgartner, Norbert Eisinger, Norbert Eisinger, Ulrich Furbach, Ulrich Furbach
This work is concerned with basic issues of the design of calculi and proof procedures for first-order connection methods and tableaux calculi. Proof procedures for these type of calculi developed so...
Problem Solving with Model-Generation Approaches based on PUHR Tableaux (1998)
Norbert Eisinger, Norbert Eisinger, Tim Geisler, Tim Geisler
The workshop on "Problem-solving Methodologies with Automated Deduction" at CADE-15 is based on a collection of real-world problems from six practical domains. This paper describes and...
Merge Path Improvements for Minimal Model Hyper Tableaux. (1998)
Hassan Diab, Ulrich Furbach, Hassan Tabbara, Jens Woch, Friedbert Widmann Implementation, Jürgen Ebert, ...
Mechanisms in Knowledge-Based Systems: Theory and Applications (Proceedings of WS at KI ’98).
Logic implemented Functionally (1997)
Norbert Eisinger, Norbert Eisinger, Tim Geisler, Tim Geisler, Sven Panne, Sven Panne
. We describe a course intended to introduce second-year undergraduates to medium-scale programming. The project of the course is to implement a nonconventional logic programming language using a...
SIC: An Interactive Tool for the Design of Integrity Constraints (System Description) (1997)
Fran Cois, Norbert Eisinger, Norbert Eisinger, Heribert Schutz, Heribert Schutz, ...
Introduction Integrity constraints are declarative expressions that serve to distinguish valid database states, corresponding to possible (so-called legal) states of the real world, from invalid ones...
The Tableau Browser SNARKS (System Description) (1997)
Mathias Kettner, Mathias Kettner, Norbert Eisinger, Norbert Eisinger
less whether a tree is internally produced or imported, Snarks offers a rich functionality to display, inspect, rearrange, and manipulate the tree interactively, including means to influence the...
Satchmo: Minimal Model Generation and Compilation (System Description) (1996)
Thomas Brüggemann, François Bry, Thomas Bruggemann, Norbert Eisinger, Norbert Eisinger, Tim Geisler, ...
: Satchmo is an automated theorem prover for first-order predicate logic implemented in Prolog. Its reasoning paradigm, model generation, is more powerful than the traditional refutation paradigm. It...
Satchmo Strategies, Slim Abdennadher, Norbert Eisinger, Tim Geisler
Satchmo is an automated theorem prover for first-order predicate logic. Its reasoning paradigm, model generation, is more powerful than the traditional refutation paradigm. Satchmo can be seen as an...
The Theorem Prover Satchmo: Strategies, Heuristics, and Applications (System Description) (1995)
François Bry, Slim Abdennadher, Norbert Eisinger, Norbert Eisinger, ...
Satchmo is an automated theorem prover for first-order predicate logic. Its reasoning paradigm, model generation, is more powerful than the traditional refutation paradigm. Satchmo can be seen as an...
Deduction Systems Based on Resolution (1991)
Norbert Eisinger, Norbert Eisinger, Hans Jürgen Ohlbach, Hans Jurgen Ohlbach, Fur Informatik
A general theory of deduction systems is presented. The theory is illustrated with deduction systems based on the resolution calculus, in particular with clause graphs. This theory distinguishes four...
Thesis (doctoral)--Universität Kaiserslautern, 1988.