Results 1 
8 of
8
Coalgebraic semantics for derivations in logic programming
 In CALCO’11
, 2011
"... Abstract. Every variablefree logic program induces a PfPfcoalgebra on the set of atomic formulae in the program. The coalgebra p sends an atomic formula A to the set of the sets of atomic formulae in the antecedent of each clause for which A is the head. In an earlier paper, we identified a variab ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
(Show Context)
Abstract. Every variablefree logic program induces a PfPfcoalgebra on the set of atomic formulae in the program. The coalgebra p sends an atomic formula A to the set of the sets of atomic formulae in the antecedent of each clause for which A is the head. In an earlier paper, we identified a variablefree logic program with a PfPfcoalgebra on Set and showed that, if C(PfPf) is the cofree comonad on PfPf, then given a logic program P qua PfPfcoalgebra, the corresponding C(PfPf)coalgebra structure describes the parallel andor derivation trees of P. In this paper, we extend that analysis to arbitrary logic programs. That requires a subtle analysis of lax natural transformations between Posetvalued functors on a Lawvere theory, of locally ordered endofunctors and comonads on locally ordered categories, and of coalgebras, oplax maps of coalgebras, and the relationships between such for locally ordered endofunctors and the cofree comonads on them.
Coalgebraic Derivations in Logic Programming ∗
"... Coalgebra may be used to provide semantics for SLDderivations, both finite and infinite. We first give such semantics to classical SLDderivations, proving results such as adequacy, soundness and completeness. Then, based upon coalgebraic semantics, we propose a new sound and complete algorithm for ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
Coalgebra may be used to provide semantics for SLDderivations, both finite and infinite. We first give such semantics to classical SLDderivations, proving results such as adequacy, soundness and completeness. Then, based upon coalgebraic semantics, we propose a new sound and complete algorithm for parallel derivations. We analyse this new algorithm in terms of the Theory of Observables, and we prove soundness, completeness, correctness and full abstraction results.
Coalgebraic logic programming: from semantics to implementation
 Journal of Logic and Computation
, 2014
"... ar ..."
(Show Context)
Saturated Semantics for Coalgebraic Logic Programming
"... Abstract. A series of recent papers introduces a coalgebraic semantics for logic programming, where the behavior of a goal is represented by a parallel model of computation called coinductive tree. This semantics fails to be compositional, in the sense that the coalgebra formalizing such behavior do ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
Abstract. A series of recent papers introduces a coalgebraic semantics for logic programming, where the behavior of a goal is represented by a parallel model of computation called coinductive tree. This semantics fails to be compositional, in the sense that the coalgebra formalizing such behavior does not commute with the substitutions that may apply to a goal. We suggest that this is an instance of a more general phenomenon, occurring in the setting of interactive systems (in particular, nominal process calculi), when one tries to model their semantics with coalgebrae on presheaves. In those cases, compositionality can be obtained through saturation. We apply the same approach to logic programming: the resulting semantics is compositional and enjoys an elegant formulation in terms of coalgebrae on presheaves and their right Kan extensions. 1
Coalgebraic Logic Programming: implicit versus explicit resource handling
"... Abstract. We compare approaches to implicit and explicit resource handling in coinductive and concurrent logic programming. We show various effects that implicit and explicit handling of resources have on implementation and semantics. In particular, we show that recently introduced coalgebraic logi ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Abstract. We compare approaches to implicit and explicit resource handling in coinductive and concurrent logic programming. We show various effects that implicit and explicit handling of resources have on implementation and semantics. In particular, we show that recently introduced coalgebraic logic programming [17] is a paradigm in which, in contrast to many other alternative systems, the aspects of logic and control are intertwined, and computational resources are handled implicitly.
c © U. Montanari This work is licensed under the Creative Commons Attribution License. Indexing Processes with Computational Resources∗
"... Joint work with: ..."
(Show Context)
Proposition de stage de
"... L’équipeprojet Sardes développe une approche de la construction de systèmes logiciels dynamiquement configurables (notamment systèmes d’exploitation et systèmes distribués) qui combine programmation par composants et programmation réflexive. L’équipe a en particulier développe ́ le modèle ..."
Abstract
 Add to MetaCart
(Show Context)
L’équipeprojet Sardes développe une approche de la construction de systèmes logiciels dynamiquement configurables (notamment systèmes d’exploitation et systèmes distribués) qui combine programmation par composants et programmation réflexive. L’équipe a en particulier développe ́ le modèle de composants Fractal [5]. Ce modèle de composants a éte ́ formellement défini dans le langage de spécification Alloy [8] et a fait l’objet de plusieurs implantations (dont l’implantation de référence en Java et une implantation en C). Objectifs du stage Le but du stage est d’amorcer une étude sémantique de a notion de composants logiciels telle que proposé dans le modèle Fractal en utilisant une approche coalgébrique. La notion de coalgèbre [9] fournit une approche très générale de la notion de comportement, qui généralise la notion de système de transition, ainsi que les notions standards de bisimulation et de logiques modales associées. Les travaux de Bonchi et Montanari en particulier [4, 3] ont montre ́ qu’une approche coalgébrique est tout a ̀ fait adaptée pour définir la sémantique de systèmes réactifs. Quelques travaux [1, 7, 6, 2] adoptent une telle approche pour formaliser la sémantique de composants logiciels. Malheureusement, ils ne considèrent que des assemblages de composants 1 essentiellement statiques, c’estàdire qui ne peuvent être modifiés en cours d’exécution comme c’est le cas