52,466 research outputs found
Evolving Objects in Temporal Information Systems
This paper presents a semantic foundation of temporal conceptual models used to design temporal information systems. We consider a modelling language able to express both timestamping and evolution constraints. We conduct a deeper investigation of evolution constraints, eventually devising a model-theoretic semantics for a full-fledged model with both timestamping and evolution constraints. The proposed formalization is meant both to clarify the meaning of the various temporal constructors that appeared in the literature and to give a rigorous definition, in the context of temporal information systems, to notions like satisfiability, subsumption and logical implication. Furthermore, we show how to express temporal constraints using a subset of first-order temporal logic, i.e. DLRUS, the description logic DLR extended with the temporal operators Since and Until. We show how DLRUS is able to capture the various modelling constraints in a succinct way and to perform automated reasoning on temporal conceptual models
Kauffman's adjacent possible in word order evolution
Word order evolution has been hypothesized to be constrained by a word order
permutation ring: transitions involving orders that are closer in the
permutation ring are more likely. The hypothesis can be seen as a particular
case of Kauffman's adjacent possible in word order evolution. Here we consider
the problem of the association of the six possible orders of S, V and O to
yield a couple of primary alternating orders as a window to word order
evolution. We evaluate the suitability of various competing hypotheses to
predict one member of the couple from the other with the help of information
theoretic model selection. Our ensemble of models includes a six-way model that
is based on the word order permutation ring (Kauffman's adjacent possible) and
another model based on the dual two-way of standard typology, that reduces word
order to basic orders preferences (e.g., a preference for SV over VS and
another for SO over OS). Our analysis indicates that the permutation ring
yields the best model when favoring parsimony strongly, providing support for
Kauffman's general view and a six-way typology.Comment: Minor corrections (small errors concerning the parameters of model 1,
language, style,...) except for the mathematical arguments at the end of
section "Further details about Model 2" of the supplementar
The placement of the head that maximizes predictability. An information theoretic approach
The minimization of the length of syntactic dependencies is a
well-established principle of word order and the basis of a mathematical theory
of word order. Here we complete that theory from the perspective of information
theory, adding a competing word order principle: the maximization of
predictability of a target element. These two principles are in conflict: to
maximize the predictability of the head, the head should appear last, which
maximizes the costs with respect to dependency length minimization. The
implications of such a broad theoretical framework to understand the
optimality, diversity and evolution of the six possible orderings of subject,
object and verb are reviewed.Comment: in press in Glottometric
Computation in Finitary Stochastic and Quantum Processes
We introduce stochastic and quantum finite-state transducers as
computation-theoretic models of classical stochastic and quantum finitary
processes. Formal process languages, representing the distribution over a
process's behaviors, are recognized and generated by suitable specializations.
We characterize and compare deterministic and nondeterministic versions,
summarizing their relative computational power in a hierarchy of finitary
process languages. Quantum finite-state transducers and generators are a first
step toward a computation-theoretic analysis of individual, repeatedly measured
quantum dynamical systems. They are explored via several physical systems,
including an iterated beam splitter, an atom in a magnetic field, and atoms in
an ion trap--a special case of which implements the Deutsch quantum algorithm.
We show that these systems' behaviors, and so their information processing
capacity, depends sensitively on the measurement protocol.Comment: 25 pages, 16 figures, 1 table; http://cse.ucdavis.edu/~cmg; numerous
corrections and update
Renewing the link between cognitive archeology and cognitive science
In cognitive archeology, theories of cognition are used to guide interpretation of archeological evidence. This process provides useful feedback on the theories themselves. The attempt to accommodate archeological data helps shape ideas about how human cognition has evolved and thus—by extension—how the modern form functions. But the implications that archeology has for cognitive science particularly relate to traditional proposals from the field involving modular decomposition, symbolic thought and the mediating role of language. There is a need to make a connection with more recent approaches, which more strongly emphasize information, probabilistic reasoning and exploitation of embodiment. Proposals from cognitive archeology, in which evolution of cognition is seen to involve a transition to symbolic thought need to be realigned with theories from cognitive science that no longer give symbolic reasoning a central role. The present paper develops an informational approach, in which the transition is understood to involve cumulative development of information-rich generalizations
- …