Formalizing a constraint deductive database language based on hereditary Harrop formulas with negation

Authors:
Susana Nieva;Jaime Sánchez-Hernández;Fernando Sáenz-Pérez
Affiliations:
Dept. Sistemas Informáticos y Computación, UCM, Spain;Dept. Sistemas Informáticos y Computación, UCM, Spain;Dept. Ingeniería del Software e Inteligencia Artificial, UCM, Spain
Venue:
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
Year:
2008

Citing 11
Cited 1

Constraint logic programming

POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Advanced database systems

Advanced database systems
Safe constraint queries

PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Spatial databases with application to GIS

Spatial databases with application to GIS
Introduction to constraint databases

Introduction to constraint databases
Foundations of Databases: The Logical Level

Foundations of Databases: The Logical Level
Constraint Logic Programming with Hereditary Harrop formulas

Theory and Practice of Logic Programming
Providing declarative semantics for HH extended constraint logic programs

PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
Integration of declarative and constraint programming

Theory and Practice of Logic Programming
Higher-order logic programming languages with constraints: a semantics

TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Towards an integration of answer set and constraint solving

ICLP'05 Proceedings of the 21st international conference on Logic Programming

Implementing a fixed point semantics for a constraint deductive database based on hereditary harrop formulas

PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present an extension of the scheme HH(C) (Hereditary Harrop formulas with Constraints) with a suitable formulation of negation in order to obtain a constraint deductive database query language. In addition to constraints, our proposal includes logical connectives (implication and quantifiers) for defining databases and queries, which altogether are unavailable in current database query languages. We define a proof theoretic semantic framework based on a sequent calculus, that allows to represent the meaning of a database query by means of a derived constraint answer in the sense of CLP. We also introduce an appropriate notion of stratification, which provides a starting point for suitable operational semantics dealing with recursion and negation. We formalize a fixed point semantics for stratifiable databases, whose fixpoint operator is applied stratum by stratum. This semantics is proved to be sound and complete with respect to derivability in the sequent calculus, and it provides the required support for actual implementations, as the prototype we have developed already and introduce in this paper.