Foundations of logic programming
Foundations of logic programming
Error diagnosis in logic programming, an adaptation of E.Y. Shapiro's method
Journal of Logic Programming
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Equivalences of logic programs
Foundations of deductive databases and logic programming
Fully abstract compositional semantics for logic programs
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Declarative modeling of the operational behavior of logic languages
Theoretical Computer Science
Proof theory and semantics of logic programs
Proceedings of the Fourth Annual Symposium on Logic in computer science
Finite failures and partial computations in concurrent logic languages
Theoretical Computer Science - Special issue on the international conference on fifth generation computer systems. Tokyo, 1988
Preservation of stronger equivalence in unfold/fold logic program transformation
Theoretical Computer Science - Special issue on the international conference on fifth generation computer systems. Tokyo, 1988
An analysis of loop checking mechanisms for logic programs
Theoretical Computer Science
A practical framework for the abstract interpretation of logic programs
Journal of Logic Programming
Handbook of theoretical computer science (vol. B)
Partial evaluation in logic programming
Journal of Logic Programming
Deriving descriptions of possible values of program variables by means of abstract interpretation
Journal of Logic Programming
A general framework for semantics-based bottom-up abstract interpretation of logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Differential logic programming
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A new fixpoint semantics for Prolog
ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
Precise and efficient groundness analysis for logic programs
ACM Letters on Programming Languages and Systems (LOPLAS)
Bottom-up abstract interpretation of logic programs
Theoretical Computer Science
Independence in constraint logic programs
ILPS '93 Proceedings of the 1993 international symposium on Logic programming
A compositional semantics for logic programs
FGCS'921 Selected papers of the conference on Fifth generation computer systems
An algebraic theory of observables
ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
Formal bases for dataflow analysis of logic programs
Advances in logic programming theory
Information and Computation
Observable behaviors and equivalences of logic programs
Information and Computation
Transformations of CLP modules
Theoretical Computer Science
Program analysis: the abstract interpretation perspective
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
Goal independency and call patterns in the analysis of logic programs
SAC '94 Proceedings of the 1994 ACM symposium on Applied computing
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Algorithmic Program DeBugging
Logical optimality of groundness analysis
Theoretical Computer Science
Systematic design of program analysis frameworks
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Proving Properties of Logic Programs by Abstract Diagnosis
Selected papers from the 5th LOMAPS Workshop on Analysis and Verification of Multiple-Agent Languages
Abstract Debugging of Logic Program
LOPSTR '94/META '94 Proceedings of the 4th International Workshops on Logic Programming Synthesis and Transformation - Meta-Programming in Logic
Fixpoint Semantics for Partial Computed Answer Substitutions and Call Patterns
Proceedings of the Third International Conference on Algebraic and Logic Programming
Meta-circular abstract interpretation in prolog
The essence of computation
Proof-theoretic and higher-order extensions of logic programming
A 25-year perspective on logic programming
| Hi-index | 0.00 |
The paper provides an overview of an approach to the semantics of (constraint) logic programs, whose aim is providing suitable theoretical bases for modeling observable properties of logic programs in a compositional way. The approach is based on the idea of choosing (either equivalence classes or abstractions of) sets of clauses as semantic domain and provides an uniform framework for defining different compositional semantics for logic programs, parametrically with respect to a given notion of observability. Since some observable properties have a natural definition which is dependent on the selection rule, the framework has been adapted to cope also with a suitable class of rules, which includes the leftmost selection rule. This provides a formal description of most of the observable properties of Prolog derivations and can therefore be viewed as reference semantics for Prolog transformation and analysis systems.