Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Logic programming and parallel complexity
Foundations of deductive databases and logic programming
Declarative modeling of the operational behavior of logic languages
Theoretical Computer Science
The Aurora or-parallel Prolog system
New Generation Computing - Selected papers on parallel logic programming from the International Conference on Fifth Generation Computer Systems, 1988
Prolog and its performance: exploiting independent and-parallelism
Logic programming
Andorra I: a parallel Prolog system that transparently exploits both And-and or-parallelism
PPOPP '91 Proceedings of the third ACM SIGPLAN symposium on Principles and practice of parallel programming
Logic programming, functional programming, and inductive definitions
Proceedings of the international workshop on Extensions of logic programming
Full Prolog and scheduling or-parallelism in muse
International Journal of Parallel Programming
Optimal implementation of and-or parallel Prolog
Conference proceedings on PARLE'92
Observable behaviors and equivalences of logic programs
Information and Computation
Theory of observables for logic programs
Information and Computation
Higher-Order Logic Programming
Proceedings of the Third International Conference on Logic Programming
On the Duality Between Or-parallelism and And-parallelism in Logic Programming
Euro-Par '95 Proceedings of the First International Euro-Par Conference on Parallel Processing
A Fibrational Semantics for Logic Programs
ELP '96 Proceedings of the 5th International Workshop on Extensions of Logic Programming
Fibrational Semantics for Many-Valued Logic Programs: Grounds for Non-Groundness
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Type Inference by Coinductive Logic Programming
Types for Proofs and Programs
Reactive systems, (semi-)saturated semantics and coalgebras on presheaves
Theoretical Computer Science
On the algebraic structure of declarative programming languages
Theoretical Computer Science
Coinductive logic programming and its applications
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Relating coalgebraic notions of bisimulation: with applications to name-passing process calculi
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Co-logic programming: extending logic programming with coinduction
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Coalgebraic semantics for derivations in logic programming
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Exploiting Parallelism in Coalgebraic Logic Programming
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
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 PfPf -coalgebras or Pf Listcoalgebras 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.