A logic-based calculus of events
New Generation Computing
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
On the declarative semantics of deductive databases and logic programs
Foundations of deductive databases and logic programming
Constraint satisfaction in logic programming
Constraint satisfaction in logic programming
The family of concurrent logic programming languages
ACM Computing Surveys (CSUR)
Logic-based approach to semantic query optimization
ACM Transactions on Database Systems (TODS)
Concurrent constraint programming
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Encapsulated search for higher-order concurrent constraint programming
ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
An Efficient Unification Algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
Logic for Problem Solving
The Versatility of Handling Disjunctions as Constraints
PLILP '93 Proceedings of the 5th International Symposium on Programming Language Implementation and Logic Programming
Design, Implementation, and Evaluation of the Constraint Language cc(FD)
Selected Papers from Constraint Programming: Basics and Trends
Selected Papers from Constraint Programming: Basics and Trends
Towards a Unified Agent Architecture that Combines Rationality with Reactivity
LID '96 Proceedings of the International Workshop on Logic in Databases
A Proof Theoretic View of Constraint Programming
Fundamenta Informaticae
The CHR-based Implementation of the SCIFF Abductive System
Fundamenta Informaticae - Special Issue on the Italian Conference on Computational Logic: CILC 2011
Hi-index | 0.00 |
We present an extension of Logic Programming (LP) which, in addition to ordinary LP clauses, also includes integrity constraints, explicit representation of disjunction in the bodies of clauses and in goals, and suspension of atoms as in concurrent logic languages. The resulting framework aims to unify Constraint Logic Programming (CLP), Abductive Logic Programming (ALP) and Semantic Query Optimisation (SQO) in deductive databases. We present a proof procedure for the new framework, simplifying and generalising previously proposed proof procedures for ALP. We discuss applications of the framework, formulating traditional problems from LP, ALP, CLP and SQO.