Sciweavers

4622 search results - page 85 / 925
» Foundations of Information Theory
Sort
View
POPL
2003
ACM
15 years 10 months ago
Discovering affine equalities using random interpretation
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
Sumit Gulwani, George C. Necula
KCAP
2005
ACM
15 years 3 months ago
An ontological approach to the construction of problem-solving models
Our ongoing work aims at defining an ontology-centered approach for building expertise models for the CommonKADS methodology. This approach (which is named "OntoKADS") i...
Sabine Bruaux, Gilles Kassel, Gilles Morel
NIPS
1993
14 years 11 months ago
Convergence of Stochastic Iterative Dynamic Programming Algorithms
Recent developments in the area of reinforcement learning have yielded a number of new algorithms for the prediction and control of Markovian environments. These algorithms,includ...
Tommi Jaakkola, Michael I. Jordan, Satinder P. Sin...
ECAI
2010
Springer
14 years 11 months ago
ABA: Argumentation Based Agents
Abstract. Many works have identified the potential benefits of using argumentation to address a large variety of multiagent problems. In this paper we take this idea one step furth...
Antonis C. Kakas, Leila Amgoud, Gabriele Kern-Isbe...
EACL
2003
ACL Anthology
14 years 11 months ago
A Dynamic Logic Formalisation of the Dialogue Gameboard
This paper explores the possibility of using the paradigm of Dynamic Logic (DL) to formalise information states and update processes on information states. In particular, we prese...
Raquel Fernández