OLD resolution with tabulation
Proceedings on Third international conference on logic programming
Journal of Logic Programming
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
XSB as an efficient deductive database engine
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Advanced database systems
SLT-Resolution for the Well-Founded Semantics
Journal of Automated Reasoning
The deductive database system ℒ𝒟ℒ++
Theory and Practice of Logic Programming
Constraint Logic Programming with Hereditary Harrop formulas
Theory and Practice of Logic Programming
Context-sensitive program analysis as database queries
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
Integration of declarative and constraint programming
Theory and Practice of Logic Programming
Partial Evaluation and Program Manipulation
Design and Semantics of a Decentralized Authorization Language
CSF '07 Proceedings of the 20th IEEE Computer Security Foundations Symposium
Datalog±: a unified approach to ontologies and integrity constraints
Proceedings of the 12th International Conference on Database Theory
Evaluating very large datalog queries on social networks
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
OWL-QL-a language for deductive query answering on the Semantic Web
Web Semantics: Science, Services and Agents on the World Wide Web
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
Hi-index | 0.00 |
This work is aimed to show a concrete implementation of a deductive database system based on the scheme HH_(C) (Hereditary Harrop Formulas with Negation and Constraints) following a fixpoint semantics proposed in a previous work. We have developed a Prolog implementation for this scheme that is constraint system independent, therefore allowing to use it as a base for any instance of the formal scheme. We have developed several specific constraint systems: Real numbers, integers, Boolean and user-defined enumerated types. We have added types to the database so that relations become typed (as tables in relational databases) and each constraint is mapped to its corresponding constraint system. The predicates that compute the fixpoint giving the meaning to a database are described. In particular, we show the implementation of a forcing relation (for derivation steps) and highlight how the inherent difficulties have been overcome in a system allowing hypothetical queries, which make the database dynamically grow.