Operational and denotational semantics of prolog
Journal of Logic Programming
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Equivalences of logic programs
Foundations of deductive databases and logic programming
On the declarative and procedual semantics of logic programs
Journal of Automated Reasoning
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
Algebraic properties of idempotent substitutions
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Unfolding, procedural and fixpoint semantics of logic programs
STACS 91 Proceedings of the 8th annual symposium on Theoretical aspects of computer science
Warren's abstract machine: a tutorial reconstruction
Warren's abstract machine: a tutorial reconstruction
Handbook of theoretical computer science (vol. B)
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A model-theoretic reconstruction of the operational semantics of logic programs
Information and Computation
The art of Prolog (2nd ed.): advanced programming techniques
The art of Prolog (2nd ed.): advanced programming techniques
An OR-compositional semantics for logic programs
Constructing logic programs
A compositional semantics for logic programs
FGCS'921 Selected papers of the conference on Fifth generation computer systems
Information and Computation
Observable behaviors and equivalences of logic programs
Information and Computation
Fully abstract compositional semantics for an algebra of logic programs
Theoretical Computer Science
Compositionality properties of SLD-derivations
Theoretical Computer Science
The reduced relative power operation on abstract domains
Theoretical Computer Science
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
Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
Theoretical Computer Science
Systematic design of program analysis frameworks
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
"Optimal" Collecting Semantics for Analysis in a Hierarchy of Logic Program Semantics
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
Continuation Semantics for PROLOG with Cut
TAPSOFT '89/CAAP '89 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming
Fixpoint Semantics for Partial Computed Answer Substitutions and Call Patterns
Proceedings of the Third International Conference on Algebraic and Logic Programming
Complementing Logic Program Semantics
ALP '96 Proceedings of the 5th International Conference on Algebraic and Logic Programming
A Logical Operational Semantics of Full Prolog. Part I: Selection Core and Control
CSL '89 Proceedings of the 3rd Workshop on Computer Science Logic
History of programming languages---II
Last steps towards an ultimate Prolog
IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 2
Grammar analysis and parsing by abstract interpretation
Program analysis and compilation, theory and practice
Static analysis, abstract interpretation and verification in (constraint logic) programming
A 25-year perspective on logic programming
Grammar semantics, analysis and parsing by abstract interpretation
Theoretical Computer Science
Hi-index | 5.23 |
We extend the abstract interpretation point of view on context-free grammars by Cousot and Cousot to resolution-based logic programs and proof systems. Starting from a transition-based small-step operational semantics of Prolog programs (akin to the Warren Machine), we consider maximal finite derivations for the transition system from most general goals. This semantics is abstracted by instantiation to terms and furthermore to ground terms, following the so-called c- and s-semantics approach. Orthogonally, these sets of derivations can be abstracted to SLD-trees, call patterns and models, as well as interpreters providing effective implementations (such as Prolog). These semantics can be presented in bottom-up fixpoint form. This abstract interpretation-based construction leads to classical bottom-up semantics (such as the s-semantics of computed answers, the c-semantics of correct answers of Keith Clark, and the minimal-model semantics of logical consequences of Maarten van Emden and Robert Kowalski). The approach is general and can be applied to infinite and top-down semantics in a straightforward way.