Sciweavers

2231 search results - page 177 / 447
» Alternation as a programming paradigm
Sort
View
ESEC
1999
Springer
15 years 8 months ago
Yesterday, My Program Worked. Today, It Does Not. Why?
Imagine some program and a number of changes. If none of these changes is applied (“yesterday”), the program works. If all changes are applied (“today”), the program does n...
Andreas Zeller
141
Voted
PPDP
2009
Springer
15 years 11 months ago
Automatic refactoring of Erlang programs
This paper describes the design goals and current status of tidier, a software tool that tidies Erlang source code, making it cleaner, simpler, and often also more efficient. In ...
Konstantinos F. Sagonas, Thanassis Avgerinos
SEMWEB
2009
Springer
15 years 11 months ago
Processing OWL2 Ontologies using Thea: An Application of Logic Programming
Traditional object-oriented programming languages can be difficult to use when working with ontologies, leading to the creation of domain-specific languages designed specifically...
Vangelis Vassiliadis, Jan Wielemaker, Chris Mungal...
ICDCS
1991
IEEE
15 years 8 months ago
Supporting the development of network programs
of ‘‘network computers’’ is inherently lessAbstract predictable than that of more traditional distributed memory systems, such as hypercubes [22], since both theFor computa...
Bernd Bruegge, Peter Steenkiste
148
Voted
CORR
2000
Springer
120views Education» more  CORR 2000»
15 years 4 months ago
Scaling Up Inductive Logic Programming by Learning from Interpretations
When comparing inductive logic programming (ILP) and attribute-value learning techniques, there is a trade-off between expressive power and efficiency. Inductive logic programming ...
Hendrik Blockeel, Luc De Raedt, Nico Jacobs, Bart ...