-
Coherence and Conservatism in the Dynamics of Belief
PartI: Finding the right framework
Hans Rott
In this paper I discuss the foundations of a formal theory of coherent and
conservative belief change that is (a) suitable to be used as a method for
constructing iterated changes of belief, (b)...
-
For every finite n>1, the embedding property fails in the class of
all n-dimensional cylindric type algebras which satisfy the
following. Their boolean reducts are boolean algebras and two of the
cylindrifications are normal, additive and commute.
This result also holds for all subclasses c...
-
Hybrid languages are extended modal languages which can refer to (or even
quantify over) worlds. The use of strong hybrid languages dates back to at
least \cite{prio:past67}, but recent work (for example \cite{blac:hybr98},
\cite{blac:hybr98a}) has focused on a more constrained system called
...
-
We present a basis for the admissible rules of intuitionistic propositional
logic. Thereby a conjecture by de Jongh and Visser is proved. We also
present a proof system for the admissible rules, and give semantic criteria
for admissibility. We use and connect all this with work on admissible
rul...
-
This article presents a formal reconstruction of James D. Thompson's
classic contribution to organization theory, Organizations in Action.
The reconstruction explicates the underlying argumentation structure
for Thompson's propositions--literally, theorems or problems to be
demonstrated. This...
-
In this paper it will be shown that the Beth definability property
corresponds to surjectiveness of epimorphisms in abstract algebraic
logic. This generalizes a result by I.~N\'emeti.
Moreover, an equally general characterization of the weak Beth property
will be given. This gives a solution to ...
-
In this paper we argue that a formal discourse- or dialogue-oriented theory
of interpretation does not presuppose a dynamic notion of meaning. For the
compositional interpretation of anaphorical or other rhetorical relations
in discourse, a richer notion of conjunction may be needed, but not a
dy...
-
The compositional interpretation of structures in discourse has raised the
question whether some level of representation is indispensable in the
analysis of the semantics of natural language. In this paper we formulate
and motivate three notions of representationalism (a strong, a medium or
midwe...
-
In this paper I present the EMILE 3.0 algorithm. It can learn shallow
context-free grammars efficiently. It does so under circumstances that,
from a perspective of complexity, come resonably close to the conditions
under which human beings learn a language. A language is shallow in its
descri...
-
We present a tableau calculus for reasoning in fragments of natural
language. We focus on the problem of pronoun resolution and the way
in which it complicates automated theorem proving for natural language
processing. A method for explicitly manipulating contextual information
during deducti...
-
We provide a resolution-based proof procedure for modal and description
logics that improves on previous proposals in a number of important ways.
First, it avoids translations into large undecidable logics, and works
directly on modal or description logic formulas instead. Second, by
using ...