456 search results - page 1 / 92 » Constraints for Argument Filterings |
100
Voted
SOFSEM
2007
Springer
15 years 6 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...
82
Voted
ECCV
2006
Springer
15 years 3 months ago
2006
Springer
This paper is an argument for two assertions: First, that by representing correspondence probabilistically, drastically more correspondence information can be extracted from image...
95
Voted
AI
2007
Springer
15 years 9 days ago
2007
Springer
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...
101
click to vote
AGENTS
2001
Springer
15 years 4 months ago
2001
Springer
Conflict resolution is a critical problem in distributed and collaborative multi-agent systems. Negotiation via argumentation (NVA), where agents provide explicit arguments or ju...
92
Voted
JAR
2006
15 years 4 days ago
2006
To simplify the task of proving termination and AC-termination of term rewriting systems, elimination transformations have been vigorously studied since the 1990's. Dummy elim...