Sciweavers

11740 search results - page 72 / 2348
» More Problems in Rewriting
Sort
View
STOC
2010
ACM
216views Algorithms» more  STOC 2010»
14 years 8 months ago
The HOM problem is decidable
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
Guillem Godoy, Omer Giménez, Lander Ramos and Car...
ICALP
1997
Springer
14 years 3 months ago
The Theory of Vaccines
Despite the major role that modularity occupies in computer science, all the known results on modular analysis only treat particular problems, and there is no general unifying the...
Massimo Marchiori
AUIC
2006
IEEE
14 years 5 months ago
Patternprogrammer: yet another rule-based programming environment for children
Graphical rewrite rules are often used in programming environments for children. These rules consist of two parts: a left-hand side, which is visually matched in the environment, ...
Tim Wright
LPAR
2005
Springer
14 years 4 months ago
Algebraic Intruder Deductions
Abstract. Many security protocols fundamentally depend on the algebraic properties of cryptographic operators. It is however difficult to handle these properties when formally anal...
David A. Basin, Sebastian Mödersheim, Luca Vi...
COLING
1992
14 years 9 days ago
On the Satisfiability of Complex Constraints
The main problem arising from the use of complex constraints in Computational Linguists is due to the NP-hardness of checking whether a given set of constraints is satisfiable and...
Luís Damas, Giovanni B. Varile