Sciweavers

1933 search results - page 180 / 387
» A Dynamic Theory of Ontology
Sort
View
ISCI
1998
139views more  ISCI 1998»
13 years 9 months ago
A Rough Set Approach to Attribute Generalization in Data Mining
This paper presents a method for updating approximations of a concept incrementally. The results can be used to implement a quasi-incremental algorithm for learning classification...
Chien-Chung Chan
IAT
2009
IEEE
13 years 7 months ago
Strategic Ability Update: A Modal Logic Account
We study an update operator for Coalition Logic to talk about the way players' strategic ability changes because of the moves of their opponents. We show its connection with D...
Jan Broersen, Rosja Mastop, John-Jules Ch. Meyer, ...
ICFP
2006
ACM
14 years 9 months ago
Delimited dynamic binding
Dynamic binding and delimited control are useful together in many settings, including Web applications, database cursors, and mobile code. We examine this pair of language feature...
Oleg Kiselyov, Chung-chieh Shan, Amr Sabry
ICFP
2003
ACM
14 years 9 months ago
Dynamic rebinding for marshalling and update, with destruct-time?
Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various...
Gavin M. Bierman, Michael W. Hicks, Peter Sewell, ...
ATAL
2010
Springer
13 years 10 months ago
Alternating-time dynamic logic
We propose Alternating-time Dynamic Logic (ADL) as a multi-agent variant of Dynamic Logic in which atomic programs are replaced by coalitions. In ADL, the Dynamic Logic operators ...
Nicolas Troquard, Dirk Walther