Sciweavers

250 search results - page 4 / 50
» Fixed Argument Pairings
Sort
View
SOFSEM
2007
Springer
14 years 3 months ago
Constraints for Argument Filterings
Abstract. The dependency pair method is a powerful method for automatically proving termination of rewrite systems. When used with traditional simplification orders like LPO and K...
Harald Zankl, Nao Hirokawa, Aart Middeldorp
IWPC
2009
IEEE
14 years 4 months ago
BugFix: A learning-based tool to assist developers in fixing bugs
We present a tool called BugFix that can assist developers in fixing program bugs. Our tool automatically analyzes the debugging situation at a statement and reports a prioritize...
Dennis Jeffrey, Min Feng, Neelam Gupta, Rajiv Gupt...
FOIKS
2008
Springer
13 years 11 months ago
Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach
There are a number of frameworks for modelling argumentation in logic. They incorporate a formal representation of individual arguments and techniques for comparing conflicting arg...
Vasiliki Efstathiou, Anthony Hunter
ECSQARU
2009
Springer
14 years 4 months ago
An Algorithm for Generating Arguments in Classical Predicate Logic
Abstract. There are a number of frameworks for modelling argumentation in logic. They incorporate a formal representation of individual arguments and techniques for comparing con...
Vasiliki Efstathiou, Anthony Hunter
MICAI
2004
Springer
14 years 3 months ago
A Preprocessing That Combines Heuristic and Surrogate Constraint Analysis to Fix Variables in TSP
A preprocessing procedure that uses a local guided search defined in terms of a neighborhood structure to get a feasible solution (UB) and the Osorio and Glover[18, 20] exploiting ...
María Auxilio Osorio Lama, David Pinto