Sciweavers

1458 search results - page 94 / 292
» Extended Term Rewriting Systems
Sort
View
CSCLP
2008
Springer
14 years 11 months ago
From Rules to Constraint Programs with the Rules2CP Modelling Language
In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...
François Fages, Julien Martin
LDTA
2010
14 years 10 months ago
Faster ambiguity detection by grammar filtering
Real programming languages are often defined using ambiguous context-free grammars. Some ambiguity is intentional while other ambiguity is accidental. A good grammar development e...
H. J. S. Basten, Jurgen J. Vinju
CORR
2006
Springer
95views Education» more  CORR 2006»
14 years 10 months ago
SAT Solving for Argument Filterings
Abstract. This paper introduces a propositional encoding for lexicographic path orders in connection with dependency pairs. This facilitates the application of SAT solvers for term...
Michael Codish, Peter Schneider-Kamp, Vitaly Lagoo...
JACM
2007
85views more  JACM 2007»
14 years 9 months ago
The rational numbers as an abstract data type
onal Numbers as an Abstract Data Type1 J A Bergstra2 University of Amsterdam, Informatics Institute, Kruislaan 403, 1098 SJ Amsterdam, The Netherlands J V Tucker3 Department of Com...
Jan A. Bergstra, J. V. Tucker
GECCO
2009
Springer
174views Optimization» more  GECCO 2009»
14 years 7 months ago
Shape grammars and grammatical evolution for evolutionary design
We describe the first steps in the adoption of Shape Grammars with Grammatical Evolution for application in Evolutionary Design. Combining the concepts of Shape Grammars and Genet...
Michael O'Neill, John Mark Swafford, James McDermo...