Sciweavers

1882 search results - page 177 / 377
» Transformational Programming and Forests
Sort
View
ADBIS
1995
Springer
130views Database» more  ADBIS 1995»
15 years 8 months ago
Magic Sets vs. SLD-Resolution
It is by now folklore that the bottom-up evaluation of a program after the “magic set” transformation is “as efficient as” top-down evaluation. There are a number of forma...
Stefan Brass
ECAI
2010
Springer
15 years 6 months ago
Nested Monte-Carlo Expression Discovery
Nested Monte-Carlo search is a general algorithm that gives good results in single player games. Genetic Programming evaluates and combines trees to discover expressions that maxim...
Tristan Cazenave
ENTCS
2007
86views more  ENTCS 2007»
15 years 5 months ago
Tool Support for Proof Engineering
Modern integrated development environments (IDEs) provide programmers with a variety of sophisticated tools for program visualization and manipulation. These tools assist the prog...
Anne Mulhern, Charles Fischer, Ben Liblit
TCS
2010
15 years 3 months ago
Translating propositional extended conjunctions of Horn clauses into Boolean circuits
Horn⊃ is a logic programming language which extends usual Horn clauses by adding intuitionistic implication in goals and clause bodies. This extension can be seen as a form of s...
Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, M...
ECOOP
2009
Springer
16 years 5 months ago
COPE - Automating Coupled Evolution of Metamodels and Models
Model-based development promises to increase productivity by offering modeling languages tailored to a specific domain. Such modeling languages are typically defined by a metamodel...
Elmar Jürgens, Markus Herrmannsdoerfer, Sebas...