Sciweavers

1912 search results - page 347 / 383
» On the evaluation of argumentation formalisms
Sort
View
WWW
2003
ACM
16 years 14 days ago
SweetDeal: representing agent contracts with exceptions using XML rules, ontologies, and process descriptions
SweetDeal is a rule-based approach to representation of business contracts that enables software agents to create, evaluate, negotiate, and execute contracts with substantial auto...
Benjamin N. Grosof, Terrence C. Poon
ICFP
2009
ACM
16 years 14 days ago
Effective interactive proofs for higher-order imperative programs
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
Adam J. Chlipala, J. Gregory Malecha, Greg Morrise...
POPL
2009
ACM
16 years 13 days ago
Verifying distributed systems: the operational approach
This work develops an integrated approach to the verification of behaviourally rich programs, founded directly on operational semantics. The power of the approach is demonstrated ...
Tom Ridge
CCS
2009
ACM
16 years 12 days ago
The union-split algorithm and cluster-based anonymization of social networks
Knowledge discovery on social network data can uncover latent social trends and produce valuable findings that benefit the welfare of the general public. A growing amount of resea...
Brian Thompson, Danfeng Yao
KDD
2009
ACM
156views Data Mining» more  KDD 2009»
16 years 10 days ago
Multi-focal learning and its application to customer service support
In this study, we formalize a multi-focal learning problem, where training data are partitioned into several different focal groups and the prediction model will be learned within...
Yong Ge, Hui Xiong, Wenjun Zhou, Ramendra K. Sahoo...