Sciweavers

571 search results - page 85 / 115
» Domain Theory in Logical Form
Sort
View
POPL
2007
ACM
15 years 10 months ago
Lightweight fusion by fixed point promotion
This paper proposes a lightweight fusion method for general recursive function definitions. Compared with existing proposals, our method has several significant practical features...
Atsushi Ohori, Isao Sasano
ATAL
2009
Springer
15 years 4 months ago
Like an intuitive and courteous butler: a proactive personal agent for task management
The ability to proactively offer assistance promises to make personal agents more helpful to their users. We characterize the properties desired of proactive behaviour by a person...
Neil Yorke-Smith, Shahin Saadati, Karen L. Myers, ...
ACOM
2006
Springer
15 years 3 months ago
Flexible Conversations Using Social Commitments and a Performatives Hierarchy
In this research, we re-arrange FIPA’s ACL performatives to form a subsumption lattice (ontology) and apply a theory of social commitments to achieve a simplified and observable...
Robert C. Kremer, Roberto A. Flores
COMPUTING
2006
100views more  COMPUTING 2006»
14 years 9 months ago
Interval Arithmetic with Containment Sets
The idea of containment sets (csets) is due to Walster and Hansen, and the theory is mainly due to the first author. Now that floating point computation with infinities is widely a...
John D. Pryce, George F. Corliss
DASFAA
2008
IEEE
137views Database» more  DASFAA 2008»
14 years 11 months ago
Efficient Mining of Recurrent Rules from a Sequence Database
We study a novel problem of mining significant recurrent rules from a sequence database. Recurrent rules have the form "whenever a series of precedent events occurs, eventuall...
David Lo, Siau-Cheng Khoo, Chao Liu 0001