Coalgebraic semantics for parallel derivation strategies in logic programming

Komendantskaya, Ekaterina, McCusker, Guy and Power, John (2011) Coalgebraic semantics for parallel derivation strategies in logic programming. In Algebraic Methodology and Software Technology - 13th International Conference, AMAST 2010, Revised Selected Papers. vol. 6486 LNCS, Springer. pp. 111-127 . (doi:10.1007/978-3-642-17796-5_7).

Record type: Conference or Workshop Item (Paper)

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.

This record has no associated files available for download.

More information

Published date: 1 January 2011

Venue - Dates: 13th International Conference on Algebraic Methodology and Software Technology, AMAST 2010, , Lac-Beauport, QC, Canada, 2010-06-23 - 2010-06-25

Keywords: Coalgebra, Coinduction, Logic programming, Parallel Logic programming, SLD-resolution

Learn more about Cyber Physical Systems research