Sciweavers

ACL
2009
13 years 1 months ago
Unsupervised Learning of Narrative Schemas and their Participants
We describe an unsupervised system for learning narrative schemas, coherent sequences or sets of events (arrested(POLICE,SUSPECT), convicted( JUDGE, SUSPECT)) whose arguments are ...
Nathanael Chambers, Dan Jurafsky
TSD
2010
Springer
13 years 1 months ago
Encoding Event and Argument Structures in Wordnets
In this paper we propose the codification of argument and event structures in wordnets, providing information on selection properties, semantic incorporation phenomena and internal...
Raquel Amaro, Sara Mendes, Palmira Marrafa
TCS
2008
13 years 3 months ago
True-concurrency probabilistic models: Markov nets and a law of large numbers
We introduce the model of Markov nets, a probabilistic extension of safe Petri nets under the true-concurrency semantics--this means that traces, not firing sequences, are given a...
Samy Abbes, Albert Benveniste
LREC
2008
82views Education» more  LREC 2008»
13 years 5 months ago
A Linguistic Resource for Discovering Event Structures and Resolving Event Coreference
In this paper, we present a linguistic resource that annotates event structures in texts. We consider an event structure as a collection of events that interact with each other in...
Cosmin Adrian Bejan, Sanda M. Harabagiu
LREC
2010
162views Education» more  LREC 2010»
13 years 5 months ago
A Linguistic Resource for Semantic Parsing of Motion Events
This paper presents a corpus of annotated motion events and their event structure. We consider motion events triggered by a set of motion evoking words and contemplate both litera...
Kirk Roberts, Srikanth Gullapalli, Cosmin Adrian B...
CONCUR
2006
Springer
13 years 7 months ago
Event Structure Semantics for Nominal Calculi
Event structures have been used for giving true concurrent semantics to languages and models of concurrency such as CCS, Petri nets and graph grammars. Although certain nominal cal...
Roberto Bruni, Hernán C. Melgratti, Ugo Mon...
FSTTCS
2005
Springer
13 years 9 months ago
The MSO Theory of Connectedly Communicating Processes
Abstract. We identify a network of sequential processes that communicate by synchronizing frequently on common actions. More precisely, we demand that there is a bound k such that ...
P. Madhusudan, P. S. Thiagarajan, Shaofa Yang
TACAS
2007
Springer
165views Algorithms» more  TACAS 2007»
13 years 9 months ago
Unfolding Concurrent Well-Structured Transition Systems
Abstract. Our main objective is to combine partial-order methods with verification techniques for infinite-state systems in order to obtain efficient verification algorithms fo...
Frédéric Herbreteau, Grégoire...