Theoretical Computer Science
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Computational category theory
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
An algebraic semantics of logic programs as structured transition systems
Proceedings of the 1990 North American conference on Logic programming
An algebraic semantics for structured transition systems and its application to logic programs
Theoretical Computer Science - Selected papers of the 7th Annual Symposium on theoretical aspects of computer science (STACS '90) Rouen, France, February 1990
Optimal implementation of and-or parallel Prolog
Conference proceedings on PARLE'92
Theory of observables for logic programs
Information and Computation
Higher-Order Logic Programming
Proceedings of the Third International Conference on Logic Programming
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
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
Coalgebraic semantics for parallel derivation strategies in logic programming
AMAST'10 Proceedings of the 13th international conference on Algebraic methodology and software technology
Co-logic programming: extending logic programming with coinduction
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Neural networks for proof-pattern recognition
ICANN'12 Proceedings of the 22nd international conference on Artificial Neural Networks and Machine Learning - Volume Part II
An algebraic presentation of predicate logic
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Exploiting Parallelism in Coalgebraic Logic Programming
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
Every variable-free logic program induces a PfPf-coalgebra on the set of atomic formulae in the program. The coalgebra p sends an atomic formula A to the set of the sets of atomic formulae in the antecedent of each clause for which A is the head. In an earlier paper, we identified a variable-free logic program with a PfPf -coalgebra on Set and showed that, if C(PfPf) is the cofree comonad on PfPf, then given a logic program P qua PfPf -coalgebra, the corresponding C(PfPf)- coalgebra structure describes the parallel and-or derivation trees of P. In this paper, we extend that analysis to arbitrary logic programs. That requires a subtle analysis of lax natural transformations between Poset-valued functors on a Lawvere theory, of locally ordered endofunctors and comonads on locally ordered categories, and of coalgebras, oplax maps of coalgebras, and the relationships between such for locally ordered endofunctors and the cofree comonads on them.