Distance-based non-deterministic semantics for reasoning with uncertainty

Logic Journal of the IGPL 17 (4):325-350 (2009)
  Copy   BIBTEX

Abstract

Non-deterministic matrices, a natural generalization of many-valued matrices, are semantic structures in which the value assigned to a complex formula may be chosen non-deterministically from a given set of options. We show that by combining non-deterministic matrices and distance-based considerations, one obtains a family of logics that are useful for reasoning with uncertainty. These logics are a conservative extension of those that are obtained by standard distance-based semantics, and so usual distance-based methods are easily simulated within our framework. We investigate the basic properties of the distance-preferential non-deterministic logics, consider their application for reasoning with incomplete and inconsistent information, and show the correspondence between some particular entailments in our framework and well-known problems like max-SAT

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,150

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Belief Update Using Graphs.Konstantinos Georgatos - 2008 - In David Wilson & Chad H. Lane (eds.), FLAIRS 21. AAAI Press. pp. 649-654.
On Non-Deterministic Quantification.Thomas Macaulay Ferguson - 2014 - Logica Universalis 8 (2):165-191.
Contrary-to-duty obligations.Henry Prakken & Marek Sergot - 1996 - Studia Logica 57 (1):91 - 115.
New foundations for counterfactuals.Franz Huber - 2014 - Synthese 191 (10):2167-2193.

Analytics

Added to PP
2015-02-04

Downloads
7 (#1,389,841)

6 months
4 (#795,160)

Historical graph of downloads
How can I increase my downloads?