Matches in UGent Biblio for { <https://biblio.ugent.be/publication/1101388#aggregation> ?p ?o. }
Showing items 1 to 31 of
31
with 100 items per page.
- aggregation classification "B2".
- aggregation creator person.
- aggregation date "2009".
- aggregation format "application/pdf".
- aggregation hasFormat 1101388.bibtex.
- aggregation hasFormat 1101388.csv.
- aggregation hasFormat 1101388.dc.
- aggregation hasFormat 1101388.didl.
- aggregation hasFormat 1101388.doc.
- aggregation hasFormat 1101388.json.
- aggregation hasFormat 1101388.mets.
- aggregation hasFormat 1101388.mods.
- aggregation hasFormat 1101388.rdf.
- aggregation hasFormat 1101388.ris.
- aggregation hasFormat 1101388.txt.
- aggregation hasFormat 1101388.xls.
- aggregation hasFormat 1101388.yaml.
- aggregation isPartOf urn:isbn:9781904987789.
- aggregation language "eng".
- aggregation publisher "College Publications".
- aggregation rights "I have transferred the copyright for this publication to the publisher".
- aggregation subject "Philosophy and Religion".
- aggregation title "An adaptive logic for rational closure".
- aggregation abstract "In [12] Lehmann and Magidor study a strong nonmonotonic, so-called rational consequence relation, which extends the preferential consequence relation of [10] by also validating the rule of rational monotonicity. Every rational consequence relation can be semantically represented by a ranked model, and vice versa. To answer for a conditional assertion a→b the question whether it is entailed by a set of conditional assertions K, it is not sufficient to check if it is derivable by the rules for rational consequence relations, or semantically, to check if it is valid in all ranked models of K, as it can be shown that the intersection of all ranked models does not in general satisfy rational monotonicity. The authors therefore define a semantic selection in order to obtain the so-called rational closure. However, a proof theory for rational closure is missing. This paper will fill the syntactical gap for a finite language by defining an adaptive logic ARCs such that an assertion a→b is derivable from a knowledge base K containing conditional assertions and negated conditional assertions iff it is in the rational closure of K.".
- aggregation authorList BK1323400.
- aggregation endPage "67".
- aggregation startPage "47".
- aggregation volume "21".
- aggregation aggregates 1101390.
- aggregation isDescribedBy 1101388.
- aggregation similarTo LU-1101388.