Results 1  10
of
2,669
Coalgebraic semantics for logic programming
 18th Worshop on (Constraint) Logic Programming, WLP 2004, March 0406
, 2004
"... www.dis.uniroma1.it / ¢ majkic/ Abstract. General logic programs with negation have the 3valued minimal Herbrand models based on the Kripke’s fixpoint knowledge revision operator and on Clark’s completion. Based on these results we deifine a new algebra £¥ ¤, (with the relational algebra embedded ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
is just the coalgebraic semantics for logic programs. It is shown that such unique solution corresponds to the minimal Herbrand model of annotated version of logic programs and is closely related to the encapsulation of multivalued logic programs into the 2valued annotated logic programs. 1
A Coalgebraic Semantics of Subtyping
, 2000
"... Coalgebras have been proposed as formal basis for the semantics of objects in the sense of objectoriented programming. This paper shows that this semantics provides a smooth interpretation for subtyping, a central notion in objectoriented programming. We show that different characterisations of be ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
Coalgebras have been proposed as formal basis for the semantics of objects in the sense of objectoriented programming. This paper shows that this semantics provides a smooth interpretation for subtyping, a central notion in objectoriented programming. We show that different characterisations
Coalgebraic semantics for timed processes
 Inf. & Comp
, 2006
"... We give a coalgebraic formulation of timed processes and their operational semantics. We model time by a monoid called a “time domain”, and we model processes by “timed transition systems”, which amount to partial monoid actions of the time domain or, equivalently, coalgebras for an “evolution comon ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
We give a coalgebraic formulation of timed processes and their operational semantics. We model time by a monoid called a “time domain”, and we model processes by “timed transition systems”, which amount to partial monoid actions of the time domain or, equivalently, coalgebras for an “evolution
Initial Algebra and Final Coalgebra Semantics for Concurrency
, 1994
"... The aim of this paper is to relate initial algebra semantics and final coalgebra semantics. It is shown how these two approaches to the semantics of programming languages are each others dual, and some conditions are given under which they coincide. More precisely, it is shown how to derive initial ..."
Abstract

Cited by 56 (8 self)
 Add to MetaCart
The aim of this paper is to relate initial algebra semantics and final coalgebra semantics. It is shown how these two approaches to the semantics of programming languages are each others dual, and some conditions are given under which they coincide. More precisely, it is shown how to derive initial
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
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
Coalgebraic Semantics of Modal Logics: an Overview
, 2011
"... Coalgebras can be seen as a natural abstraction of Kripke frames. In the same sense, coalgebraic logics are generalised modal logics. In this paper, we give an overview of the basic tools, techniques and results that connect coalgebras and modal logic. We argue that coalgebras unify the semantics of ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
Coalgebras can be seen as a natural abstraction of Kripke frames. In the same sense, coalgebraic logics are generalised modal logics. In this paper, we give an overview of the basic tools, techniques and results that connect coalgebras and modal logic. We argue that coalgebras unify the semantics
Towards a Coalgebraic Semantics of the Ambient Calculus
"... the classical process calculus CCS, a coalgebraic semantics has been defined in [10]; further work in similar directions is found e.g. in [6, 7]. Here, we present work leading towards a coalgebraic denotational semantics for mobile process calculi, in particular the ambient calculus [4]. This poses ..."
Abstract
 Add to MetaCart
the classical process calculus CCS, a coalgebraic semantics has been defined in [10]; further work in similar directions is found e.g. in [6, 7]. Here, we present work leading towards a coalgebraic denotational semantics for mobile process calculi, in particular the ambient calculus [4]. This poses
Coalgebraic Semantics for Parallel Derivation Strategies in Logic Programming
"... Abstract. Logic programming, a class of programming languages based on firstorder logic, provides simple and efficient tools for goaloriented proofsearch. Logic programming supports recursive computations, and some logic programs resemble the inductive or coinductive definitions written in functi ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
in functional programming languages. In this paper, we give a coalgebraic semantics to logic programming. We show that ground logic programs can be modelled by either Pf Pfcoalgebras or Pf Listcoalgebras on Set. We analyse different kinds of derivation strategies and derivation trees (prooftrees, SLD
Coalgebra semantics for hidden algebra: parameterized objects and inheritance
 the 12th Workshop on Algebraic Development Techniques
, 1998
"... Abstract. The theory of hidden algebras combines standard algebraic techniques with coalgebraic techniques to provide a semantic foundation for the object paradigm. This paper focuses on the coalgebraic aspect of hidden algebra, concerned with signatures of destructors at the syntactic level and wi ..."
Abstract

Cited by 24 (0 self)
 Add to MetaCart
Abstract. The theory of hidden algebras combines standard algebraic techniques with coalgebraic techniques to provide a semantic foundation for the object paradigm. This paper focuses on the coalgebraic aspect of hidden algebra, concerned with signatures of destructors at the syntactic level
A New Coalgebraic Semantics for Positive Modal Logic
 Coalgebraic Methods in Computer Science (CMCS’03), volume 82.1 of ENTCS
, 2002
"... Positive Modal Logic is the restriction of the modal local consequence relation defined by the class of all Kripke models to the propositional negationfree modal language. The class of positive modal algebras is the one canonically associated with PML according to the theory of Abstract Algebraic L ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
Logic. In [4], a Priestleystyle duality is established between the category of positive modal algebras and the category of K spaces.In this paper, we establish a categorical equivalence between the category K spaces and the category Coalg(V) of coalgebras of a suitable endofunctor V
Results 1  10
of
2,669