2226 search results - page 402 / 446 » Pdk: The System and Its Language |
LICS
1997
IEEE
15 years 4 months ago
1997
IEEE
Abstract. We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the emptiness problem for the intersection of recognizab...
131
click to vote
ATAL
1997
Springer
15 years 4 months ago
1997
Springer
Abstract. Just as cooperation in multi-agent systems is a central issue for solving complex tasks, so too is the ability for an intelligent agent to reason about combined knowledge...
105
click to vote
VLDB
1992
ACM
15 years 3 months ago
1992
ACM
Research in temporal databases has mainly focused on defining temporal data models by extending existing models, and developing access structures for temporal data. Little has bee...
105
click to vote
DEBS
2010
ACM
15 years 3 months ago
2010
ACM
Complex event processing for pervasive computing must deal with various sources of error. In this paper, we focus on improving complex event detector handling of several types of ...
ATAL
2006
Springer
15 years 3 months ago
2006
Springer
A strength of commitment protocols is that they enable agents to act flexibly, thereby enabling them to accommodate varying local policies and respond to exceptions. A consequent ...