A Coalgebraic Semantics for Epistemic Programs
نویسندگان
چکیده
منابع مشابه
Coalgebraic semantics for logic programs
General logic programs with negation have the 3-valued 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 in it), and present an algorithmic transformation of logic programs into the system of tuple-variable equations which is a -coalgebra. The solut...
متن کاملAlgebraic Semantics for Coalgebraic Logics
With coalgebras usually being defined in terms of an endofunctor T on sets, this paper shows that modal logics for T -coalgebras can be naturally described as functors L on boolean algebras. Building on this idea, we study soundness, completeness and expressiveness of coalgebraic logics from the perspective of duality theory. That is, given a logic L for coalgebras of an endofunctor T , we cons...
متن کاملCoalgebraic semantics for timed processes
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 comonad” generated by the time domain. All our examples of time domains satisfy a partial closure prop...
متن کاملCoalgebraic Semantics for Quantum Computation
Coalgebras generalize various kinds of dynamical systems occuring in mathematics and computer science. Examples of systems that can be modeled as coalgebras include automata and Markov chains. In this thesis we will present a coalgebraic representation of systems occuring in the field of quantum computation. This will allow us to derive a method to convert quantum mechanical systems into simple...
متن کاملA Coalgebraic Semantics of Subtyping
Coalgebras have been proposed as formal basis for the semantics of objects in the sense of object-oriented programming. This paper shows that this semantics provides a smooth interpretation for subtyping, a central notion in object-oriented programming. We show that different characterisations of behavioural subtyping found in the literature can conveniently be expressed in coalgebraic terms. W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2003
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)80630-3