Sciweavers

148 search results - page 9 / 30
» On the Complexity of Elementary Modal Logics
Sort
View
RELMICS
1998
Springer
15 years 3 months ago
Coping with semilattices of relations in logics with relative accessibility relations
We present a class of polymodal logics for which the set of terms indexing the modal connectives can be hierarchized in two levels: the set of Boolean terms and the set of terms b...
Stéphane Demri
TABLEAUX
2009
Springer
15 years 6 months ago
Terminating Tableaux for Graded Hybrid Logic with Global Modalities and Role Hierarchies
We present a terminating tableau calculus for graded hybrid logic with global modalities, reflexivity, transitivity and role hierarchies. Termination of the system is achieved thr...
Mark Kaminski, Sigurd Schneider, Gert Smolka
ADBIS
2005
Springer
124views Database» more  ADBIS 2005»
15 years 5 months ago
On Modal Deductive Databases
We present a query language called MDatalog, which is an extension of Datalog for multimodal deductive databases. We define modal relational algebras and give the seminaive evalua...
Linh Anh Nguyen
LICS
2007
IEEE
15 years 6 months ago
Alternation-free modal mu-calculus for data trees
d abstract) Marcin Jurdzi´nski and Ranko Lazi´c∗ Department of Computer Science, University of Warwick, UK An alternation-free modal µ-calculus over data trees is introduced ...
Marcin Jurdzinski, Ranko Lazic
IPPS
2006
IEEE
15 years 5 months ago
Elementary block based 2-dimensional dynamic and partial reconfiguration for Virtex-II FPGAs
The development of Field Programmable Gate Arrays (FPGAs) had tremendous improvements in the last few years. They were extended from simple logic circuits to complex Systems-on-Ch...
Michael Hübner, Christian Schuck, Jürgen...