-
This paper gives a survey of expressivity and complexity of normal
modal logics for reasoning about cooperation and preferences. We
identify a class of notions expressing local and global properties
rel- evant for reasoning about cooperative situations involving agents
that have preferences. Many...
-
The concepts of cooperation actions and preferences play central roles
in situations in which agents interact with each other. In many cases,
agents cooperate and act together as groups because as a group they
can achieve something better than they could individually. If we want
to make explicit...
-
In this paper we study the structure of the set SAT of
all satisfiable propositional logical formulas. In particular
we raise the question whether the distribution
of SAT within the set A of all propositional formulas
exhibits fractal behavior. This answer is of course
relative to a metric on A. ...
-
In this article we give an introduction to the idea and workings of
dynamic semantics. We start with an overview of its historical
background and motivation in this introductory section. An in-depth
description of a paradigm version of dynamic semantics, Dynamic
Predicate Logic, is given in sect...
-
We study the computational complexity of reciprocal sentences with
quantified antecedents. We observe a computational dichotomy between
different interpretations of reciprocity, and shed some light on the
status of the so-called Strong Meaning Hypothesis.
-
We propose axiomatizations of monadic second-order logic MSO, monadic
transitive closure logic (FO(TC^1)) and monadic least fixpoint logic
(FO(LFP^1)) on finite node-labeled sibling-ordered trees. We show by a
uniform argument, that our axiomatizations are complete, i.e., in each
of our logics, ...
-
In the line of some earlier work done on belief dynamics, we propose
an abstract model of belief propagation on a graph based on the
methodology of the revision theory of truth. A modal language is
developed for portraying the behavior of this model, and its
expressiveness is discussed. We compar...
-
Identification through Inductive Verification.
Application to Monotone Quantifiers
Nina Gierasimczuk
Abstract:
In this paper we are concerned with some general properties of
scientific hypotheses. We investigate the relationship between the
situation when the task is to verify a given hypothesis...
-
We model unawareness of possibilities in decision-making and
(linguistic) pragmatic reasoning. A background model is filtered
through a state of limited awareness to provide the epistemic state of
an agent who is not attending to all possibilities. We extend the
standard notion of awareness with ...
-
We look at two fundamental logical processes, often intertwined in
planning and problem solving: inference and update. Inference is an
internal process with which we uncover what is implicit in the
information we already have. Update, on the other hand, is produced by
external communication, usua...
-
We compare time needed for understanding different types of
quantifiers. In the first study, we show that the distinction between
quantifiers recognized by finite-automata and push-down automata is
psychologically relevant. In the second study, we compare
comprehension of push-down quantifiers in...