Sciweavers

2035 search results - page 61 / 407
» On the complexity of stratified logics
Sort
View
ADBIS
2004
Springer
367views Database» more  ADBIS 2004»
15 years 11 months ago
Logical Design of Generalizations in Object-relational Databases
The richer data models of object relational databases opens many more options for the logical design of a database schema increasing the complexity of logical database design enorm...
Johann Eder, Simone Kanzian
CORR
2006
Springer
130views Education» more  CORR 2006»
15 years 6 months ago
Characterizing the NP-PSPACE Gap in the Satisfiability Problem for Modal Logic
There has been a great deal of work on characterizing the complexity of the satisfiability and validity problem for modal logics. In particular, Ladner showed that the consistency...
Joseph Y. Halpern, Leandro Chaves Rêgo
SLOGICA
2008
99views more  SLOGICA 2008»
15 years 4 months ago
Decidable Cases of First-order Temporal Logic with Functions
We consider the decision problem for cases of first-order temporal logic with function symbols and without equality. The monadic monodic fragment with flexible functions can be dec...
Walter Hussak
DLOG
2001
15 years 7 months ago
On Expressive Number Restrictions in Description Logics
We consider expressive Description Logics (ALCN) allowing for number restrictions on complex roles built with combinations of role constructors. In particular, we are mainly inter...
Fabio Grandi
ICCAD
1997
IEEE
127views Hardware» more  ICCAD 1997»
15 years 10 months ago
OPTIMIST: state minimization for optimal 2-level logic implementation
We present a novel method for state minimization of incompletely-specified finite state machines. Where classic methods simply minimize the number of states, ours directly addre...
Robert M. Fuhrer, Steven M. Nowick