KRHyper Inside — Model Based Deduction in Applications

Three real world applications are depicted which all have in common, that their core component is a full first order theorem prover, based on the hyper tableau calculus. These applications concern information retrieval in electronic publishing, the integration of description logics with other knowledge representation techniques and XML query processing.

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

[2]  Peter Baumgartner,et al.  Automated Deduction Techniques for the Management of Personalized Documents , 2003, Annals of Mathematics and Artificial Intelligence.

[3]  Peter Baumgartner,et al.  First-order logic Davis-Putnam-Logemann-Loveland procedure , 2003 .

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

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

[6]  Mira Balaban,et al.  DFL - A Hybrid Integration of Descriptions and Rules, Using F-Logic as an Underlying Semantics , 1996, NGITS.

[7]  Patrick Blackburn,et al.  A roadmap of the complexity of hybrid logics. , 1999 .

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

[9]  Michael Kifer,et al.  Querying object-oriented databases , 1992, SIGMOD '92.

[10]  François Bry,et al.  Towards a Declarative Query and Transformation Language for XML and Semistructured Data: Simulation Unification , 2002, ICLP.

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

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

[13]  Andreas Winter,et al.  Towards a Common Query Language for Reverse Engineering , 2002 .

[14]  Ian Horrocks,et al.  Reasoning with Individuals for the Description Logic SHIQ , 2000, CADE.

[15]  Gabriel M. Kuper,et al.  Subsumption for XML types , 2001, ICDT.

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

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

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

[19]  Jennifer Widom,et al.  The Lorel query language for semistructured data , 1997, International Journal on Digital Libraries.

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

[21]  W. Bibel,et al.  Automated deduction : a basis for applications , 1998 .

[22]  Guillermo R. Simari,et al.  lntroducing generalized specificity in logic programming , 2000 .

[23]  Werner Nutt,et al.  Basic Description Logics , 2003, Description Logic Handbook.

[24]  Margret Groß-Hardt,et al.  Concept based querying of semistructured data , 2002, XSW.

[25]  Manfred Rosendahl,et al.  Specification of Symbols and Implementation of Their Constraints in JKogge , 2000 .

[26]  Francesco M. Donini,et al.  AL-log: Integrating Datalog and Description Logics , 1998, Journal of Intelligent Information Systems.

[27]  Franz Baader,et al.  Embedding defaults into terminological knowledge representation formalisms , 1995, Journal of Automated Reasoning.

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

[29]  Gottfried Vossen,et al.  An Extension of Path Expressions to Simplify Navigation in Object-Oriented Queries , 1993, DOOD.

[30]  Laks V. S. Lakshmanan,et al.  On the Difference between Navigating Semi-structured Data and Querying It , 1999, DBPL.

[31]  Francesco M. Donini,et al.  Description logics of minimal knowledge and negation as failure , 2002, TOCL.

[32]  Ian Horrocks,et al.  A Conjunctive Query Language for Description Logic Aboxes , 2000, AAAI/IAAI.

[33]  Oliver Obst,et al.  Towards a Logical Approach for Soccer Agents Engineering , 2000, RoboCup.

[34]  Ian Horrocks,et al.  OIL in a Nutshell , 2000, EKAW.

[35]  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).

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

[37]  Yehoshua Sagiv,et al.  Flexible queries over semistructured data , 2001, PODS '01.

[38]  Volker Haarslev,et al.  RACER System Description , 2001, IJCAR.

[39]  Serge Abiteboul,et al.  From structured documents to novel query facilities , 1994, SIGMOD '94.