-
The essentially $\Sigma_1$ formulae of $\Sigma$L are exactly those
which are provably equivalent to a disjunction of conjunctions of
$\Box$ and $\Sigma_1$ formulae.
-
Modern logic is undergoing a cognitive turn, side-stepping Frege's
'anti-psychologism'. Collaborations between logicians and colleagues
in more empirical fields are growing, especially in research on
reasoning and information update by intelligent agents. We try to make
more of this common knowle...
-
Situation Calculus and Modal Logic sometimes seem 'worlds apart', but
appearances are deceptive. Taking Reiter's book "Knowledge in Action"
as our running reference, we show how the two research agendas are
closely related. Circumscription and varieties of non-monotonic logic
can be seen as vari...
-
Choosing a semantics validates certain axioms. But as the
19th century German geometrist Jakobi said already: "One
Should Always Convert'. Modal correspondences are a way
of stepping back from statements of validity, and asking
the converse question 'what sort of models would make the
given a...
-
Substructural logics describe varieties of inference that humans can
engage in within specific settings. One such setting are dynamic
state transitions when processing information. We recall the complete
set of (non-monotonic, non-commutative, non-contractive) structural
rules for dynamic 'updat...
-
This is a slightly updated version of an earlier survey of logic games
for model checking, model construction, model comparison, and other
tasks. We discuss their general structural properties, and their
connections with current game logics for analyzing the structure of
games in general.
-
Many logical systems today describe behaviour of intelligent
interacting agents over time. Frameworks include Interpreted Systems
(IS, Fagin et al.), Epistemic-Temporal Logic (ETL, Parikh &
Ramanujam), STIT (Belnap et al.), Process Algebra and Game Semantics
(Abramsky). This proliferation is an ...
-
This paper presents a new modal logic for ceteris paribus prefer-
ences understood in the sense of "all other things being equal". This
reading goes back to the seminal work of Von Wright in the early 60's,
and it returned in computer science in the 90's and in 'dependency
logics' today. We show ...
-
This is an extended version of "On What One May Come to Know"
(Aanalysis 2004) explaining in more detail how dynamic epistemic logic
provides a new take on philosophical puzzles concerning learnability
of current truths and verificationism. The paper will be a chapter in
the forthcoming collectio...
-
We present a fully connectionist system for the learning of
first-order logic programs and the generation of corresponding models:
Given a program and a set of training examples, we embed the
associated semantic operator into a feed-forward network and train the
network using the examples. This ...
-
We propose an abstract approach to coalition formation by focusing on
partial preference relations between partitions of a grand
coalition. Coalition formation is modelled by means of simple merge
and split rules that transform partitions. We identify conditions
under which every iteration of the...