Recursive Aggregates as Intensional Functions in Answer Set Programming: Semantics and Strong Equivalence

Jorge Fandinno, Zachary Hansen
12/14/2024
cs.AIcs.LO

No confident code implementation found for this paper.

Abstract

This paper shows that the semantics of programs with aggregates implemented by the solvers clingo and dlv can be characterized as extended First-Order formulas with intensional functions in the logic of Here-and-There. Furthermore, this characterization can be used to study the strong equivalence of programs with aggregates under either semantics. We also present a transformation that reduces the task of checking strong equivalence to reasoning in classical First-Order logic, which serves as a foundation for automating this procedure.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Automated Verification of Equivalence Properties in Advanced Logic Programs -- Bachelor Thesis

78% match2023

First-Order Stable Model Semantics with Intensional Functions

75% match2023

A Unified View on Forgetting and Strong Equivalence Notions in Answer Set Programming

74% match2023

Generalizing Level Ranking Constraints for Monotone and Convex Aggregates

74% match2023

Finite Groundings for ASP with Functions: A Journey through Consistency

74% match2024

Learning logic programs by discovering higher-order abstractions

73% match1 repo22023

Cite this paper

@article{fandinno2024recursive,
  title  = {Recursive Aggregates as Intensional Functions in Answer Set Programming: Semantics and Strong Equivalence},
  author = {Jorge Fandinno and Zachary Hansen},
  year   = {2024},
  eprint = {2412.10975},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2412.10975v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2412.10975.svg)](https://codeofpaper.com/paper/2412.10975)

Discussion