Sciweavers

298 search results - page 35 / 60
» An Analysis of Exponentiation Based on Formal Languages
Sort
View
CPP
2011
107views more  CPP 2011»
12 years 7 months ago
Simple, Functional, Sound and Complete Parsing for All Context-Free Grammars
Parsing text to identify grammatical structure is a common task, especially in relation to programming languages and associated tools such as compilers. Parsers for context-free g...
Tom Ridge
ICDT
2007
ACM
141views Database» more  ICDT 2007»
14 years 2 months ago
Exact XML Type Checking in Polynomial Time
Stay macro tree transducers (smtts) are an expressive formalism for reasoning about XSLT-like document transformations. Here, we consider the exact type checking problem for smtts....
Sebastian Maneth, Thomas Perst, Helmut Seidl
JUCS
2008
134views more  JUCS 2008»
13 years 7 months ago
A Tool for Reasoning about Qualitative Temporal Information: the Theory of S-languages with a Lisp Implementation
: Reasoning about incomplete qualitative temporal information is an essential topic in many artificial intelligence and natural language processing applications. In the domain of n...
Irène Durand, Sylviane R. Schwer
STACS
1993
Springer
13 years 12 months ago
The Complexity of Logic-Based Abduction
Abduction is an important form of nonmonotonic reasoning allowing one to find explanations for certain symptoms or manifestations. When the application domain is described by a l...
Thomas Eiter, Georg Gottlob
MODELS
2009
Springer
14 years 14 days ago
From UML to Alloy and Back Again
Abstract. Model Transformations can be used to bridge the gap between design and analysis technical spaces by creating tools that allow a model produced by a designer to be transfo...
Seyyed M. A. Shah, Kyriakos Anastasakis, Behzad Bo...