System Description : KRHyper

KRHyper is a first order logic theorem proving and model generation system based on the hyper tableau calculus. It is targeted for use as an embedded system within knowledge based applications. In contrast to most first order theorem provers, it supports features important for those applications, for example queries with predicate extensions as answers, handling of large sets of uniformly structured input facts, arithmetic evaluation and stratified negation as failure.

[1]  Andreas Winter,et al.  Querying as an enabling technology in software reengineering , 1999, Proceedings of the Third European Conference on Software Maintenance and Reengineering (Cat. No. PR00090).

[2]  François Bry,et al.  SATCHMO: A Theorem Prover Implemented in Prolog , 1988, CADE.

[3]  Frieder Stolzenburg,et al.  Loop-Detection in Hyper-Tableaux by Powerful Model Generation , 1999, J. Univers. Comput. Sci..

[4]  James Harland,et al.  The aditi deductive database system , 1994, The VLDB Journal.

[5]  Jürgen Ebert,et al.  GraX-an interchange format for reengineering tools , 1999, Sixth Working Conference on Reverse Engineering (Cat. No.PR00303).

[6]  Jens Woch,et al.  Implementation of a Schema-TAG-Parser , 1999 .

[7]  Oliver Obst,et al.  Spatial Agents Implemented in a Logical Expressible Language , 1999, RoboCup.

[8]  Peter Baumgartner,et al.  KRHyper Inside — Model Based Deduction in Applications , 2003 .

[9]  Hiroshi Fujita,et al.  A Model Generation Theorem Prover in KL1 Using a Ramified -Stack Algorithm , 1991, International Conference on Logic Programming.

[10]  Christoph Goller,et al.  Controlled integration of the cut rule into connection tableau calculi , 2004, Journal of Automated Reasoning.

[11]  Peter Baumgartner,et al.  The Taming of the (X)OR , 2000, Computational Logic.

[12]  Peter Baumgartner,et al.  Hyper Tableaux , 1996, JELIA.

[13]  Jürgen Ebert,et al.  A Formalization of SOCCA , 1999 .

[14]  William McCune,et al.  Experiments with discrimination-tree indexing and path indexing for term retrieval , 1992, Journal of Automated Reasoning.

[15]  Andy Schürr,et al.  GXL: toward a standard exchange format , 2000, Proceedings Seventh Working Conference on Reverse Engineering.

[16]  Joseph Douglas Horton,et al.  Merge Path Improvements for Minimal Model Hyper Tableaux , 1999, TABLEAUX.

[17]  Koichi Furukawa,et al.  Query Evaluation of Deductive Database by MGTP and its Application to Data Mining , 1997, DDLP.

[18]  Norbert Eisinger,et al.  A Confluent Connection Calculus , 2000, Intellectics and Computational Logic.

[19]  Jeffrey D. Uuman.  Principles of database and knowledge- base systems , 1989 .

[20]  Peter Baumgartner,et al.  Abductive Coreference by Model Construction , 1999 .

[21]  Pierre Deransart,et al.  Prolog - the standard: reference manual , 1996 .

[22]  Geoff Sutcliffe,et al.  The TPTP Problem Library , 1994, Journal of Automated Reasoning.

[23]  Ulrich Furbach,et al.  Nonmonotonic Reasoning: Towards Efficient Calculi and Implementations , 2001, Handbook of Automated Reasoning.

[24]  Tim Geisler,et al.  Efficient Model Generation through Compilation , 1996, CADE.