A general non-probabilistic theory of inductive reasoning

Spohn, Wolfgang

doi:10.1016/B978-0-444-88650-7.50017-2

Startseite
→
Philosophie
→
Philosophie
→
Dokumentanzeige

A general non-probabilistic theory of inductive reasoning

Publikationstyp:	Zeitschriftenartikel
URI (zitierfähiger Link):	http://nbn-resolving.de/urn:nbn:de:bsz:352-136602
Autor/innen:	Spohn, Wolfgang
Erscheinungsjahr:	1990
Erschienen in:	Machine intelligence and pattern recognition ; 9 (1990), Uncertainty in Artificial Intelligence 4. - S. 149-158
DOI (zitierfähiger Link):	https://dx.doi.org/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
Link zur Lizenz:	Deposit-Lizenz

Zitieren

Dateien zu dieser Ressource

Name: Spohn.pdf

Größe: 1.365Mb

Format: PDF

Öffnen

Prüfsumme: MD5:92099c7330e54de1d6288dfaee2bf47c

SPOHN, Wolfgang, 1990. A general non-probabilistic theory of inductive reasoning. In: Machine intelligence and pattern recognition. 9(Uncertainty in Artificial Intelligence 4), pp. 149-158

@article{Spohn1990gener-13660, title={A general non-probabilistic theory of inductive reasoning}, year={1990}, doi={10.1016/B978-0-444-88650-7.50017-2}, number={Uncertainty in Artificial Intelligence 4}, volume={9}, journal={Machine intelligence and pattern recognition}, pages={149--158}, author={Spohn, Wolfgang} }

<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/13660"> <dcterms:rights rdf:resource="http://nbn-resolving.org/urn:nbn:de:bsz:352-20140905103605204-4002607-1"/> <dcterms:bibliographicCitation>First publ. in: Machine intelligence and pattern recognition 9 (1990) ( = Uncertainty in Artificial Intelligence 4), pp. 149-158</dcterms:bibliographicCitation> <dc:rights>deposit-license</dc:rights> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-06-28T09:55:03Z</dcterms:available> <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"/> <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> <dcterms:issued>1990</dcterms:issued> <dc:contributor>Spohn, Wolfgang</dc:contributor> <dc:creator>Spohn, Wolfgang</dc:creator> <dc:language>eng</dc:language> </rdf:Description> </rdf:RDF>