Sciweavers

3441 search results - page 384 / 689
» Parallel Logic Programming Systems
Sort
View
CORR
2010
Springer
127views Education» more  CORR 2010»
14 years 11 months ago
Complexity of Data Dependence problems for Program Schemas with Concurrency
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
Sebastian Danicic, Robert M. Hierons, Michael R. L...
FLOPS
2008
Springer
15 years 6 months ago
A Generalization of the Folding Rule for the Clark-Kunen Semantics
Abstract. In this paper, we propose more flexible applicability conditions for the folding rule that increase the power of existing unfold/fold systems for normal logic programs. O...
Javier Álvez, Paqui Lucio
CORR
2008
Springer
103views Education» more  CORR 2008»
15 years 4 months ago
Flatness of the Energy Landscape for Horn Clauses
Abstract The Little-Hopfield neural network programmed with Horn clauses is studied. We argue that the energy landscape of the system, corresponding to the inconsistency function f...
Saratha Sathasivam, Wan Ahmad Tajuddin Wan Abdulla...
ATMOS
2007
177views Optimization» more  ATMOS 2007»
15 years 6 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
PPDP
2007
Springer
15 years 10 months ago
Higher-order semantic labelling for inductive datatype systems
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
Makoto Hamana