RT Book, Section
T1 Formalizing a constraint deductive database language based on hereditary harrop formulas with negation
A1 Nieva Soto, Susana
A1 Sánchez-Hernández, Jaime
A1 Sáenz Pérez, Fernando
A2 Garrigue, Jacques
A2 Hermenegildo, Manuel
AB 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.
PB Springer-Verlag Berlín
SN 978-3-540-78968-0
YR 2008
FD 2008
LK https://hdl.handle.net/20.500.14352/53171
UL https://hdl.handle.net/20.500.14352/53171
LA eng
NO Conference: 9th International Symposium on Functional and Logic Programming Location: Ise, Japan Date: Apr 14-16, 2008
NO MERIT-FORMS
NO PROMESAS-CAM
DS Docta Complutense
RD 6 abr 2025