Sciweavers

108 search results - page 8 / 22
» Finite Model Reasoning in DL-Lite
Sort
View
ICALP
1998
Springer
14 years 1 months ago
Deciding Bisimulation-Like Equivalences with Finite-State Processes
We show that characteristic formulae for nite-state systems up to bisimulationlike equivalences (e.g., strong and weak bisimilarity) can be given in the simple branching-time temp...
Petr Jancar, Antonín Kucera, Richard Mayr
TCOM
2010
109views more  TCOM 2010»
13 years 8 months ago
Results on Finite Wireless Networks on a Line
Abstract— Today, due to the vast amount of literature on largescale wireless networks, we have a fair understanding of the asymptotic behavior of such networks. However, in real ...
Ali Eslami, Mohammad Nekoui, Hossein Pishro-Nik
DAM
2008
125views more  DAM 2008»
13 years 9 months ago
Heyting algebras with Boolean operators for rough sets and information retrieval applications
This paper presents an algebraic formalism for reasoning on finite increasing sequences over Boolean algebras in general and on generalizations of Rough Set concepts in particular...
Eric SanJuan
ACTAC
2006
94views more  ACTAC 2006»
13 years 9 months ago
MedEdit: A Computer Assisted Image Processing and Navigation System for Orthopedic Trauma Surgery
The surgery of fractured bones is often a very complex problem. That is the reason why it would be beneficial to create a geometric and mechanic model of the bones before surgical...
Krisztián Ollé, Balázs Erd&ou...
CSL
2009
Springer
14 years 1 months ago
Fixed-Point Definability and Polynomial Time
My talk will be a survey of recent results about the quest for a logic capturing polynomial time. In a fundamental study of database query languages, Chandra and Harel [4] first ra...
Martin Grohe