English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Model Based Deduction for Database Schema Reasoning

Baumgartner, P., Furbach, U., Gross-Hardt, M., & Kleemann, T. (2004). Model Based Deduction for Database Schema Reasoning. In KI 2004: Advances in Artificial Intelligence: 27th Annual German Conference on AI, KI 2004 (pp. 168-182). Berlin, Germany: Springer.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Baumgartner, Peter1, Author           
Furbach, Ulrich, Author
Gross-Hardt, Margret, Author
Kleemann, Thomas, Author
Biundo, Susanne, Editor
Frühwirth, Thom2, Editor
Palm, Günther, Editor
Affiliations:
1Programming Logics, MPI for Informatics, Max Planck Society, ou_40045              
2Max Planck Society, ou_persistent13              

Content

show
hide
Free keywords: -
 Abstract: We aim to demonstrate that automated deduction techniques, in particular those following the model computation paradigm, are very well suited for database schema/query reasoning. Specifically, we present an approach to compute completed paths for database or XPath queries. The database schema and a query are transformed to disjunctive logic programs with default negation, using a description logic as an intermediate language. Our underlying deduction system, KRHyper, then detects if a query is satisfiable or not. In case of a satisfiable query, all completed paths – those that fulfill all given constraints – are returned as part of the computed models. The purpose of computing completed paths is to reduce the workload on a query processor. Without the path completion, a usual XPath query processor would search the whole database for solutions to the query, which need not be the case when using completed paths instead. We understand this paper as a first step, that covers a basic schema/query reasoning task by model-based deduction. Due to the underlying expressive logic formalism we expect our approach to easily adapt to more sophisticated problem settings, like type hierarchies as they evolve within the XML world.

Details

show
hide
Language(s): eng - English
 Dates: 2005-04-272004
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 231244
Other: Local-ID: C1256104005ECAFC-FB9ED61FE483B97FC1256F8C0046D5A6-Baumgartner:etal:ModelBasedSchemaReasoning:KI:2004
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Ulm, Germany
Start-/End Date: 2004-09-20

Legal Case

show

Project information

show

Source 1

show
hide
Title: KI 2004: Advances in Artificial Intelligence: 27th Annual German Conference on AI, KI 2004
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 168 - 182 Identifier: ISBN: 3-540-23166-8

Source 2

show
hide
Title: Lecture Notes in Artificial Intelligence
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 3238 Sequence Number: - Start / End Page: - Identifier: -