Error diagnosis in logic programming, an adaptation of E.Y. Shapiro's method
Journal of Logic Programming
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Toward a declarative semantics for infinite objects in logic programming
Journal of Logic Programming
Declarative modeling of the operational behavior of logic languages
Theoretical 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
Handbook of theoretical computer science (vol. B)
Failure and success made symmetric
Proceedings of the 1990 North American conference on Logic programming
An algebraic framework for abstract interpretation of definite programs
Proceedings of the 1990 North American conference on Logic programming
Inductive definitions, semantics and abstract interpretations
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
ILPS '93 Proceedings of the 1993 international symposium on Logic programming
An abstract interpretation framework which accurately handles prolog search-rule and the cut
ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
An algebraic theory of observables
ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
Observable behaviors and equivalences of logic programs
Information and Computation
Nondeterminism and infinite computations in constraint programming
Selected papers of the workshop on Topology and completion in semantics
Compositionality properties of SLD-derivations
Theoretical Computer Science
Contributions to the Theory of Logic Programming
Journal of the ACM (JACM)
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Systematic design of program analysis frameworks
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Theory of observables for logic programs
Information and Computation
On the Verification of Finite Failure
PPDP '99 Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming
On the Interpretation of Infinite Computations in Logic Programming
Proceedings of the 11th Colloquium on Automata, Languages and Programming
"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
The Notions of Symptom and Error in Declarative Diagnosis of Logic Programs
AADEBUG '93 Proceedings of the First International Workshop on Automated and Algorithmic Debugging
Infinite Behaviour and Fairness in Concurrent Constraint Programming
Proceedings of the REX Workshop on Sematics: Foundations and Applications
Concurrent constraint programming languages
Concurrent constraint programming languages
An abstract interpretation approach to termination of logic programs
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
On the verification of finite failure
Journal of Computer and System Sciences
S-semantics for logic programming: A retrospective look
Theoretical Computer Science
| Hi-index | 5.23 |
We extend the framework of Comini et al. (Inform. Comput. (1999), to appear) in order to be able to reason on properties (of abstractions) of possibly infinite SLD-derivations. This issue is relevant since some important operational properties such as finite failure, infinite behavior can only be addressed as abstraction of finite and infinite SLD-derivations. The framework allows us to define new fixpoint semantics correctly modelling such properties and address problems such as compositionality w.r.t. various syntactic operators, correctness and minimality of the chosen denotations. In this paper we also apply the framework in order to obtain a new fixpoint semantics, based on a co-continuous operator, which correctly models finite failure and is compositional w.r.t. the syntactic operators.