Belief Revision in Dynamic Epistemic Logic and Ranking Theory

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:496ccaf02456e0e8c2b1094607b57b7a

FRITZ, Peter, 2009. Belief Revision in Dynamic Epistemic Logic and Ranking Theory [Bachelor thesis]

@mastersthesis{Fritz2009Belie-3536, title={Belief Revision in Dynamic Epistemic Logic and Ranking Theory}, year={2009}, author={Fritz, Peter} }

<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/3536"> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/40"/> <dc:rights>deposit-license</dc:rights> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-23T13:46:40Z</dc:date> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/3536/1/Bachelorarbeit_Fritz.pdf"/> <dcterms:rights rdf:resource="https://creativecommons.org/licenses/by-sa/2.0/legalcode"/> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/3536"/> <dcterms:abstract xml:lang="eng">I want to look at recent developments of representing AGM-style belief revision in dynamic epistemic logics and the options for doing something similar for ranking theory. Formally, my aim will be modest: I will define a version of basic dynamic doxastic logic using ranking functions as the semantics. I will show why formalizing ranking theory this way is useful for the ranking theorist first by showing how it enables one to compare ranking theory more easily with other approaches to belief revision. I will then use the logic to state an argument for defining ranking functions on larger sets of ordinals than is customary. Secondly, I will argue that the only way to extend the account of belief revision given by ranking theory to higher-order beliefs and revisions is by continuing the approach taken by me and defining ranking theoretical equivalents of dynamic epistemic logics. For proponents of dynamic epistemic logic, such logics will naturally be of interest provided they are convinced of the revision operator defined by ranking theory.</dcterms:abstract> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/3536/1/Bachelorarbeit_Fritz.pdf"/> <dc:language>eng</dc:language> <dcterms:issued>2009</dcterms:issued> <dc:format>application/pdf</dc:format> <dc:contributor>Fritz, Peter</dc:contributor> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/40"/> <dc:creator>Fritz, Peter</dc:creator> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-23T13:46:40Z</dcterms:available> <dcterms:title>Belief Revision in Dynamic Epistemic Logic and Ranking Theory</dcterms:title> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

Bachelorarbeit_Fritz.pdf 114

Das Dokument erscheint in:

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

KOPS Suche


Stöbern

Mein Benutzerkonto