11 citations · 16 across the 4 of their papers we have counts for
4 papers
A Productivity Checker for Logic Programming
E. Komendantskaya, P. Johann, M. Schmidt
Automated analysis of recursive derivations in logic programming is known to be a hard problem. Both termination and non-termination are undecidable problems in Turing-complete lan…
Structural Resolution: a Framework for Coinductive Proof Search and Proof Construction in Horn Clause Logic
Ekaterina Komendantskaya, Patricia Johann, Martin Schmidt
Logic programming (LP) is a programming language based on first-order Horn clause logic that uses SLD-resolution as a semi-decision procedure. Finite SLD-computations are inductive…
Coalgebraic Logic Programming: from Semantics to Implementation
Ekaterina Komendantskaya, John Power, Martin Schmidt
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 f…
Exploiting Parallelism in Coalgebraic Logic Programming
Ekaterina Komendantskaya, Martin Schmidt, Jónathan Heras
We present a parallel implementation of Coalgebraic Logic Programming (CoALP) in the programming language Go. CoALP was initially introduced to reflect coalgebraic semantics of log…