411 search results - page 39 / 83 » Automating the Dependency Pair Method |
FECS
2008
14 years 7 days ago
2008
We report on the successful process of transitioning a 4th-year university software engineering capstone course from a waterfall approach to an iterative, more agile model. The se...
CADE
2002
Springer
14 years 11 months ago
2002
Springer
Modularity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 46 Michael Abbott, Neil Ghani, and Christoph L?uth Union of Equational Theo...
NMR
2004
Springer
14 years 4 months ago
2004
Springer
There are a number of frameworks for modelling argumentation in logic. They incorporate a formal representation of individual arguments and techniques for comparing conflicting a...
DAGSTUHL
2007
14 years 7 days ago
2007
Abstract. Well-founded orders are the most basic, but also most important ingredient to virtually all termination analyses. Numerous fully automated search algorithms for these cla...
ICCBR
1999
Springer
14 years 3 months ago
1999
Springer
Abstract. The development of successful case-based design aids depends both on the CBR processes themselves and on crucial questions of integrating the CBR system into the larger t...