250 search results - page 4 / 50 » Fixed Argument Pairings |
154
click to vote
SOFSEM
2007
Springer
15 years 11 months ago
2007
Springer
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...
129
click to vote
IWPC
2009
IEEE
16 years 10 days ago
2009
IEEE
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...
163
click to vote
FOIKS
2008
Springer
2008
Springer
Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach
15 years 7 months ago
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...
153
click to vote
ECSQARU
2009
Springer
16 years 7 days ago
2009
Springer
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...
142
click to vote
MICAI
2004
Springer
15 years 11 months ago
2004
Springer
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 ...