activity
20232026
most citedThe Stable Model Semantics for Higher-Order Logic Programming

4 citations · 5 across the 5 of their papers we have counts for

collaborators
Showing cs.LOShow all

5 papers · 1 filter

cs.LO2026

Fixpoint Semantics for DatalogMTL with Negation

Samuele Pollaci

DatalogMTL with negation is an extension of Datalog with metric temporal operators enriched with unstratifiable negation. In this paper, we define the stable, well-founded, Kripke-…

cs.LO2025

A Category-Theoretic Perspective on Approximation Fixpoint Theory

Samuele Pollaci

Approximation Fixpoint Theory (AFT) was founded in the early 2000s by Denecker, Marek, and Truszczyński as an abstract algebraic framework to study the semantics of non-monotonic l…

cs.LO2024★ 4 cited

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…

cs.LO2024

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-…

cs.LO2023★ 1 cited

Mathematical Foundations for Joining Only Knowing and Common Knowledge (Extended Version)

Marcos Cramer, Samuele Pollaci, Bart Bogaerts

Common knowledge and only knowing capture two intuitive and natural notions that have proven to be useful in a variety of settings, for example to reason about coordination or agre…