4 citations · 8 across the 9 of their papers we have counts for
13 papers
From Time to Space: The Impact of Linearity in Higher-Order Datalog
Angelos Charalambidis, Babis Kostopoulos, Panos Rondogiannis
We consider a fragment of Higher-Order Datalog with negation and argue that it generalizes the familiar and important fragment of Linear Datalog. We investigate the expressive powe…
Equilibrium Semantics and Strong Equivalence for Higher-Order Logic Programs
Angelos Charalambidis, Giannos Chatziagapis, Babis Kostopoulos +1
One of the most significant achievements of equilibrium logic was the characterization of strong equivalence, a property crucial for program transformation and optimization in Answ…
The Power of Negation in Higher-Order Datalog
Angelos Charalambidis, Babis Kostopoulos, Christos Nomikos +1
We investigate the expressive power of Higher-Order Datalog under both the well-founded and the stable model semantics, establishing tight connections with complexity classe…
Recursive Function Definitions in Static Dataflow Graphs and their Implementation in TensorFlow
Kelly Kostopoulou, Angelos Charalambidis, Panos Rondogiannis
Modern machine learning systems represent their computations as dataflow graphs. The increasingly complex neural network architectures crave for more powerful yet efficient program…
The Stable Model Semantics for Higher-Order Logic Programming
Bart Bogaerts, Angelos Charalambidis, Giannos Chatziagapis +3
We propose a stable model semantics for higher-order logic programs. Our semantics is developed using Approximation Fixpoint Theory (AFT), a powerful formalism that has successfull…
Strong Equivalence of Logic Programs with Ordered Disjunction: a Logical Perspective
Angelos Charalambidis, Christos Nomikos, Panos Rondogiannis
Logic Programs with Ordered Disjunction (LPODs) extend classical logic programs with the capability of expressing preferential disjunctions in the heads of program rules. The initi…