Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
  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

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Baumgartner, Peter1, Autor           
Furbach, Ulrich, Autor
Gross-Hardt, Margret, Autor
Kleemann, Thomas, Autor
Biundo, Susanne, Herausgeber
Frühwirth, Thom2, Herausgeber
Palm, Günther, Herausgeber
Affiliations:
1Programming Logics, MPI for Informatics, Max Planck Society, ou_40045              
2Max Planck Society, ou_persistent13              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: 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

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 2005-04-272004
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: -
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: eDoc: 231244
Anderer: Local-ID: C1256104005ECAFC-FB9ED61FE483B97FC1256F8C0046D5A6-Baumgartner:etal:ModelBasedSchemaReasoning:KI:2004
 Art des Abschluß: -

Veranstaltung

einblenden:
ausblenden:
Titel: Untitled Event
Veranstaltungsort: Ulm, Germany
Start-/Enddatum: 2004-09-20

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: KI 2004: Advances in Artificial Intelligence: 27th Annual German Conference on AI, KI 2004
Genre der Quelle: Konferenzband
 Urheber:
Affiliations:
Ort, Verlag, Ausgabe: Berlin, Germany : Springer
Seiten: - Band / Heft: - Artikelnummer: - Start- / Endseite: 168 - 182 Identifikator: ISBN: 3-540-23166-8

Quelle 2

einblenden:
ausblenden:
Titel: Lecture Notes in Artificial Intelligence
Genre der Quelle: Reihe
 Urheber:
Affiliations:
Ort, Verlag, Ausgabe: -
Seiten: - Band / Heft: 3238 Artikelnummer: - Start- / Endseite: - Identifikator: -