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

On the BDD/FC conjecture

Published:22 June 2013Publication History

ABSTRACT

Bounded Derivation Depth property (BDD) and Finite Controllability (FC) are two properties of sets of datalog rules and tuple generating dependencies (known as Datalog3 programs), which recently attracted some attention. We conjecture that the first of these properties implies the second, and support this conjecture by some evidence proving, among other results, that it holds true for all theories over binary signature.

References

  1. V. Barany, G. Gottlob, and M. Otto. Querying the guarded fragment; Proc. of the 25th IEEE Symposium on Logic in Computer Science, LICS 2010, Edinburgh, UK, pp. 1--10, 2010; Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. A. Cali, G. Gottlob, and T. Lukasiewicz; A general datalog-based framework for tractable queryanswering over ontologies; in Proc. of PODS, 2009; Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. A. Cali, G. Gottlob, and T. Lukasiewicz; A general datalog-based framework for tractable queryanswering over ontologies; J. Web Sem. 14, 2012, 57--83 Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. A. Cali, G. Gottlob, and A. Pieris; Advanced processing for ontological queries; Proc. VLDB-10,3(1):554--565, 2010 Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. A. Cali, G. Gottlob, and A. Pieris; % tu jest definicja sticky-join Query Answering under Non-guarded Rules in Datalog +/- ; Web Reasoning and Rule SystemsLecture Notes in Computer Science, 2010, Volume 6333, pp 1--17; Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. T. Gogacz, J. Marcinkowski; Converging to the Chase and Some Finite. Controllability Results; Proc. of the 28th IEEE Symposium on Logic in Computer Science, LICS 2013, New Orleans, USA, to appear;Google ScholarGoogle Scholar
  7. D. S. Johnson and A. C. Klug. Testing containment of conjunctive queries under functional and inclusiondependencies; JCSS 28(1):167--189, 1984;Google ScholarGoogle ScholarCross RefCross Ref
  8. R. Rosati; On the decidability and finite controllability of query processing in databases with incomplete information; in Proc. PODS 2006, pp. 356--365; Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. R. Rosati; On the decidability and finite controllability of query processing in databases with incomplete information; J. Comput. Syst. Sci. 77(3),2011, pp. 572--594 Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. S. Shelah; (1969), Stable theories; Israel J. Math. 7 (3): 187--202.Google ScholarGoogle Scholar

Index Terms

  1. On the BDD/FC conjecture

        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!