Sciweavers

1000 search results - page 152 / 200
» Nominal rewriting systems
Sort
View
PVLDB
2008
118views more  PVLDB 2008»
13 years 8 months ago
XTCcmp: XQuery compilation on XTC
XTCcmp, the XQuery Compiler of a native XML database system, extends Starburst's well-known Query Graph Model to serve as an internal representation and basis for query restr...
Christian Mathis, Andreas M. Weiner, Theo Här...
LPAR
2010
Springer
13 years 6 months ago
Speed-Up Techniques for Negation in Grounding
Abstract. Grounding is the task of reducing a first order formula to ground formula that is equivalent on a given universe, and is important in many kinds of problem solving and re...
Amir Aavani, Shahab Tasharrofi, Gulay Ünel, E...
CORR
2009
Springer
115views Education» more  CORR 2009»
13 years 6 months ago
Testing the Equivalence of Regular Languages
The minimal deterministic finite automaton is generally used to determine regular languages equality. Using Brzozowski's notion of derivative, Antimirov and Mosses proposed a...
Marco Almeida, Nelma Moreira, Rogério Reis
AAAI
2011
12 years 8 months ago
Recognizing Plans with Loops Represented in a Lexicalized Grammar
This paper extends existing plan recognition research to handle plans containing loops. We supply an encoding of plans with loops for recognition, based on techniques used to pars...
Christopher W. Geib, Robert P. Goldman
ANLP
1997
190views more  ANLP 1997»
13 years 10 months ago
Disambiguation of Proper Names in Text
Identifying the occurrences of proper names in text and the entities they refer to can be a difficult task because of the manyto-many mapping between names and their referents. We...
Nina Wacholder, Yael Ravin, Misook Choi