skip to main content
10.1145/2463664.2465229acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
research-article

Well-founded semantics for extended datalog and ontological reasoning

Published:22 June 2013Publication History

ABSTRACT

The Datalog± family of expressive extensions of Datalog has recently been introduced as a new paradigm for query answering over ontologies, which captures and extends several common description logics. It extends plain Datalog by features such as existentially quantified rule heads and, at the same time, restricts the rule syntax so as to achieve decidability and tractability. In this paper, we continue the research on Datalog±. More precisely, we generalize the well-founded semantics (WFS), as the standard semantics for nonmonotonic normal programs in the database context, to Datalog± programs with negation under the unique name assumption (UNA). We prove that for guarded Datalog± with negation under the standard WFS, answering normal Boolean conjunctive queries is decidable, and we provide precise complexity results for this problem, namely, in particular, completeness for PTIME (resp., 2-EXPTIME) in the data (resp., combined) complexity.

References

  1. C. Baral and V. S. Subrahmanian. Dualities between alternative semantics for logic programming and nonmonotonic reasoning. J. Autom. Reasoning, 10(3):399--420, 1993.Google ScholarGoogle ScholarCross RefCross Ref
  2. A. Calì, G. Gottlob, and M. Kifer. Taming the infinite chase: Query answering under expressive relational constraints. In Proc. KR-2008, pp. 70--80, 2008. Revised version: http://dbai.tuwien.ac.at/staff/gottlob/CGK.pdf.Google ScholarGoogle Scholar
  3. A. Calì, G. Gottlob, and T. Lukasiewicz. A general Datalog-based framework for tractable query answering over ontologies. J. Web Sem., 14:57--83, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. A. Calì, G. Gottlob, T. Lukasiewicz,B. Marnette, and A. Pieris: Datalog±: A family of logical knowledge representation and query languages for new applications. In Proc. LICS-2010, pp. 228--242, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. D. Calvanese, G. De Giacomo, D. Lembo, M. Lenzerini, and R. Rosati. Tractable reasoning and efficient query answering in description logics: The DL-Lite family. J. Autom. Reasoning, 39(3):385--429, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. G. Gottlob, A. Hernich, C. Kupke, and T. Lukasiewicz. Equality-friendly well-founded semantics and applications to description logics. In Proc. AAAI-2012, pp. 757--764, 2012.Google ScholarGoogle Scholar
  7. E. Grädel and I. Walukiewicz. Guarded fixed point logic. In Proc. LICS-1999, pp. 45--54, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.Google ScholarGoogle Scholar
  9. A. Poggi, D. Lembo, D. Calvanese, G. De Giacomo, M. Lenzerini, and R. Rosati. Linking data to ontologies. J. Data Semantics, 10:133--173, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. J. S. Schlipf. The expressive powers of the logic programming semantics. J.\ Comput. Syst. Sci., 51(1):64--86, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. A. van Gelder, K. A. Ross, and J. S. Schlipf. The well-founded semantics for general logic programs. J. ACM, 38(3):620--650, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Well-founded semantics for extended datalog and ontological reasoning

              Recommendations

              Comments

              Login options

              Check if you have access through your login credentials or your institution to get full access on this article.

              Sign in
              • Published in

                cover image ACM Conferences
                PODS '13: Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI symposium on Principles of database systems
                June 2013
                334 pages
                ISBN:9781450320665
                DOI:10.1145/2463664
                • General Chair:
                • Richard Hull,
                • Program Chair:
                • Wenfei Fan

                Copyright © 2013 ACM

                Publisher

                Association for Computing Machinery

                New York, NY, United States

                Publication History

                • Published: 22 June 2013

                Permissions

                Request permissions about this article.

                Request Permissions

                Check for updates

                Qualifiers

                • research-article

                Acceptance Rates

                PODS '13 Paper Acceptance Rate24of97submissions,25%Overall Acceptance Rate476of1,835submissions,26%

              PDF Format

              View or Download as a PDF file.

              PDF

              eReader

              View online with eReader.

              eReader
              About Cookies On This Site

              We use cookies to ensure that we give you the best experience on our website.

              Learn more

              Got it!