Gu, T;
Zanasi, F;
(2021)
Coalgebraic Semantics for Probabilistic Logic Programming.
Logical Methods in Computer Science
, 17
(2)
2:1-2:35.
Preview |
Text
2012.03916.pdf - Published Version Download (1MB) | Preview |
Abstract
Probabilistic logic programming is increasingly important in artificial intelligence and related fields as a formalism to reason about uncertainty. It generalises logic programming with the possibility of annotating clauses with probabilities. This paper proposes a coalgebraic semantics on probabilistic logic programming. Programs are modelled as coalgebras for a certain functor F, and two semantics are given in terms of cofree coalgebras. First, the F-coalgebra yields a semantics in terms of derivation trees. Second, by embedding F into another type G, as cofree G-coalgebra we obtain a `possible worlds' interpretation of programs, from which one may recover the usual distribution semantics of probabilistic logic programming. Furthermore, we show that a similar approach can be used to provide a coalgebraic semantics to weighted logic programming.
| Type: | Article |
|---|---|
| Title: | Coalgebraic Semantics for Probabilistic Logic Programming. |
| Open access status: | An open access version is available from UCL Discovery |
| Publisher version: | https://lmcs.episciences.org/7365 |
| Additional information: | This work is licensed under the Creative Commons Attribution License. To view a copy of this license, visit https://creativecommons.org/licenses/by/4.0/ or send a letter to Creative Commons, 171 Second St, Suite 300, San Francisco, CA 94105, USA, or Eisenacher Strasse 2, 10777 Berlin, Germany |
| UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science |
| URI: | https://discovery.ucl.ac.uk/id/eprint/10127516 |
Archive Staff Only
 |
View Item |
