Coalgebraic logic programming: from semantics to implementation. Coinductive definitions, such as that of an infinite stream, may often be described by elegant logic programs, but ones for which SLD-refutation is of no value as SLD-derivations fall into infinite loops. Such definitions give rise to questions of lazy corecursive derivations and parallelism, as execution of such logic programs can have both recursive and corecursive features at once. Observational and coalgebraic semantics have been used to study them abstractly. The programming developments have often occurred separately and have usually been implementation-led. Here, we give a coherent semantics-led account of the issues, starting with abstract category theoretic semantics, developing coalgebra to characterize naturally arising trees and proceeding towards implementation of a new dialect, CoALP, of logic programming, characterised by guarded lazy corecursion and parallelism.

References in zbMATH (referenced in 20 articles , 2 standard articles )

Showing results 1 to 20 of 20.
Sorted by year (citations)

  1. Espírito Santo, José; Matthes, Ralph; Pinto, Luís: A coinductive approach to proof search through typed lambda-calculi (2021)
  2. Gu, Tao; Zanasi, Fabio: Coalgebraic semantics for probabilistic logic programming (2021)
  3. Dagnino, Francesco; Ancona, Davide; Zucca, Elena: Flexible coinductive logic programming (2020)
  4. Dagnino, Francesco: Coaxioms: flexible coinductive definitions by inference systems (2019)
  5. Fong, Brendan; Zanasi, Fabio: Universal constructions for (co)relations: categories, monoidal categories, and props (2018)
  6. Komendantskaya, Ekaterina; Power, John: Logic programming: laxness and saturation (2018)
  7. Lipton, James; Nieva, Susana: Kripke semantics for higher-order type theory applied to constraint logic programming languages (2018)
  8. Fu, Peng; Komendantskaya, Ekaterina: Operational semantics of resolution and productivity in Horn clause logic (2017)
  9. Gallego Arias, Emilio Jesús; Lipton, James; Mariño, Julio: Constraint logic programming with a relational machine (2017)
  10. Komendantskaya, Ekaterina; Johann, Patricia; Schmidt, Martin: A productivity checker for logic programming (2017)
  11. Komendantskaya, Ekaterina; Li, Yue: Productive corecursion in logic programming (2017)
  12. Komendantskaya, Ekaterina; Power, John: Category theoretic semantics for theorem proving in logic programming: embracing the laxness (2016)
  13. Komendantskaya, Ekaterina; Power, John; Schmidt, Martin: Coalgebraic logic programming: from semantics to implementation (2016)
  14. Bonchi, Filippo; Zanasi, Fabio: Bialgebraic semantics for logic programming (2015)
  15. Fu, Peng; Komendantskaya, Ekaterina: A type-theoretic approach to resolution (2015)
  16. Komendantskaya, Ekaterina; Schmidt, Martin; Heras, Jónathan: Exploiting parallelism in coalgebraic logic programming (2014)
  17. Tsouanas, Thanos: A game semantics for disjunctive logic programming (2013)
  18. Komendantskaya, Ekaterina; McCusker, Guy; Power, John: Coalgebraic semantics for parallel derivation strategies in logic programming (2011)
  19. Komendantskaya, Ekaterina; Power, John: Coalgebraic derivations in logic programming (2011)
  20. Komendantskaya, Ekaterina; Power, John: Coalgebraic semantics for derivations in logic programming (2011)