Ranking Functions, AGM Style
| Type of Publication: | Contribution to a collection |
| URI (citable link): | http://nbn-resolving.de/urn:nbn:de:bsz:352-opus-62630 |
| Author: | Spohn, Wolfgang |
| Year of publication: | 1999 |
| Published in: | Internet Festschrift for Peter Gärdenfors / Hansson, B. et al. (ed.). - Lund, 1999 |
| Summary: |
The paper first points out that ranking functions are superior to AGM belief revision theory in two crucial respects, i.e. in solving the problem of iterated belief revision and in giving an adequate account of doxastic independence (this was indeed why ranking function were developed in No. 15). Second, it shows how ranking functions are uniquely reflected in iterated belief change. More precisely, it specifies conditions on threefold contractions which suffice to represent contractions by a ranking function uniquely up to multiplication by a positive integer (a result independently obtained by Matthias Hild). Thus, an important advantage AGM theory was always claimed to have over ranking functions proves to be spurious.
|
| Subject (DDC): | 100 Philosophy |
| Link to License: | Terms of use |
Cite This
Files in this item
![[PDF]](/themes/Kops/images/mimes/pdf.png "PDF file"){kind=small}
SPOHN, Wolfgang, 1999. Ranking Functions, AGM Style. In: HANSSON, B., ed. and others. Internet Festschrift for Peter Gärdenfors. Lund
@incollection{Spohn1999Ranki-3537, title={Ranking Functions, AGM Style}, year={1999}, address={Lund}, booktitle={Internet Festschrift for Peter Gärdenfors}, editor={Hansson, B.}, author={Spohn, Wolfgang} }
<rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:void="http://rdfs.org/ns/void#" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/3537"> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dcterms:bibliographicCitation>First publ. in: Internet Festschrift for Peter Gärdenfors / B. Hansson ... (eds.). - Lund, 1999</dcterms:bibliographicCitation> <dcterms:title>Ranking Functions, AGM Style</dcterms:title> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/3537/1/Ranking_Functions.pdf"/> <dcterms:issued>1999</dcterms:issued> <dc:language>eng</dc:language> <dc:creator>Spohn, Wolfgang</dc:creator> <dc:contributor>Spohn, Wolfgang</dc:contributor> <dcterms:abstract xml:lang="deu">The paper first points out that ranking functions are superior to AGM belief revision theory in two crucial respects, i.e. in solving the problem of iterated belief revision and in giving an adequate account of doxastic independence (this was indeed why ranking function were developed in No. 15). Second, it shows how ranking functions are uniquely reflected in iterated belief change. More precisely, it specifies conditions on threefold contractions which suffice to represent contractions by a ranking function uniquely up to multiplication by a positive integer (a result independently obtained by Matthias Hild). Thus, an important advantage AGM theory was always claimed to have over ranking functions proves to be spurious.</dcterms:abstract> <dc:format>application/pdf</dc:format> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-23T13:46:40Z</dcterms:available> <dc:rights>terms-of-use</dc:rights> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/40"/> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/40"/> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/3537/1/Ranking_Functions.pdf"/> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/3537"/> <dcterms:rights rdf:resource="https://creativecommons.org/licenses/by-nc-nd/2.0/legalcode"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-23T13:46:40Z</dc:date> </rdf:Description> </rdf:RDF>
Downloads since Oct 1, 2014 (Information about access statistics)
| Ranking_Functions.pdf | 118 |
This item appears in the following Collection(s)
Except where otherwise noted, this item's license is described as terms-of-use
Search KOPS
Browse
My Account
