-
We show that propositional dynamic logic and the modal $\mu$-calculus
are closed under product modalities, as defined in current
dynamic-epistemic logics. Our analysis clarifies the latter systems,
while also raising some new questions about fixed-point logics.
-
Abstract. Jacob Lorhard published his ontology in 1606. In this work
the term ontologia 'ontology' was used for the first time ever. In
this paper, it is argued that Lorhard's ontology provides a useful key
to the understanding of the early 17th-century world view in
Protestant Europe. Among othe...
-
This paper deals with the problem of derivational redundancy in
scientific explanation, i.e. the problem that there can be extremely
many different explanatory derivations for a natural phenomenon while
students and experts mostly come up with one and the same derivation
for a phenomenon (modulo ...
-
How far can we get with unsupervised parsing if we make our training
corpus several orders of magnitude larger than has hitherto be
attempted? We present a new algorithm for unsupervised parsing using
an all-subtrees model, termed U-DOP*, which parses directly with
packed forests of all binary tr...
-
We present a new model of language learning which is based on the
following idea: if a language learner does not know which
phrase-structure trees should be assigned to initial sentences, s/he
allows (implicitly) for all possible trees and lets linguistic
experience decide which is the 'best' tre...
-
A corpus-based parsing approach that has been quite successful in
various fields of AI, is known as Data-Oriented Parsing or DOP. DOP
was originally developed as an NLP technique but has been generalized
to music analysis, problem-solving and unsupervised structure
learning. The distinctive featu...
-
We extend the traditional Gale-Stewart algorithm (backward induction)
for the combinatorial graph game to an asymmetric variant; the
extension makes the algorithm non-monotonic, but a linear-time
formulation is still possible.
-
In this paper I introduce an inquisitive semantics for a language of
propositional logic, where the interpretation of disjunction is the
source of inquisitiveness. Indicative conditionals and conditional
questions are treated on a par both syntactically and
semantically. The semantics comes with ...
-
We take a fresh look at the logics of informational dependence and
independence of Hintikka and Sandu and Vaananen, and their
compositional semantics due to Hodges. We show how Hodges' semantics
can be seen as a special case of a general construction, which
provides a context for a useful complet...
-
Logic-based preference representation languages are promising
for expressing preferences over combinatorial domains.
Sets of weighted formulas, called goalbases, can be used to
define several such languages. How goalbases are translated
into utility functions---that is, by what aggregation functi...
-
There are two reasons why medieval logic is of interest to modern
logician: One is to see how similar it is to modern logic and the
other is to see how different it is. We study three 13th-century works
on modal logic and give two examples their views of modal logic differ
from modern views of th...