Blog
About

127
views
0
recommends
+1 Recommend
1 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Conference Proceedings: found
      Is Open Access

      A New Approach to Inferences of Semantic Constraints

      ,

      Proceedings of the First East-European Symposium on Advances in Databases and Information Systems (ADBIS)

      Advances in Databases and Information Systems

      2-5 September 1997

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Chase procedures are well-known decision and semi-decision procedures for the implication problem among dependencies, a speci fic type of first-order logic formulas, that are used for expressing database constraints. Of course, the implication problem can also be treated by general refutationally complete inference systems, like resolution with paramodulation. Recently the inference rule of basic paramodulation has been introduced and investigated as a strategy for exploring the search space for a refutation most ef ficiently. This paper demonstrates that chase procedures can be seen as special instances of basic paramodulation by de fining the parameters of basic paramodulation, a reduction ordering and a term selection function, appropriately. The mutual simulation of chase procedures and basic paramodulation also extends to the completeness proofs.

          Related collections

          Most cited references 12

          • Record: found
          • Abstract: not found
          • Article: not found

          Testing implications of data dependencies

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            The equational theory of pomsets

             Jay Gischer (1988)
              Bookmark
              • Record: found
              • Abstract: not found
              • Book Chapter: not found

              The implication problem for data dependencies

               C. Beeri,  M. Y. Vardi (1981)
                Bookmark

                Author and article information

                Contributors
                Conference
                September 1997
                September 1997
                : 1-13
                Affiliations
                Fachbereich Informatik, Universität Dortmund

                D-44221 Dortmund, Germany

                fax: ++49-231-7552405
                Article
                10.14236/ewic/ADBIS1997.6
                © Joachim Biskup et al. Published by BCS Learning and Development Ltd. Proceedings of the First East-European Symposium on Advances in Databases and Information Systems, (ADBIS'97), St Petersburg

                This work is licensed under a Creative Commons Attribution 4.0 Unported License. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/

                Proceedings of the First East-European Symposium on Advances in Databases and Information Systems
                ADBIS
                1
                St Petersburg
                2-5 September 1997
                Electronic Workshops in Computing (eWiC)
                Advances in Databases and Information Systems
                Product
                Product Information: 1477-9358BCS Learning & Development
                Self URI (journal page): https://ewic.bcs.org/
                Categories
                Electronic Workshops in Computing

                Comments

                Comment on this article