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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P. (eds.): Description Logic Handbook. Cambridge University Press, Cambridge (2002)
Baumgartner, P., Burchardt, A.: Logic Programming Infrastructure for Inferences on FrameNet. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 591–603. Springer, Heidelberg (2004)
Baumgartner, P., Fröhlich, P., Furbach, U., Nejdl, W.: Semantically Guided Theorem Proving for Diagnosis Applications. In: 15th Int. Joint Conf. on Artificial Intelligence (IJCAI 1997), Nagoya, pp. 460–465. Morgan Kaufmann, San Francisco (1997)
Baumgartner, P., Furbach, U., Gross-Hardt, M., Kleemann, T.: Optimizing the Evaluation of XPath using Description Logics. In: Proc. INAP 2004, 15th Int. Conf. on Applications of Declarative Programming and Knowledge Management, Potsdam (2004)
Baumgartner, P., Furbach, U., Gross-Hardt, M., Sinner, A.: ’Living Book’:- ’Deduction’, ’Slicing’, ’Interaction’. – system description. In: Baader, F. (ed.) CADE-19 – The 19th Int. Conf. on Automated Deduction. LNCS (LNAI), Springer, Heidelberg (2003)
Baumgartner, P., Furbach, U., Niemelä, I.: Hyper Tableaux. In: Orłowska, E., Alferes, J.J., Moniz Pereira, L. (eds.) JELIA 1996. LNCS, vol. 1126, Springer, Heidelberg (1996)
Bibel, W., Schmitt, P.H. (eds.): Automated Deduction. A basis for applications. Kluwer Academic Publishers, Dordrecht (1998)
Calvanese, D., Giacomo, G.D., Lenzerini, M.: Answering queries using views in description logics. In: Proc. DL 1999, Description Logic Workshop (1999)
Calvanese, D., Giacomo, G.D., Lenzerini, M.: Representing and reasoning on XML documents: a description logic approach. J. of Logic and Computation, 295–318 (1999)
Dix, J., Furbach, U., Niemelä, I.: Nonmonotonic Reasoning: Towards Efficient Calculi and Implementations. In: Voronkov, A., Robinson, A. (eds.) Handbook of Automated Reasoning, pp. 1121–1234. Elsevier-Science-Press, Amsterdam (2001)
Eiter, T., Faber, W., Leone, N., Pfeifer, G.: Declarative problem-solving using the DLV system. In: Logic-based artificial intelligence, pp. 79–103. Kluwer Academic Publishers, Dordrecht (2000)
Furbach, U.: Automated deduction. In: Bibel, W., Schmitt, P. (eds.) Automated Deduction. A Basis for Applications. Foundations. Calculi and Refinements, vol. I, Kluwer Academic Publishers, Dordrecht (1998)
Gross-Hardt, M.: Querying concepts – an approach to retrieve xml data by means of their data types. In: 17. WLP -Workshop Logische Programmierung, Technical Report. Technische Universität Dresden (2002)
Haarslev, V., Möller, R.: Expressive ABox Reasoning with Number Restrictions, Role Hierarchies, and Transitively Closed Roles. In: KR 2000: Principles of Knowledge Representation and Reasoning, pp. 273–284. Morgan Kaufmann, San Francisco (2000)
Kifer, M., Kim, W., Sagiv, Y.: Querying object-oriented databases. In: SIGMOD (1992)
Manthey, R., Bry, F.: SATCHMO: a theorem prover implemented in Prolog. In: Lusk, E.‘., Overbeek, R. (eds.) CADE 1988. LNCS, vol. 310, pp. 415–434. Springer, Heidelberg (1988)
Niemelä, I., Simons, P.: Efficient implementation of the well-founded and stable model semantics. In: Proc. of the Joint Int. Conf. and Symposium on Logic Programming, Bonn, Germany, The MIT Press, Cambridge (1996)
Sakama, C.: PossibleModel Semantics for Disjunctive Databases. In: Kim, W., Nicholas, J.-M., Nishio, S. (eds.) Proc. First Int. Conf. on Deductive and Object-Oriented Databases (DOOD 1989), pp. 337–351. Elsevier Science Publishers B.V., Amsterdam (1990)
W3C. XPath specification (1999), http://www.w3.org/TR/xpath
W3C. XML Schema - part 0 to part 2 (2001), http://www.w3.org/TR/xmlschema-0 -1, -2,
W3C. XQuery 1.0: An XML query language (2001), http://www.w3.org/TR/xquery/
Wernhard, C.: System Description: KRHyper. Fachberichte Informatik 14–2003, Universität Koblenz-Landau, Institut für Informatik (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baumgartner, P., Furbach, U., Gross-Hardt, M., Kleemann, T. (2004). Model Based Deduction for Database Schema Reasoning. In: Biundo, S., Frühwirth, T., Palm, G. (eds) KI 2004: Advances in Artificial Intelligence. KI 2004. Lecture Notes in Computer Science(), vol 3238. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30221-6_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-30221-6_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23166-0
Online ISBN: 978-3-540-30221-6
eBook Packages: Springer Book Archive