5 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…
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…
A Category-Theoretic Perspective on Higher-Order Approximation Fixpoint Theory
Samuele Pollaci, Babis Kostopoulos, Marc Denecker +1
Approximation Fixpoint Theory (AFT) is an algebraic framework designed to study the semantics of non-monotonic logics. Despite its success, AFT is not readily applicable to higher-…