Sciweavers

3323 search results - page 150 / 665
» Computational Semantics with Functional Programming
Sort
View
ICLP
1994
Springer
15 years 10 months ago
Splitting a Logic Program
In many cases, a logic program can be divided into two parts, so that one of them, the \bottom" part, does not refer to the predicates de ned in the \top" part. The \bot...
Vladimir Lifschitz, Hudson Turner
HYBRID
2010
Springer
16 years 29 days ago
From synchronous programs to symbolic representations of hybrid systems
In this paper, we present an extension of the synchronous language Quartz by new kinds of variables, actions and statements for modeling the interaction of synchronous systems wit...
Kerstin Bauer, Klaus Schneider
EUROGP
1998
Springer
15 years 10 months ago
Immediate Transfer of Global Improvements to All Individuals in a Population Compared to Automatically Defined Functions for the
Koza has shown how automatically defined functions (ADFs) can reduce computational effort in the GP paradigm. In Koza's ADF, as well as in standard GP, an improvement in a par...
Ricardo Aler
190
Voted
LPNMR
1997
Springer
15 years 10 months ago
Computing Non-Ground Representations of Stable Models
Turi [20] introduced the important notion of a constrained atom: an atom with associated equality and disequality constraints on its arguments. A set of constrained atoms is a cons...
Thomas Eiter, James J. Lu, V. S. Subrahmanian
166
Voted
EMSOFT
2004
Springer
15 years 11 months ago
Towards a higher-order synchronous data-flow language
The paper introduces a higher-order synchronous data-flow language in which communication channels may themselves transport programs. This provides a mean to dynamically reconfi...
Jean-Louis Colaço, Alain Girault, Gré...