A general non-probabilistic theory of inductive reasoning

Spohn, Wolfgang

A general non-probabilistic theory of inductive reasoning

Dateien

Spohn.pdfGröße: 1.37 MBDownloads: 658

Datum

1990

Open Access-Veröffentlichung

Open Access Green

Sammlungen

Philosophie

Publikationstyp

Zeitschriftenartikel

Publikationsstatus

Published

Erschienen in

Machine intelligence and pattern recognition. 1990, 9(Uncertainty in Artificial Intelligence 4), pp. 149-158. Available under: doi: 10.1016/B978-0-444-88650-7.50017-2

Zusammenfassung

This is a useful condensed version of "Ordinal Conditional Functions. A Dynamic Theory of Epistemic States", additionally explaining that ranking functions cannot be subsumed under Dempster-Shafer belief functions.

Fachgebiet (DDC)

100 Philosophie

Zitieren

ISO 690

SPOHN, Wolfgang, 1990. A general non-probabilistic theory of inductive reasoning. In: Machine intelligence and pattern recognition. 1990, 9(Uncertainty in Artificial Intelligence 4), pp. 149-158. Available under: doi: 10.1016/B978-0-444-88650-7.50017-2

BibTex

@article{Spohn1990gener-13660,
  year={1990},
  doi={10.1016/B978-0-444-88650-7.50017-2},
  title={A general non-probabilistic theory of inductive reasoning},
  number={Uncertainty in Artificial Intelligence 4},
  volume={9},
  journal={Machine intelligence and pattern recognition},
  pages={149--158},
  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/13660">
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:creator>Spohn, Wolfgang</dc:creator>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/13660/1/Spohn.pdf"/>
    <dc:language>eng</dc:language>
    <dc:rights>terms-of-use</dc:rights>
    <dcterms:issued>1990</dcterms:issued>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/40"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/40"/>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-06-28T09:55:03Z</dcterms:available>
    <dcterms:bibliographicCitation>First publ. in: Machine intelligence and pattern recognition 9 (1990) ( = Uncertainty in Artificial Intelligence 4), pp. 149-158</dcterms:bibliographicCitation>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-06-28T09:55:03Z</dc:date>
    <dcterms:title>A general non-probabilistic theory of inductive reasoning</dcterms:title>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/13660"/>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/13660/1/Spohn.pdf"/>
    <dcterms:abstract xml:lang="eng">This is a useful condensed version of "Ordinal Conditional Functions. A Dynamic Theory of Epistemic States", additionally explaining that ranking functions cannot be subsumed under Dempster-Shafer belief functions.</dcterms:abstract>
    <dc:contributor>Spohn, Wolfgang</dc:contributor>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Nein