Sciweavers

40 search results - page 2 / 8
» Coherence in finite argument systems
Sort
View
ACL
1998
13 years 6 months ago
Generating the Structure of Argument
This paper demonstrates that generating arguments in natural language requires at an abstract level, and that the ate abstraction cannot be captured by approaches based solely upo...
Chris Reed, Derek Long
AI
2007
Springer
13 years 5 months ago
Computational properties of argument systems satisfying graph-theoretic constraints
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...
Paul E. Dunne
DEXA
2004
Springer
108views Database» more  DEXA 2004»
13 years 10 months ago
Identifying Audience Preferences in Legal and Social Domains
Reasoning in legal and social domains appears not to be well dealt with by deductive approaches. This is because such reasoning is open-endedly defeasible, and because the various ...
Paul E. Dunne, Trevor J. M. Bench-Capon
DAC
1994
ACM
13 years 9 months ago
BDD Variable Ordering for Interacting Finite State Machines
We address the problem of obtaining good variable orderings for the BDD representation of a system of interacting finite state machines (FSMs). Orderings are derived from the comm...
Adnan Aziz, Serdar Tasiran, Robert K. Brayton
ACL
1993
13 years 6 months ago
The Effect of Establishing Coherence in Ellipsis and Anaphora Resolution
This paper presents a new model of anaphoric processing that utilizes the establishment of coherence relations between clauses in a discourse. We survey data that comprises a curr...
Andrew Kehler