618 search results - page 63 / 124 » Computational Models of Natural Language Argument |
101
click to vote
CONCURRENCY
2002
14 years 9 months ago
2002
Practical applications are generally interdisciplinary in nature. The technology is well matured for addressing individual discipline applications and not for interdisciplinary ap...
COLING
1996
14 years 11 months ago
1996
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
110
click to vote
CSI
2007
14 years 9 months ago
2007
The Reference Model of Open Distributed Processing (RM-ODP) is a joint standardization effort by ITU-T and ISO/IEC for the specification of large open distributed systems. RM-ODP ...
ICTAC
2005
Springer
15 years 3 months ago
2005
Springer
Rewriting logic is a simple computational logic very well suited as a semantic framework within which many different models of computation, systems and languages can be naturally ...
STOC
2007
ACM
15 years 10 months ago
2007
ACM
We prove and extend a conjecture of Kempe, Kleinberg, and Tardos (KKT) on the spread of influence in social networks. A social network can be represented by a directed graph where...