Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
A logical analysis of modules in logic programming
Journal of Logic Programming
A compositional semantics for logic programs
FGCS'921 Selected papers of the conference on Fifth generation computer systems
MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics. Part II : lambda calculus and domain theory: lambda calculus and domain theory
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
Theory of observables for logic programs
Information and Computation
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
A new framework for declarative programming
Theoretical Computer Science
Constraint Logic Programming with Hereditary Harrop formulas
Theory and Practice of Logic Programming
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
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
| Hi-index | 0.00 |
This paper is focused on a double extension of traditional Logic Programming which enhances it following two different approaches. On one hand, extending Horn logic to hereditary Harrop formulas HH), in order to improve the expressive power; on the other, incorporating constraints, in order to increase the efficiency. For this combination, called HH(C), an operational semantics exists, but no declarative semantic for it has been defined so far.One of the main features of (Constraint) Logic Programming is that the algorithmic behavior of (constraint) logic programs and its mathematical interpretations agree with each other, in the sense that the declarative meaning of a program can be interpreted operationally as a goal-oriented search for solutions. Both operational (algorithmic) and declarative (mathematical) semantics for programs are useful and widely developed in the frame of Logic Programming as well as in its extension, Constraint Logic Programming.For these reasons, HH(C) was in need of a more mathematical interpretation of programs. In this paper some fixed point semantics for HH(C) are presented. Taking as a starting point the techniques used by Miller to interpret the fragment of HH that incorporates intuitionistic implication in goals, we have formulated two novel extensions capable of dealing with the whole HH logic, including universal quantifiers, as well as with the presence of constraints. Those semantics are proved to be sound and complete w.r.t. the operational semantics of HH(C).