523 search results - page 6 / 105 » Decidability of string graphs |
FOCS
2010
IEEE
14 years 7 months ago
2010
IEEE
SEMWEB
2005
Springer
15 years 2 months ago
2005
Springer
This paper extends the model theory of RDF with rules, placing an emphasis on integration with OWL and decidability of entailstart from an abstract syntax that views a rule as a pa...
ICCV
2003
IEEE
15 years 2 months ago
2003
IEEE
This paper is concerned with computing graph edit distance. One of the criticisms that can be leveled at existing methods for computing graph edit distance is that it lacks the fo...
104
click to vote
TRIER
2002
14 years 9 months ago
2002
Constant propagation aims at identifying expressions that always yield a unique constant value at run-time. It is well-known that constant propagation is undecidable for programs w...
PARLE
1987
15 years 27 days ago
1987
A context-freegrammar(CFG)in GreibachNormalForm coincides,in anothernotation,witha system of guarded recursion equations in Basic Process Algebra. Hence to each CFG a process can b...