Sciweavers

529 search results - page 54 / 106
» Simple Random Logic Programs
Sort
View
PLANX
2007
13 years 11 months ago
XPath Typing Using a Modal Logic with Converse for Finite Trees
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
Pierre Genevès, Nabil Layaïda, Alan Sc...
ISAAC
2009
Springer
114views Algorithms» more  ISAAC 2009»
14 years 4 months ago
Good Programming in Transactional Memory
Abstract. In a multicore transactional memory (TM) system, concurrent execution threads interact and interfere with each other through shared memory. The less interference a progra...
Raphael Eidenbenz, Roger Wattenhofer
MEMBRANE
2004
Springer
14 years 3 months ago
LMNtal: A Language Model with Links and Membranes
LMNtal (pronounced “elemental”) is a simple language model based on graph rewriting that uses logical variables to represent links and membranes to represent hierarchies. The ...
Kazunori Ueda, Norio Kato
CSL
2003
Springer
14 years 3 months ago
Modular Semantics and Logics of Classes
The semantics of class-based languages can be defined in terms of objects only [8, 7, 1] if classes are viewed as objects with a constructor method. One obtains a store in which m...
Bernhard Reus
CDC
2010
IEEE
136views Control Systems» more  CDC 2010»
13 years 5 months ago
Pathologies of temporal difference methods in approximate dynamic programming
Approximate policy iteration methods based on temporal differences are popular in practice, and have been tested extensively, dating to the early nineties, but the associated conve...
Dimitri P. Bertsekas