Sciweavers

2067 search results - page 216 / 414
» Logics of propositional control
Sort
View
CC
2010
Springer
282views System Software» more  CC 2010»
15 years 4 months ago
Lower Bounds on the Randomized Communication Complexity of Read-Once Functions
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
Nikos Leonardos, Michael Saks
SEMWEB
2010
Springer
15 years 4 months ago
Evolution of DL - Lite Knowledge Bases
Abstract. We study the problem of evolution for Knowledge Bases (KBs) expressed in Description Logics (DLs) of the DL-Lite family. DL-Lite is at the basis of OWL 2 QL, one of the t...
Diego Calvanese, Evgeny Kharlamov, Werner Nutt, Dm...
JDCTA
2010
150views more  JDCTA 2010»
15 years 1 months ago
Proof as Composition: An approach for the Large-granularity Web Services Composition
The large-granularity Web services are a new form of Web services. In contrast to the traditional Web services, they often have more interfaces, encapsulate more complex business ...
Yuyu Yin, Ying Li, Jianwei Yin, ShuiGuang Deng
EEE
2005
IEEE
16 years 6 days ago
SLA Representation, Management and Enforcement
As the IT industry is becoming more and more interested in service oriented business models and upcoming technologies like Web Services or Grid Computing, the need for automated c...
Adrian Paschke, Martin Bichler
ICRA
1998
IEEE
141views Robotics» more  ICRA 1998»
15 years 10 months ago
On Discontinuous Human Control Strategies
Models of human control strategy (HCS), which accurately emulate dynamic human behavior, have far reaching potential in areas ranging from robotics to virtual reality to the intel...
Michael C. Nechyba, Yangsheng Xu