70,684 research outputs found
Temporal Data Modeling and Reasoning for Information Systems
Temporal knowledge representation and reasoning is a major research field in Artificial
Intelligence, in Database Systems, and in Web and Semantic Web research. The ability to
model and process time and calendar data is essential for many applications like appointment
scheduling, planning, Web services, temporal and active database systems, adaptive
Web applications, and mobile computing applications. This article aims at three complementary
goals. First, to provide with a general background in temporal data modeling
and reasoning approaches. Second, to serve as an orientation guide for further specific
reading. Third, to point to new application fields and research perspectives on temporal
knowledge representation and reasoning in the Web and Semantic Web
Tameness in generalized metric structures
We broaden the framework of metric abstract elementary classes (mAECs) in
several essential ways, chiefly by allowing the metric to take values in a
well-behaved quantale. As a proof of concept we show that the result of Boney
and Zambrano on (metric) tameness under a large cardinal assumption holds in
this more general context. We briefly consider a further generalization to
partial metric spaces, and hint at connections to classes of fuzzy structures,
and structures on sheaves
Dual Logic Concepts based on Mathematical Morphology in Stratified Institutions: Applications to Spatial Reasoning
Several logical operators are defined as dual pairs, in different types of
logics. Such dual pairs of operators also occur in other algebraic theories,
such as mathematical morphology. Based on this observation, this paper proposes
to define, at the abstract level of institutions, a pair of abstract dual and
logical operators as morphological erosion and dilation. Standard quantifiers
and modalities are then derived from these two abstract logical operators.
These operators are studied both on sets of states and sets of models. To cope
with the lack of explicit set of states in institutions, the proposed abstract
logical dual operators are defined in an extension of institutions, the
stratified institutions, which take into account the notion of open sentences,
the satisfaction of which is parametrized by sets of states. A hint on the
potential interest of the proposed framework for spatial reasoning is also
provided.Comment: 36 page
Understanding Predication in Conceptual Spaces
We argue that a cognitive semantics has to take into account the possibly
partial information that a cognitive agent has of the world. After discussing
GƤrdenfors's view of objects in conceptual spaces, we offer a number of viable
treatments of partiality of information and we formalize them by means of alternative
predicative logics. Our analysis shows that understanding the nature of simple
predicative sentences is crucial for a cognitive semantics
Comparing theories: the dynamics of changing vocabulary. A case-study in relativity theory
There are several first-order logic (FOL) axiomatizations of special
relativity theory in the literature, all looking essentially different but
claiming to axiomatize the same physical theory. In this paper, we elaborate a
comparison, in the framework of mathematical logic, between these FOL theories
for special relativity. For this comparison, we use a version of mathematical
definability theory in which new entities can also be defined besides new
relations over already available entities. In particular, we build an
interpretation of the reference-frame oriented theory SpecRel into the
observationally oriented Signalling theory of James Ax. This interpretation
provides SpecRel with an operational/experimental semantics. Then we make
precise, "quantitative" comparisons between these two theories via using the
notion of definitional equivalence. This is an application of logic to the
philosophy of science and physics in the spirit of Johan van Benthem's work.Comment: 27 pages, 8 figures. To appear in Springer Book series Trends in
Logi
Expressive Logics for Coinductive Predicates
The classical Hennessy-Milner theorem says that two states of an image-finite transition system are bisimilar if and only if they satisfy the same formulas in a certain modal logic. In this paper we study this type of result in a general context, moving from transition systems to coalgebras and from bisimilarity to coinductive predicates. We formulate when a logic fully characterises a coinductive predicate on coalgebras, by providing suitable notions of adequacy and expressivity, and give sufficient conditions on the semantics. The approach is illustrated with logics characterising similarity, divergence and a behavioural metric on automata
- ā¦