Sciweavers

972 search results - page 182 / 195
» Reasoning with Conditional Time-Intervals
Sort
View
FLAIRS
2007
13 years 10 months ago
Handling Qualitative Preferences Using Normal Form Functions
Reasoning about preferences is a major issue in many decision making problems. Recently, a new logic for handling preferences, called Qualitative Choice Logic (QCL), was presented...
Salem Benferhat, Daniel Le Berre, Karima Sedki
ASM
2008
ASM
13 years 9 months ago
A First Attempt to Express KAOS Refinement Patterns with Event B
anguage (Event B), hence staying at the same abstraction level. Thus we take advantage from the Event B method: (i) it is possible to use the method during the whole development pr...
Abderrahman Matoussi, Frédéric Gerva...
ATAL
2008
Springer
13 years 9 months ago
Goal generation with relevant and trusted beliefs
A rational agent adopts (or changes) its goals when new information (beliefs) becomes available or its desires (e.g., tasks it is supposed to carry out) change. In conventional ap...
Célia da Costa Pereira, Andrea Tettamanzi
MPC
2010
Springer
246views Mathematics» more  MPC 2010»
13 years 9 months ago
Abstraction of Object Graphs in Program Verification
ion of Object Graphs in Program Verification Yifeng Chen1 and J.W. Sanders2 1 HCST Key Lab at School of EECS, Peking University, China. 2 UNU-IIST, Macao. A set-theoretic formalism...
Yifeng Chen, Jeff W. Sanders
SDM
2008
SIAM
147views Data Mining» more  SDM 2008»
13 years 9 months ago
The Asymmetric Approximate Anytime Join: A New Primitive with Applications to Data Mining
It has long been noted that many data mining algorithms can be built on top of join algorithms. This has lead to a wealth of recent work on efficiently supporting such joins with ...
Lexiang Ye, Xiaoyue Wang, Dragomir Yankov, Eamonn ...