Sciweavers

2944 search results - page 2 / 589
» On Well Quasi-orders on Languages
Sort
View
POPL
2011
ACM
12 years 8 months ago
Pick your contexts well: understanding object-sensitivity
ensitivity has emerged as an excellent context abstraction for points-to analysis in object-oriented languages. Despite its practical success, however, object-sensitivity is poorl...
Yannis Smaragdakis, Martin Bravenboer, Ondrej Lhot...
AAAI
2012
11 years 8 months ago
Equality-Friendly Well-Founded Semantics and Applications to Description Logics
We tackle the problem of defining a well-founded semantics (WFS) for Datalog rules with existentially quantified variables in their heads and negations in their bodies. In partic...
Georg Gottlob, André Hernich, Clemens Kupke...
NAACL
2010
13 years 3 months ago
Efficient Parsing of Well-Nested Linear Context-Free Rewriting Systems
The use of well-nested linear context-free rewriting systems has been empirically motivated for modeling of the syntax of languages with discontinuous constituents or relatively f...
Carlos Gómez-Rodríguez, Marco Kuhlma...
FOSSACS
2011
Springer
12 years 9 months ago
Ordinal Theory for Expressiveness of Well Structured Transition Systems
To the best of our knowledge, we characterize for the first time the importance of resources (counters, channels, alphabets) when measuring expressiveness of WSTS. We establish, f...
Rémi Bonnet, Alain Finkel, Serge Haddad, Fe...
LICS
2007
IEEE
14 years 8 days ago
On Noetherian Spaces
A topological space is Noetherian iff every open is compact. Our starting point is that this notion generalizes that of well-quasi order, in the sense that an Alexandroff-discrete...
Jean Goubault-Larrecq