Norbert Eisinger

25 papers A* 2A 5B 1Journal 3Unranked 12
YearRankTypeTitle / Venue / Authors
2009 — conf
Search for More Declarativity.
RR
Simon Brodt, François Bry, Norbert Eisinger
2007 — conf
Foundations of Rule-Based Query Answering.
Reasoning Web
François Bry, Norbert Eisinger, Thomas Eiter, Tim Furche, Georg Gottlob, Clemens Ley, Benedikt Linse, Reinhard Pichler, Fang Wei
2005 — ed.
Reasoning Web, First International Summer School 2005, Msida, Malta, July 25-29, 2005, Tutorial Lectures
Reasoning Web
Norbert Eisinger, Jan Maluszynski
2003 A conf
Web Services for Teaching: A Case Study.
ICWS
François Bry, Norbert Eisinger, Georg Schneemayer
2000 — conf
A Confluent Connection Calculus.
Intellectics and Computational Logic
Peter Baumgartner, Norbert Eisinger, Ulrich Furbach
1999 A conf
A Confluent Connection Calculus.
CADE
Peter Baumgartner, Norbert Eisinger, Ulrich Furbach
1998 — conf
SIC: Satisfiability Checking for Integrity Constraints.
DDLP
François Bry, Norbert Eisinger, Heribert Schütz, Sunna Torge
1997 — conf
Der Tableau-Browser SNARKS (system description).
WLP
Mathias Kettner, Norbert Eisinger
1997 — conf
Logic Implemented Functionally.
PLILP
Norbert Eisinger, Tim Geisler, Sven Panne
1997 — conf
SNARKS: A Browser for Tableaux Derivations.
LPE
Mathias Kettner, Norbert Eisinger
1997 A conf
The Tableau Browser SNARKS.
CADE
Mathias Kettner, Norbert Eisinger
1995 — conf
The theorem prover SATCHMO : strategies, heuristics and applications.
JFPLC
Slim Abdennadher, François Bry, Norbert Eisinger, Tim Geisler
1992 J jnl
4. Internationaler GI-Kongreß Wissensbasierte Systeme.
Künstliche Intell.
Siegfried Bocionek, Norbert Eisinger, Gunnar Teege
1991 J jnl
Reduction Rules for Resolution-Based Systems.
Artif. Intell.
Norbert Eisinger, Hans Jürgen Ohlbach, Axel Präcklein
1989 J jnl
A Note on the Completeness of Resolution with Self-Resolution.
Inf. Process. Lett.
Norbert Eisinger
1988 — —
Completeness, confluence, and related properties of clause graph resolution.
Norbert Eisinger
1986 A conf
The Markgraf Karl Refutation Procedure (MKRP).
CADE
Norbert Eisinger, Hans Jürgen Ohlbach
1986 A conf
What You Always Wanted to Know About Clause Graph Resolution.
CADE
Norbert Eisinger
1983 — conf
A Technical Note on Splitting and Clausal Normal Form Algorithms.
GWAI
Norbert Eisinger, M. Weigele
1982 B conf
Logic Programming: A Parallel Approach.
ICLP
Norbert Eisinger, Simon Kasif, Jack Minker
1981 A* conf
Subsumption And Connection Graphs.
IJCAI
Norbert Eisinger
1981 — conf
Subsumption and Connectionsgraphs.
GWAI
Norbert Eisinger
1981 A* conf
The Markgraf Karl Refutation Procedure.
IJCAI
Karl-Hans Bläsius, Norbert Eisinger, Jörg H. Siekmann, Gert Smolka, Alexander Herold, Christoph Walther
1980 — conf
Das Karlsruher Beweissystem.
GI Jahrestagung
Norbert Eisinger, Jörg H. Siekmann, Gert Smolka, E. Unvericht, Christoph Walther
1978 — conf
Paramodulated Connection Graphs.
AISB/GI (ECAI)
Norbert Eisinger, Jörg H. Siekmann, Graham Wrightson