Abstract
Aggregates are among the most important linguistic extensions of Answer Set Programming (ASP), allowing for compact representations of properties and inductive definitions involving sets of propositions. Common use cases of aggregates in ASP are reported in this paper, which mainly focus on the semantics implemented by mainstream solvers, namely the F-stable model semantics. Other well-established semantics are also briefly discussed, providing a historical perspective on the foundation of logic programs with aggregates.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
