Author of the publication

Communicating ASP and the Polynomial Hierarchy.

, , , and . LPNMR, volume 6645 of Lecture Notes in Computer Science, page 67-79. Springer, (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Communicating ASP and the Polynomial Hierarchy., , , and . LPNMR, volume 6645 of Lecture Notes in Computer Science, page 67-79. Springer, (2011)Characterizing and extending answer set semantics using possibility theory., , , and . Theory Pract. Log. Program., 15 (1): 79-116 (2015)Possibilistic Answer Set Programming Revisited., , , and . UAI, page 48-55. AUAI Press, (2010)CAN(PLAN)+: Extending the Operational Semantics of the BDI Architecture to deal with Uncertain Information., , , , and . UAI, page 52-61. AUAI Press, (2014)Weak and Strong Disjunction in Possibilistic ASP., , , and . SUM, volume 6929 of Lecture Notes in Computer Science, page 475-488. Springer, (2011)A qualitative field study on explainable AI for lay users subjected to AI cyberattacks., , , , , , , , , and . CoRR, (2024)Using Answer Set Programming for Solving Boolean Games., , , , and . KR, AAAI Press, (2014)A Framework for Plan Library Evolution in BDI Agent Systems., , , and . ICTAI, page 414-421. IEEE, (2018)Possible and Necessary Answer Sets of Possibilistic Answer Set Programs., , , and . ICTAI, page 836-843. IEEE Computer Society, (2012)Anytime Algorithms for Solving Possibilistic MDPs and Hybrid MDPs., , and . FoIKS, volume 9616 of Lecture Notes in Computer Science, page 24-41. Springer, (2016)