Sciweavers

1805 search results - page 249 / 361
» A Theory of Closure Operators
Sort
View
TLDI
2010
ACM
247views Formal Methods» more  TLDI 2010»
16 years 1 months ago
F-ing modules
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfortunately, they also have a reputation for being “complex” and requiring fa...
Andreas Rossberg, Claudio V. Russo, Derek Dreyer
ATAL
2008
Springer
15 years 6 months ago
Modelling coalitions: ATL + argumentation
In the last few years, argumentation frameworks have been successfully applied to multi agent systems. Recently, argumentation has been used to provide a framework for reasoning a...
Nils Bulling, Jürgen Dix, Carlos Iván ...
CI
2005
106views more  CI 2005»
15 years 4 months ago
Incremental Learning of Procedural Planning Knowledge in Challenging Environments
Autonomous agents that learn about their environment can be divided into two broad classes. One class of existing learners, reinforcement learners, typically employ weak learning ...
Douglas J. Pearson, John E. Laird
CORR
2004
Springer
120views Education» more  CORR 2004»
15 years 4 months ago
Validating a Web Service Security Abstraction by Typing
Abstraction by Typing Andrew D. Gordon Microsoft Research Riccardo Pucella Cornell University An XML web service is, to a first approximation, an RPC service in which requests and...
Andrew D. Gordon, Riccardo Pucella
ICFP
2003
ACM
16 years 4 months ago
A static type system for JVM access control
This paper presents a static type system for JAVA Virtual Machine (JVM) code that enforces an access control mechanism similar to the one found, for example, in a JAVA implementat...
Tomoyuki Higuchi, Atsushi Ohori