The Measurement of Ranks and the Laws of Iterated Contraction

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:69493bedb467ec190f1384e8d1c3f860

HILD, Matthias, Wolfgang SPOHN, 2008. The Measurement of Ranks and the Laws of Iterated Contraction. In: Artificial Intelligence. 172(10), pp. 1195-1218. Available under: doi: 10.1016/j.artint.2008.03.002

@article{Hild2008Measu-3431, title={The Measurement of Ranks and the Laws of Iterated Contraction}, year={2008}, doi={10.1016/j.artint.2008.03.002}, number={10}, volume={172}, journal={Artificial Intelligence}, pages={1195--1218}, author={Hild, Matthias and 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/3431"> <dc:creator>Hild, Matthias</dc:creator> <dc:language>eng</dc:language> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:title>The Measurement of Ranks and the Laws of Iterated Contraction</dcterms:title> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/3431/1/The_Measurement_of_Ranks_and_the_Laws_of_Iterated_Contraction.pdf"/> <dcterms:rights rdf:resource="https://creativecommons.org/licenses/by-nc-nd/2.0/legalcode"/> <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> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-23T13:46:19Z</dcterms:available> <dc:contributor>Spohn, Wolfgang</dc:contributor> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/3431"/> <dc:creator>Spohn, Wolfgang</dc:creator> <dcterms:issued>2008</dcterms:issued> <dc:contributor>Hild, Matthias</dc:contributor> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/40"/> <dc:rights>deposit-license</dc:rights> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/3431/1/The_Measurement_of_Ranks_and_the_Laws_of_Iterated_Contraction.pdf"/> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:format>application/pdf</dc:format> <dcterms:bibliographicCitation>First publ. in: Artificial Intelligence 172 (2008), 10, pp. 1195-1218</dcterms:bibliographicCitation> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-23T13:46:19Z</dc:date> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/40"/> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

The_Measurement_of_Ranks_and_the_Laws_of_Iterated_Contraction.pdf 88

Das Dokument erscheint in:

deposit-license Solange nicht anders angezeigt, wird die Lizenz wie folgt beschrieben: deposit-license

KOPS Suche


Stöbern

Mein Benutzerkonto