Matches in UGent Biblio for { <https://biblio.ugent.be/publication/1984121#aggregation> ?p ?o. }
Showing items 1 to 37 of
37
with 100 items per page.
- aggregation classification "P1".
- aggregation creator B109974.
- aggregation creator person.
- aggregation creator person.
- aggregation creator person.
- aggregation date "2011".
- aggregation format "application/pdf".
- aggregation hasFormat 1984121.bibtex.
- aggregation hasFormat 1984121.csv.
- aggregation hasFormat 1984121.dc.
- aggregation hasFormat 1984121.didl.
- aggregation hasFormat 1984121.doc.
- aggregation hasFormat 1984121.json.
- aggregation hasFormat 1984121.mets.
- aggregation hasFormat 1984121.mods.
- aggregation hasFormat 1984121.rdf.
- aggregation hasFormat 1984121.ris.
- aggregation hasFormat 1984121.txt.
- aggregation hasFormat 1984121.xls.
- aggregation hasFormat 1984121.yaml.
- aggregation isPartOf urn:isbn:9783642239625.
- aggregation isPartOf urn:isbn:9783642239632.
- aggregation isPartOf urn:issn:0302-9743.
- aggregation language "eng".
- aggregation publisher "Springer".
- aggregation rights "I have transferred the copyright for this publication to the publisher".
- aggregation subject "Science General".
- aggregation title "Weak and strong disjunction in possibilistic ASP".
- aggregation abstract "Possibilistic answer set programming (PASP) unites answer set programming (ASP) and possibilistic logic (PL) by associating cer- tainty values with rules. The resulting framework allows to combine both non-monotonic reasoning and reasoning under uncertainty in a single framework. While PASP has been well-studied for possibilistic definite and possibilistic normal programs, we argue that the current semantics of possibilistic disjunctive programs are not entirely satisfactory. The problem is twofold. First, the treatment of negation-as-failure in existing approaches follows an all-or-nothing scheme that is hard to match with the graded notion of proof underlying PASP. Second, we advocate that the notion of disjunction can be interpreted in several ways. In particu- lar, in addition to the view of ordinary ASP where disjunctions are used to induce a non-deterministic choice, the possibilistic setting naturally leads to a more epistemic view of disjunction. In this paper, we propose a semantics for possibilistic disjunctive programs, discussing both views on disjunction. Extending our earlier work, we interpret such programs as sets of constraints on possibility distributions, whose least specific solutions correspond to answer sets.".
- aggregation authorList BK281270.
- aggregation endPage "488".
- aggregation startPage "475".
- aggregation volume "6929".
- aggregation aggregates 3147899.
- aggregation isDescribedBy 1984121.
- aggregation similarTo 978-3-642-23963-2_37.
- aggregation similarTo LU-1984121.