245 search results - page 16 / 49 » Class Algebra as a Description Logic |
115
Voted
CSL
2010
Springer
15 years 1 months ago
2010
Springer
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
116
click to vote
EWDW
1990
15 years 4 months ago
1990
The formal description of the semantics of object-oriented data models is still an open problem. Some characteristic features of object-oriented data models, such as methods and i...
LICS
1999
IEEE
15 years 4 months ago
1999
IEEE
An important open question in complexity theory is whether the circuit complexity class TC0 is (strictly) weaker than LOGSPACE. This paper considers this question from the viewpoi...
85
Voted
CORR
2008
Springer
15 years 17 days ago
2008
Springer
It has recently been discovered that both quantum and classical propositional logics can be modelled by classes of nonorthomodular and thus non-distributive lattices that properly...
122
click to vote
BIRTHDAY
2010
Springer
15 years 1 months ago
2010
Springer
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...