Answer Set Programming without Unstratified Negation

DOI10.1007/978-3-540-89982-2_15zbMath1185.68172OpenAlexW2168842537MaRDI QIDQ5504649

Ilkka Niemelä

Publication date: 22 January 2009

Published in: Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-89982-2_15

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (2)

Answer set programming made easy ⋮ Planning with Incomplete Information in Quantified Answer Set Programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extending and implementing the stable model semantics
• Logic programs with stable model semantics as a constraint programming paradigm
• Logic programs with monotone abstract constraint atoms

This page was built for publication: Answer Set Programming without Unstratified Negation