Publikation:

The Measurement of Ranks and the Laws of Iterated Contraction

Lade...
Vorschaubild

Datum

2008

Autor:innen

Hild, Matthias

Herausgeber:innen

Kontakt

ISSN der Zeitschrift

Electronic ISSN

ISBN

Bibliografische Daten

Verlag

Schriftenreihe

Auflagebezeichnung

ArXiv-ID

Internationale Patentnummer

Angaben zur Forschungsförderung

Projekt

Open Access-Veröffentlichung
Open Access Green
Core Facility der Universität Konstanz

Gesperrt bis

Titel in einer weiteren Sprache

Publikationstyp
Zeitschriftenartikel
Publikationsstatus
Published

Erschienen in

Artificial Intelligence. 2008, 172(10), pp. 1195-1218. Available under: doi: 10.1016/j.artint.2008.03.002

Zusammenfassung

Ranking theory delivers an account of iterated contraction; each ranking function induces a specific iterated contraction behavior. The paper shows how to reconstruct a ranking function from its iterated contraction behavior uniquely up to multiplicative constant and thus how to measure ranks on a ratio scale. Thereby, it also shows how to completely axiomatize that behavior. The complete set of laws of iterated contraction it specifies amend the laws hitherto discussed in the literature.

Zusammenfassung in einer weiteren Sprache

Fachgebiet (DDC)
100 Philosophie

Schlagwörter

ranking theory, belief revision theory, difference measurement, contraction, iterated contraction

Konferenz

Rezension
undefined / . - undefined, undefined

Forschungsvorhaben

Organisationseinheiten

Zeitschriftenheft

Zugehörige Datensätze in KOPS

Zitieren

ISO 690HILD, Matthias, Wolfgang SPOHN, 2008. The Measurement of Ranks and the Laws of Iterated Contraction. In: Artificial Intelligence. 2008, 172(10), pp. 1195-1218. Available under: doi: 10.1016/j.artint.2008.03.002
BibTex
@article{Hild2008Measu-3431,
  year={2008},
  doi={10.1016/j.artint.2008.03.002},
  title={The Measurement of Ranks and the Laws of Iterated Contraction},
  number={10},
  volume={172},
  journal={Artificial Intelligence},
  pages={1195--1218},
  author={Hild, Matthias and 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/3431">
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-23T13:46:19Z</dc:date>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/40"/>
    <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by-nc-nd/2.0/"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-23T13:46:19Z</dcterms:available>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/3431"/>
    <dc:creator>Hild, Matthias</dc:creator>
    <dc:contributor>Hild, Matthias</dc:contributor>
    <dcterms:issued>2008</dcterms:issued>
    <dc:contributor>Spohn, Wolfgang</dc:contributor>
    <dcterms:abstract xml:lang="eng">Ranking theory delivers an account of iterated contraction; each ranking function induces a specific iterated contraction behavior. The paper shows how to reconstruct a ranking function from its iterated contraction behavior uniquely up to multiplicative constant and thus how to measure ranks on a ratio scale. Thereby, it also shows how to completely axiomatize that behavior. The complete set of laws of iterated contraction it specifies amend the laws hitherto discussed in the literature.</dcterms:abstract>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/40"/>
    <dc:creator>Spohn, Wolfgang</dc:creator>
    <dc:language>eng</dc:language>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:rights>Attribution-NonCommercial-NoDerivs 2.0 Generic</dc:rights>
    <dcterms:bibliographicCitation>First publ. in: Artificial Intelligence 172 (2008), 10, pp. 1195-1218</dcterms:bibliographicCitation>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/3431/1/The_Measurement_of_Ranks_and_the_Laws_of_Iterated_Contraction.pdf"/>
    <dcterms:title>The Measurement of Ranks and the Laws of Iterated Contraction</dcterms:title>
    <dc:format>application/pdf</dc:format>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/3431/1/The_Measurement_of_Ranks_and_the_Laws_of_Iterated_Contraction.pdf"/>
  </rdf:Description>
</rdf:RDF>

Interner Vermerk

xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter

Kontakt
URL der Originalveröffentl.

Prüfdatum der URL

Prüfungsdatum der Dissertation

Finanzierungsart

Kommentar zur Publikation

Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Ja
Begutachtet
Diese Publikation teilen