100 search results - page 11 / 20 » Closure and factor-critical graphs |
BIRTHDAY
2010
Springer
13 years 8 months ago
2010
Springer
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
With more and more large networks becoming available, mining and querying such networks are increasingly important tasks which are not being supported by database models and query...
RTA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Interaction nets are a graphical formalism inspired by Linear Logic proof-nets often used for studying higher order rewriting e.g. β-reduction. Traditional presentations...
ENTCS
2007
13 years 7 months ago
2007
Reasoning about graph and model transformation systems is an important means to underpin model-driven software engineering, such as Model-Driven Architecture (MDA) and Model Integ...
FOSSACS
2004
Springer
14 years 26 days ago
2004
Springer
Several types of term rewriting systems can be distinguished by the way their rules overlap. In particular, we define the classes of prefix, suffix, bottom-up and top-down system...