Sciweavers

3775 search results - page 182 / 755
» The Expression Problem Revisited
Sort
View
GECCO
2004
Springer
105views Optimization» more  GECCO 2004»
15 years 12 months ago
Softening the Structural Difficulty in Genetic Programming with TAG-Based Representation and Insertion/Deletion Operators
In a series of papers [3-8], Daida et. al. highlighted the difficulties posed to Genetic Programming (GP) by the complexity of the structural search space, and attributed the probl...
Nguyen Xuan Hoai, Robert I. McKay
ICMT
2010
Springer
15 years 11 months ago
Synthesis of OCL Pre-conditions for Graph Transformation Rules
Graph transformation (GT) is being increasingly used in Model Driven Engineering (MDE) to describe in-place transformations like animations and refactorings. For its practical use,...
Jordi Cabot, Robert Clarisó, Esther Guerra,...
DEXAW
2009
IEEE
114views Database» more  DEXAW 2009»
15 years 10 months ago
A Meta-Framework for Generating Ontologies from Legacy Schemas
A huge amount of schemas are expressed within outdated schema languages which are restricted concerning expressiveness, extensibility, readability, and understandability. Consequen...
Manuel Wimmer
ICLP
2010
Springer
15 years 10 months ago
Communicating Answer Set Programs
Answer set programming is a form of declarative programming that has proven very successful in succinctly formulating and solving complex problems. Although mechanisms for represen...
Kim Bauters, Jeroen Janssen, Steven Schockaert, Di...
DALT
2009
Springer
15 years 10 months ago
Computing Utility from Weighted Description Logic Preference Formulas
We propose a framework to compute the utility of a proposal w.r.t. a preference set in a negotiation process. In particular, we refer to preferences expressed as weighted formulas ...
Azzurra Ragone, Tommaso Di Noia, Francesco M. Doni...