Communicating ASP and the polynomial hierarchy

DOI10.1007/978-3-642-20895-9_8MaRDI QIDQ3003244zbMATH OpenOpenAlexFDO

Authors Kim Bauters, Steven Schockaert, Dirk Vermeir, Martine De Cock

Publication date 26 May 2011

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-20895-9_8

Mathematics Subject Classification ID

Logic programming (68N17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Logic in artificial intelligence (68T27)

Recommendations

• Expressiveness of communication in answer set programming
• Communicating answer set programs
• Cooperating Answer Set Programming
• Hierarchical Decision Making in Multi-agent Systems Using Answer Set Programming
• Beyond NP: quantifying over answer sets

Cited in

(5)

• Communicating answer set programs
• Expressiveness of communication in answer set programming
• Dealing with explicit preferences and uncertainty in answer set programming
• Hierarchical Decision Making in Multi-agent Systems Using Answer Set Programming
• Cooperating Answer Set Programming

Describes a project that uses

Uses Software

• DLVHEX

This page was built for publication: Communicating ASP and the polynomial hierarchy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3003244)