Sciweavers

176 search results - page 18 / 36
» Scoping Constructs in Logic Programming: Implementation Prob...
Sort
View
POPL
2004
ACM
15 years 10 months ago
Incremental execution of transformation specifications
We aim to specify program transformations in a declarative style, and then to generate executable program transformers from such specifications. Many transformations require non-t...
Ganesh Sittampalam, Oege de Moor, Ken Friis Larsen
ATMOS
2007
177views Optimization» more  ATMOS 2007»
14 years 11 months ago
Approximate dynamic programming for rail operations
Abstract. Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled...
Warren B. Powell, Belgacem Bouzaïene-Ayari
DBPL
1993
Springer
104views Database» more  DBPL 1993»
15 years 1 months ago
Extensible Grammars for Language Specialization
A frequent dilemma in the design of a database programming language is the choice between a language with a rich set of tailored notations for schema definitions, query expression...
Luca Cardelli, Florian Matthes, Martín Abad...
ACSD
2004
IEEE
113views Hardware» more  ACSD 2004»
15 years 1 months ago
Logic Synthesis for Asynchronous Circuits Based on Petri Net Unfoldings and Incremental SAT
The behaviour of asynchronous circuits is often described by Signal Transition Graphs (STGs), which are Petri nets whose transitions are interpreted as rising and falling edges of...
Victor Khomenko, Maciej Koutny, Alexandre Yakovlev
EH
1999
IEEE
351views Hardware» more  EH 1999»
15 years 2 months ago
Evolvable Hardware or Learning Hardware? Induction of State Machines from Temporal Logic Constraints
Here we advocate an approach to learning hardware based on induction of finite state machines from temporal logic constraints. The method involves training on examples, constraint...
Marek A. Perkowski, Alan Mishchenko, Anatoli N. Ch...