Evaluating Answer Set Programming with Non-Convex Recursive Aggregates

DOI10.3233/FI-2016-1441zbMath1374.68096OpenAlexW2562091408MaRDI QIDQ4589242

Mario Alviano

Publication date: 9 November 2017

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2016-1441

zbMATH Keywords

aggregation functionsanswer set programmingnon-convex recursive aggregates

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic programming (68N17)

Related Items (5)

Recursive rules with aggregation: a simple unified semantics ⋮ Shared aggregate sets in answer set programming ⋮ Model enumeration in propositional circumscription via unsatisfiable core analysis ⋮ Inlining External Sources in Answer Set Programs ⋮ Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search

This page was built for publication: Evaluating Answer Set Programming with Non-Convex Recursive Aggregates