### Abstract

Logic programming, a class of programming languages based on first-order logic, provides simple and efficient tools for goal-oriented proof-search. Logic programming supports recursive computations, and some logic programs resemble the inductive or coinductive definitions written 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 P-f P-f-coalgebras or P-f List-coalgebras on Set. We analyse different kinds of derivation strategies and derivation trees (proof-trees, SLD-trees, and-or parallel trees) used in logic programming, and show how they can be modelled coalgebraically.

Original language | English |
---|---|

Title of host publication | Algebraic Methodology and Software Technology |

Subtitle of host publication | 13th International Conference, AMAST 2010, Lac-Beauport, QC, Canada, June 23-25, 2010. Revised Selected Papers |

Editors | Michael Johnson, Dusko Pavlovic |

Publisher | Springer |

Pages | 111-127 |

Number of pages | 17 |

ISBN (Electronic) | 9783642177965 |

ISBN (Print) | 9783642177958 |

DOIs | |

Publication status | Published - 2011 |

### Publication series

Name | Lecture Notes in Computer Science |
---|---|

Publisher | Springer Berlin Heidelberg |

Volume | 6486 |

ISSN (Print) | 0302-9743 |

### Keywords

- Logic programming
- SLD-resolution
- Parallel Logic programming
- Coalgebra
- Coinduction

## Fingerprint Dive into the research topics of 'Coalgebraic Semantics for Parallel Derivation Strategies in Logic Programming'. Together they form a unique fingerprint.

## Cite this

*Algebraic Methodology and Software Technology: 13th International Conference, AMAST 2010, Lac-Beauport, QC, Canada, June 23-25, 2010. Revised Selected Papers*(pp. 111-127). (Lecture Notes in Computer Science; Vol. 6486). Springer. https://doi.org/10.1007/978-3-642-17796-5_7