Ranking Functions, AGM Style

Spohn, Wolfgang

Ranking Functions, AGM Style

Dateien

Ranking_Functions.pdfGröße: 282.83 KBDownloads: 144

Datum

1999

Open Access-Veröffentlichung

Open Access Green

Sammlungen

Philosophie

Publikationstyp

Beitrag zu einem Sammelband

Publikationsstatus

Published

Erschienen in

HANSSON, B., ed. and others. Internet Festschrift for Peter Gärdenfors. Lund, 1999

Zusammenfassung

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.

Fachgebiet (DDC)

100 Philosophie

Zitieren

ISO 690

SPOHN, Wolfgang, 1999. Ranking Functions, AGM Style. In: HANSSON, B., ed. and others. Internet Festschrift for Peter Gärdenfors. Lund, 1999

BibTex

@incollection{Spohn1999Ranki-3537,
  year={1999},
  title={Ranking Functions, AGM Style},
  address={Lund},
  booktitle={Internet Festschrift for Peter Gärdenfors},
  editor={Hansson, B.},
  author={Spohn, Wolfgang}
}

RDF

<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/server/rdf/resource/123456789/3537">
    <dc:creator>Spohn, Wolfgang</dc:creator>
    <dcterms:issued>1999</dcterms:issued>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by-nc-nd/2.0/"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/40"/>
    <dcterms:title>Ranking Functions, AGM Style</dcterms:title>
    <dc:contributor>Spohn, Wolfgang</dc:contributor>
    <dcterms:bibliographicCitation>First publ. in: Internet Festschrift for Peter Gärdenfors / B. Hansson ... (eds.). - Lund, 1999</dcterms:bibliographicCitation>
    <dc:rights>Attribution-NonCommercial-NoDerivs 2.0 Generic</dc:rights>
    <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>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/40"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-23T13:46:40Z</dcterms:available>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/3537/1/Ranking_Functions.pdf"/>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/3537/1/Ranking_Functions.pdf"/>
    <dc:language>eng</dc:language>
    <dc:format>application/pdf</dc:format>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/3537"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-23T13:46:40Z</dc:date>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Nein