An extended constraint deductive database: theory and implementation
From MaRDI portal
Publication:2436517
DOI10.1016/j.jlap.2013.07.002zbMath1283.68145WikidataQ62048178 ScholiaQ62048178MaRDI QIDQ2436517
Jaime Sánchez-Hernández, Fernando Sáenz-Pérez, Susana Nieva, Gabriel Aranda-López
Publication date: 25 February 2014
Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlap.2013.07.002
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Negation in rule-based database languages: A survey
- Hypothetical datalog: Complexity and expressibility
- What is failure? An approach to constructive negation
- Negation and constraint logic programming
- Uniform proofs as a foundation for logic programming
- A lattice-theoretical fixpoint theorem and its applications
- On the power of magic
- Higher-Order Logic Programming Languages with Constraints: A Semantics
- N-Prolog: An extension of prolog with hypothetical implication. II. Logical foundations, and negation as failure
- Negation in logic programming
- Success and failure for hereditary Harrop formulae
- The well-founded semantics for general logic programs
- Logic programming and negation: A survey
- A logical semantics for hypothetical rulebases with deletion
- Constraint Logic Programming with Hereditary Harrop formulas
- Formalizing a Constraint Deductive Database Language Based on Hereditary Harrop Formulas with Negation
- Introduction to constraint databases