1242 search results - page 56 / 249 » The Theory of Grammar Constraints |
150
click to vote
FROCOS
2007
Springer
16 years 9 days ago
2007
Springer
Constraint solvers are key modules in many systems with reasoning capabilities (e.g., automated theorem provers). To incorporate constraint solvers in such systems, the capability ...
163
click to vote
FOCS
2003
IEEE
15 years 11 months ago
2003
IEEE
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...
178
click to vote
MFCS
2007
Springer
16 years 8 days ago
2007
Springer
In formal language theory, many families of languages are defined using grammars or finite acceptors like pushdown automata and Turing machines. For instance, context-sensitive l...
178
click to vote
TAGT
1998
Springer
15 years 10 months ago
1998
Springer
Graphs are a commonly used formalism for modeling many different kinds of static and dynamic data. In many applications, data modeling can be improved by using hierarchically struc...
146
click to vote
CONCUR
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We propose a framework for model-based diagnosis of systems with mobility and variable topologies, modelled as graph transformation systems. Generally speaking, model-bas...