Sciweavers

11397 search results - page 6 / 2280
» A Relational Abstraction for Functions
Sort
View
CIE
2010
Springer
14 years 2 months ago
Computational Interpretations of Analysis via Products of Selection Functions
Abstract. We show that the computational interpretation of full comprehension via two wellknown functional interpretations (dialectica and modiļ¬ed realizability) corresponds to t...
Martín Hötzel Escardó, Paulo Ol...
JCP
2008
139views more  JCP 2008»
13 years 9 months ago
Agent Learning in Relational Domains based on Logical MDPs with Negation
In this paper, we propose a model named Logical Markov Decision Processes with Negation for Relational Reinforcement Learning for applying Reinforcement Learning algorithms on the ...
Song Zhiwei, Chen Xiaoping, Cong Shuang
IWPC
2000
IEEE
14 years 2 months ago
Evaluating the Accessor Classification Approach to Detect Abstract Data Types
ng the Accessor Classification Approach to Detect Abstract Data Types icle presents an approach to identify abstract data types (ADTs) in source code. For each structured type deļ...
Jean-Francois Girard, Martin Würthner
VR
2007
IEEE
122views Virtual Reality» more  VR 2007»
14 years 4 months ago
Flexible Abstraction Layers for VR Application Development
Abstraction Layers for VR Application Development Gerwin de Haanāˆ— Michal Koutekā€  Frits H. Postā€” Delft University of Technology, The Netherlands The development of domain-spe...
Gerwin de Haan, Michal Koutek, Frits H. Post
ICALP
2011
Springer
13 years 1 months ago
Probabilistic Bisimulation and Simulation Algorithms by Abstract Interpretation
act Interpretation SILVIA CRAFA FRANCESCO RANZATO University of Padova, Italy We show how bisimulation equivalence and simulation preorder on probabilistic LTSs (PLTSs), namely the...
Silvia Crafa, Francesco Ranzato