Indexed Categories and Bottom-Up Semantics of Logic Programs
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
A new framework for declarative programming
Theoretical Computer Science
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
On the algebraic structure of declarative programming languages
Theoretical Computer Science
An abstract interpretation approach to termination of logic programs
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Coalgebraic semantics for parallel derivation strategies in logic programming
AMAST'10 Proceedings of the 13th international conference on Algebraic methodology and software technology
Coalgebraic semantics for derivations in logic programming
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Observational Completeness on Abstract Interpretation
Fundamenta Informaticae - Logic, Language, Information and Computation
Exploiting Parallelism in Coalgebraic Logic Programming
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
We define a semantic framework to reason about properties of abstractions of SLD-derivations. The framework allows us to address problems such as the relation between the (top-down) operational semantics and the (bottom-up) denotational semantics, the existence of a denotation for a set of definite clauses and their properties (compositionality w.r.t. various syntactic operators, correctness, minimality, and precision). Using abstract interpretation techniques to model abstraction allows us to state very simple conditions on the observables which guarantee the validity of several general theorems.