An extended constraint deductive database: Theory and implementation

Aranda-López, Gabriel; Nieva, Susana; Sáenz-Pérez, Fernando; Sánchez-Hernández, Jaime

doi:10.1016/j.jlap.2013.07.002

Cited by 2 publications

(3 citation statements)

References 42 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…When solving the query q(X), the following PDG and strata are computed for the new context [1] due to the assumption in rule (1,[]), which can be displayed by enabling verbose output (with /verbose on). DES> q(X) ... Info: Building hypothetical computation context [1] for: p(Y) :-t(Y), not r(Y). Info: PDG: Nodes: [p/1,q/1,r/1,s/1,t/1] Arcs : [p/1-r/1,p/1+t/1,q/1+s/1] Info: Strata: [(q/1,1),(r/1,1),(s/1,1),(t/1,1),(p/1,2)] ...…”

Section: Dynamic Pdg and Stratificationmentioning

confidence: 99%

“…In the logic programming field, Miller and Nadathur worked at developing and justifying the intuitionistic theory of hereditary Harrop (HH) formulas (see, e.g., [15]), which lead to the implementation of λ Prolog. A more recent work [1] proposes HH ¬ (C) as a constraint database framework including negation, but with no negative assumptions.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Restricted Predicates for Hypothetical Datalog

Sáenz-Pérez

2015

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

Hypothetical Datalog is based on an intuitionistic semantics rather than on a classical logic semantics, and embedded implications are allowed in rule bodies. While the usual implication (i.e., the neck of a Horn clause) stands for inferring facts, an embedded implication plays the role of assuming its premise for deriving its consequence. A former work introduced both a formal framework and a goal-oriented tabled implementation, allowing negation in rule bodies. While in that work positive assumptions for both facts and rules can occur in the premise, negative assumptions are not allowed. In this work, we cover this subject by introducing a new concept: a restricted predicate, which allows negative assumptions by pruning the usual semantics of a predicate. This new setting has been implemented in the deductive system DES.

show abstract

Section: Dynamic Pdg and Stratificationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Restricted Predicates for Hypothetical Datalog

Sáenz-Pérez

2015

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

show abstract

“…If bulk updates are needed, the transaction base must account for them. In [1] we developed a more expressive setting for constraint deductive databases based on Hereditary Harrop formulas. In particular, it provides support for assuming rules as hypothetical queries.…”

Section: Introductionmentioning

confidence: 99%

Incorporating Hypothetical Views and Extended Recursion into SQL Database Systems

Aranda-López¹,

Nieva²,

Sáenz-Pérez³

et al.

EPiC Series in Computing

Self Cite

View full text Add to dashboard Cite

Current database systems supporting recursive SQL impose restrictions on queries such as linearity, and do not implement mutual recursion. In a previous work we presented the language and prototype R-SQL to overcome those drawbacks. Now we introduce a formalization and an implementation of the database system HR-SQL that, in addition to extended recursion, incorporates hypothetical reasoning in a novel way which cannot be found in any other SQL system, allowing both positive and negative assumptions. The formalization extends the fixpoint semantics of R-SQL. The implementation improves the efficiency of the previous prototype and is integrated in a commercial DBMS.

show abstract

An extended constraint deductive database: Theory and implementation

Cited by 2 publications

References 42 publications

Restricted Predicates for Hypothetical Datalog

Restricted Predicates for Hypothetical Datalog

Incorporating Hypothetical Views and Extended Recursion into SQL Database Systems

Contact Info

Product

Resources

About