Matches in UGent Biblio for { <https://biblio.ugent.be/publication/1984132#aggregation> ?p ?o. }
Showing items 1 to 36 of
36
with 100 items per page.
- aggregation classification "A1".
- aggregation creator B510116.
- aggregation creator B510117.
- aggregation creator person.
- aggregation creator person.
- aggregation creator person.
- aggregation date "2013".
- aggregation format "application/pdf".
- aggregation hasFormat 1984132.bibtex.
- aggregation hasFormat 1984132.csv.
- aggregation hasFormat 1984132.dc.
- aggregation hasFormat 1984132.didl.
- aggregation hasFormat 1984132.doc.
- aggregation hasFormat 1984132.json.
- aggregation hasFormat 1984132.mets.
- aggregation hasFormat 1984132.mods.
- aggregation hasFormat 1984132.rdf.
- aggregation hasFormat 1984132.ris.
- aggregation hasFormat 1984132.txt.
- aggregation hasFormat 1984132.xls.
- aggregation hasFormat 1984132.yaml.
- aggregation isPartOf urn:issn:1471-0684.
- aggregation language "eng".
- aggregation rights "I have transferred the copyright for this publication to the publisher".
- aggregation subject "Science General".
- aggregation title "Expressiveness of communication in answer set programming".
- aggregation abstract "Answer set programming (ASP) is a form of declarative programming that allows to succinctly formulate and efficiently solve complex problems. An intuitive extension of this formalism is communicating ASP, in which multiple ASP programs collaborate to solve the problem at hand. However, the expressiveness of communicating ASP has not been thoroughly studied. In this paper, we present a systematic study of the additional expressiveness offered by allowing ASP programs to communicate. First, we consider a simple form of communication where programs are only allowed to ask questions to each other. For the most part, we deliberately only consider simple programs, i.e. programs for which computing the answer sets is in P. We find that the problem of deciding whether a literal is in some answer set of a communicating ASP program using simple communication is NP-hard. In other words: we move up a step in the polynomial hierarchy due to the ability of these simple ASP programs to communicate and collaborate. Second, we modify the communication mechanism to also allow us to focus on a sequence of communicating programs, where each program in the sequence may successively remove some of the remaining models. This mimics a network of leaders, where the first leader has the first say and may remove models that he or she finds unsatisfactory. Using this particular communication mechanism allows us to capture the entire polynomial hierarchy. This means, in particular, that communicating ASP could be used to solve problems that are above the second level of the polynomial hierarchy, such as some forms of abductive reasoning as well as PSPACE-complete problems such as STRIPS planning.".
- aggregation authorList BK855020.
- aggregation endPage "394".
- aggregation issue "3".
- aggregation startPage "361".
- aggregation volume "13".
- aggregation aggregates 1984147.
- aggregation isDescribedBy 1984132.
- aggregation similarTo S1471068411000561.
- aggregation similarTo LU-1984132.