POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A logical analysis of modules in logic programming
Journal of Logic Programming
Constraint logic programming languages
Communications of the ACM
The CLP( R ) language and system
ACM Transactions on Programming Languages and Systems (TOPLAS)
Unification under a mixed prefix
Journal of Symbolic Computation
Complete axiomatizations of some quotient term algebras
Theoretical Computer Science
Syntacticness, cycle-syntacticness, and shallow theories
Information and Computation
Logic programming in intuitionistic linear logic: theory, design, and implementation
Logic programming in intuitionistic linear logic: theory, design, and implementation
Constraint logic programming with hereditary Harrop formulas
ILPS '97 Proceedings of the 1997 international symposium on Logic programming
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
Proving termination with multiset orderings
Communications of the ACM
Higher-Order Logic Programming
Proceedings of the Third International Conference on Logic Programming
Constraint Logic Programming in the Sequent Calculus
LPAR '94 Proceedings of the 5th International Conference on Logic Programming and Automated Reasoning
Solving Mixed Quantified Constraints over a Domain Based on Real Numbers and Herbrand Terms
FLOPS '02 Proceedings of the 6th International Symposium on Functional and Logic Programming
Providing declarative semantics for HH extended constraint logic programs
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
On the algebraic structure of declarative programming languages
Theoretical Computer Science
Higher-order logic programming languages with constraints: a semantics
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
The semantics of nominal logic programs
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Testing concurrent systems: an interpretation of intuitionistic logic
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
A bisimulation between DPLL(T) and a proof-search strategy for the focused sequent calculus
Proceedings of the Eighth ACM SIGPLAN international workshop on Logical frameworks & meta-languages: theory & practice
| Hi-index | 0.00 |
Constraint Logic Programming (CLP) and Hereditary Harrop formulas (HH) are two well known ways to enhance the expressivity of Horn clauses. In this paper, we present a novel combination of these two approaches. We show how to enrich the syntax and proof theory of HH with the help of a given constraint system, in such a way that the key property of HH as a logic programming language (namely, the existence of uniform proofs) is preserved. We also present a procedure for goal solving, showing its soundness and completeness for computing answer constraints. As a consequence of this result, we obtain a new strong completeness theorem for CLP that avoids the need to build disjunctions of computed answers, as well as a more abstract formulation of a known completeness theorem for HH.