1168 search results - page 178 / 234 » cases 2000 |
STACS
2000
Springer
15 years 1 months ago
2000
Springer
Motivated by description logics, we investigate what happens to the complexity of modal satisfiability problems if we only allow formulas built from literals, , 3, and 2. Previous...
COMPGEOM
1995
ACM
15 years 1 months ago
1995
ACM
The range searching problem is a fundamental problem in computational geometry, with numerous important applications. Most research has focused on solving this problem exactly, bu...
121
click to vote
TACAS
2000
Springer
15 years 1 months ago
2000
Springer
Salsa is an invariant checker for speci cations in SAL the SCR Abstract Language. To establish a formula as an invariant without any user guidance Salsa carries out an induction pr...
VECPAR
2000
Springer
15 years 1 months ago
2000
Springer
The SCOOPP (Scalable Object Oriented Parallel Programming) system is an hybrid compile and run-time system. SCOOPP dynamically scales OO applications on a wide range of target plat...
ZUM
2000
Springer
15 years 1 months ago
2000
Springer
: Retrenchment is introduced as a liberalisation of refinement intended to address some of the shortcomings of refinement as sole means of progressing from simple abstract models t...