Results 201 to 210 of about 74,609 (244)
Some of the next articles are maybe not open access.

Peirce’s Contributions to Possible-Worlds Semantics

Studia Logica, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ahti-Veikko Pietarinen
exaly   +2 more sources

Possible-Worlds Semantics

Synthese Library
Volker Halbach, Graham E Leigh
exaly   +5 more sources

POSSIBLE WORLDS SEMANTICS FOR DEFAULT LOGICS

Fundamenta Informaticae, 1994
We introduce a uniform semantical framework for various default logics in terms of Kripke structures. This possible worlds approach provides a simple but meaningful instrument for comparing existing default logics in a unified setting. The possible worlds semantics is introduced by means of constrained default logic. Also, it easily deals with Brewka's
Philippe Besnard, Torsten Schaub
openaire   +2 more sources

Agnostic Possible Worlds Semantics

2012
Working within standard classical higher-order logic, we propose a possible worlds semantics (PWS) which combines the simplicity of the familiar Montague semantics (MS), in which propositions are sets of worlds, with the fine-grainedness of the older but less well-known tractarian semantics (TS) of Wittgenstein and C.I.
Andrew R. Plummer, Carl Pollard
openaire   +1 more source

A possible world semantics for disjunctive databases

IEEE Transactions on Knowledge and Data Engineering, 1993
The fundamental problem that arises when a ground atom in a disjunctive database is assumed false is discussed. There are basically two different approaches for inferring negative information for disjunctive databases: J. Minker's (1982) generalized closed world assumption (GCWA) and K.A. Ross and R.W. Topor's (1988) disjunctive database rule (DDR). It
openaire   +1 more source

A Possible World Semantics for Updates by Versioning

1993
Recently a rule-language for updating objects based on versioning has been proposed [1]. The units for update are base properties of the objects Updates are defined by rules; several rules may be used to a specific update. Rules are evaluated in a bottom-up way according to a certain stratification.
Georg Lausen, Gunter Saake
openaire   +1 more source

Possible world semantics and autoepistemic reasoning

Artificial Intelligence, 1994
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Modal semantics without possible worlds

Journal of Symbolic Logic, 1981
In this paper I will develop a semantic account for modal logic by considering only the values of sentences (and formulas). This account makes no use of possible worlds. To develop such an account, we must recognize four values. These are obtained by subdividing (plain) truth into necessary truth (T) and contingent truth (t); and by subdividing falsity
openaire   +2 more sources

Home - About - Disclaimer - Privacy