On Reductive Semantics of Aggregates in Answer Set Programming
From MaRDI portal
Publication:3643117
DOI10.1007/978-3-642-04238-6_17zbMath1258.68032OpenAlexW1593909902MaRDI QIDQ3643117
Publication date: 10 November 2009
Published in: Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-04238-6_17
Logic in artificial intelligence (68T27) Semantics in the theory of computing (68Q55) Logic programming (68N17)
Related Items (7)
On elementary loops of logic programs ⋮ Team-building with answer set programming in the Gioia-Tauro seaport ⋮ Ordered completion for logic programs with aggregates ⋮ Program completion in the input language of GRINGO ⋮ Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs ⋮ Preferred First-Order Answer Set Programs ⋮ Vicious circle principle, aggregates, and formation of sets in ASP based languages
This page was built for publication: On Reductive Semantics of Aggregates in Answer Set Programming