✦ LIBER ✦

A Coalgebraic Semantics for Epistemic Programs

✍ Scribed by Alexandru Baltag

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 256 KB
Volume: 82
Category: Article
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)80630-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Coalgebraic Semantics of Subtyping

✍ Erik Poll 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 893 KB

A Coalgebraic Foundation for Linear Time

A Coalgebraic Foundation for Linear Time Semantics

✍ John Power; Daniele Turi 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 743 KB

Coalgebraic Semantics for Positive Modal

Coalgebraic Semantics for Positive Modal Logic

✍ Alessandra Palmigiano 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 197 KB

A true concurrency semantics for paralle

A true concurrency semantics for parallel programs

✍ Tatjana Kapus; Bogomir Horvat; Marjeta Pučko 📂 Article 📅 1993 🏛 Elsevier Science ⚖ 348 KB

A kripke-kleene semantics for logic prog

A kripke-kleene semantics for logic programs*

✍ Melvin Fitting 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 895 KB

We use a language L in which we have the propositional connectives A (and), V (or), and -i (not) as primitive. Alternatively we could take some as primitive and define others via the usual definitions, which work even in Kleene's three-valued logic. We also allow quantifiers V and 3, taking both as

A declarative semantics for depth-first

A declarative semantics for depth-first logic programs

✍ Birgit Elbl 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 438 KB

Depth-®rst evaluation causes a gap between the result of the computation and the classical declarative semantics for logic programs. The paper presents a new semantics for logic programs closing that gap. Although not classical, this semantics, called biquantale semantics, is declarative, since it i