Sciweavers

213 search results - page 14 / 43
» Relating Word and Tree Automata
Sort
View
VMCAI
2007
Springer
14 years 1 months ago
Lattice Automata
Abstract. Several verification methods involve reasoning about multi-valued systems, in which an atomic proposition is interpreted at a state as a lattice element, rather than a B...
Orna Kupferman, Yoad Lustig
EMNLP
2009
13 years 5 months ago
Convolution Kernels on Constituent, Dependency and Sequential Structures for Relation Extraction
This paper explores the use of innovative kernels based on syntactic and semantic structures for a target relation extraction task. Syntax is derived from constituent and dependen...
Truc-Vien T. Nguyen, Alessandro Moschitti, Giusepp...
IJCNLP
2005
Springer
14 years 1 months ago
Exploring Syntactic Relation Patterns for Question Answering
Abstract. In this paper, we explore the syntactic relation patterns for opendomain factoid question answering. We propose a pattern extraction method to extract the various relatio...
Dan Shen, Geert-Jan M. Kruijff, Dietrich Klakow
ICDT
2012
ACM
226views Database» more  ICDT 2012»
11 years 10 months ago
Bounded repairability for regular tree languages
We consider the problem of repairing unranked trees (e.g., XML documents) satisfying a given restriction specification R (e.g., a DTD) into unranked trees satisfying a given targ...
Gabriele Puppis, Cristian Riveros, Slawek Staworko
FSTTCS
2001
Springer
13 years 12 months ago
Rewrite Closure for Ground and Cancellative AC Theories
Given a binary relation IE ∪ IR on the set of ground terms e signature, we define an abstract rewrite closure for IE ∪ IR. act rewrite closure can be interpreted as a speciali...
Ashish Tiwari