Sciweavers

564 search results - page 39 / 113
» Some Results on the Expressive Power and Complexity of LSCs
Sort
View
SEBD
2001
145views Database» more  SEBD 2001»
14 years 11 months ago
Reasoning over Conceptual Schemas and Queries in Temporal Databases
This paper introduces a new logical formalism, intended for temporal conceptual modelling, as a natural combination of the well-known description logic DLR and point-based linear ...
Alessandro Artale, Enrico Franconi, Milenko Mosuro...
MFCS
2005
Springer
15 years 3 months ago
Concurrent Automata vs. Asynchronous Systems
We compare the expressive power of two automata-based finite-state models of concurrency. We show that Droste’s and Kuske’s coherent stably concurrent automata and Bednarczyk...
Rémi Morin
CSL
2006
Springer
14 years 10 months ago
Automata and Logics for Words and Trees over an Infinite Alphabet
In a data word or a data tree each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been considered in the realm of sem...
Luc Segoufin
CORR
2010
Springer
145views Education» more  CORR 2010»
14 years 7 months ago
Dynamic Capitalization and Visualization Strategy in Collaborative Knowledge Management System for EI Process
Abstract--Knowledge is attributed to human whose problemsolving behavior is subjective and complex. In today's knowledge economy, the need to manage knowledge produced by a co...
Bolanle Oladejo, Victor Odumuyiwa, Amos David
ICDT
2007
ACM
97views Database» more  ICDT 2007»
15 years 4 months ago
Combining Temporal Logics for Querying XML Documents
Close relationships between XML navigation and temporal logics have been discovered recently, in particular between logics LTL and CTL⋆ and XPath navigation, and between the µ-c...
Marcelo Arenas, Pablo Barceló, Leonid Libki...