AAAAAA

   
Results: 1-14 |
Results: 14
MONOTONICITY AND PERSISTENCE IN PREFERENTIAL LOGICS
Authors: ENGELFRIET J
Citation: J. Engelfriet, MONOTONICITY AND PERSISTENCE IN PREFERENTIAL LOGICS, The journal of artificial intelligence research, 8, 1998, pp. 1-21
THE EQUIVALENCE OF BOTTOM-UP AND TOP-DOWN TREE-TO-GRAPH TRANSDUCERS
Authors: ENGELFRIET J VOGLER H
Citation: J. Engelfriet et H. Vogler, THE EQUIVALENCE OF BOTTOM-UP AND TOP-DOWN TREE-TO-GRAPH TRANSDUCERS, Journal of computer and system sciences (Print), 56(3), 1998, pp. 332-356
DOMINO TREEWIDTH
Authors: BODLAENDER HL ENGELFRIET J
Citation: Hl. Bodlaender et J. Engelfriet, DOMINO TREEWIDTH, Journal of algorithms, 24(1), 1997, pp. 94-123
LOGICAL DESCRIPTION OF CONTEXT-FREE GRAPH LANGUAGES
Authors: ENGELFRIET J VANOOSTROM V
Citation: J. Engelfriet et V. Vanoostrom, LOGICAL DESCRIPTION OF CONTEXT-FREE GRAPH LANGUAGES, Journal of computer and system sciences, 55(3), 1997, pp. 489-503
CONTEXT-FREE GRAPH-GRAMMARS AND CONCATENATION OF GRAPHS
Authors: ENGELFRIET J VEREIJKEN JJ
Citation: J. Engelfriet et Jj. Vereijken, CONTEXT-FREE GRAPH-GRAMMARS AND CONCATENATION OF GRAPHS, Acta informatica, 34(10), 1997, pp. 773-803
EXECUTABLE TEMPORAL LOGIC FOR NONMONOTONIC REASONING
Authors: ENGELFRIET J TREUR J
Citation: J. Engelfriet et J. Treur, EXECUTABLE TEMPORAL LOGIC FOR NONMONOTONIC REASONING, Journal of symbolic computation, 22(5-6), 1996, pp. 615-625
CHARACTERIZATION AND COMPLEXITY OF UNIFORMLY NONPRIMITIVE LABELED 2-STRUCTURES
Authors: ENGELFRIET J HARJU T PROSKUROWSKI A ROZENBERG G
Citation: J. Engelfriet et al., CHARACTERIZATION AND COMPLEXITY OF UNIFORMLY NONPRIMITIVE LABELED 2-STRUCTURES, Theoretical computer science, 154(2), 1996, pp. 247-282
A MULTISET SEMANTICS FOR THE PI-CALCULUS WITH REPLICATION
Authors: ENGELFRIET J
Citation: J. Engelfriet, A MULTISET SEMANTICS FOR THE PI-CALCULUS WITH REPLICATION, Theoretical computer science, 153(1-2), 1996, pp. 65-94
REGULAR DESCRIPTION OF CONTEXT-FREE GRAPH LANGUAGES
Authors: ENGELFRIET J VANOOSTROM V
Citation: J. Engelfriet et V. Vanoostrom, REGULAR DESCRIPTION OF CONTEXT-FREE GRAPH LANGUAGES, Journal of computer and system sciences, 53(3), 1996, pp. 556-574
FINITE LANGUAGES FOR THE REPRESENTATION OF FINITE GRAPHS
Authors: EHRENFEUCHT A ENGELFRIET J ROZENBERG G
Citation: A. Ehrenfeucht et al., FINITE LANGUAGES FOR THE REPRESENTATION OF FINITE GRAPHS, Journal of computer and system sciences, 52(1), 1996, pp. 170-184
A LOGICAL CHARACTERIZATION OF THE SETS OF HYPERGRAPHS DEFINED BY HYPEREDGE REPLACEMENT GRAMMARS
Authors: COURCELLE B ENGELFRIET J
Citation: B. Courcelle et J. Engelfriet, A LOGICAL CHARACTERIZATION OF THE SETS OF HYPERGRAPHS DEFINED BY HYPEREDGE REPLACEMENT GRAMMARS, Mathematical systems theory, 28(6), 1995, pp. 515-552
THE TRANSLATION POWER OF TOP-DOWN TREE-TO-GRAPH TRANSDUCERS
Authors: ENGELFRIET J VOGLER H
Citation: J. Engelfriet et H. Vogler, THE TRANSLATION POWER OF TOP-DOWN TREE-TO-GRAPH TRANSDUCERS, Journal of computer and system sciences, 49(2), 1994, pp. 258-305
HYPERGRAPH LANGUAGES OF BOUNDED DEGREE
Authors: ENGELFRIET J HEYKER L
Citation: J. Engelfriet et L. Heyker, HYPERGRAPH LANGUAGES OF BOUNDED DEGREE, Journal of computer and system sciences, 48(1), 1994, pp. 58-89
CONTEXT-FREE GRAPH LANGUAGES OF BOUNDED DEGREE ARE GENERATED BY APEX GRAPH-GRAMMARS
Authors: ENGELFRIET J HEYKER L LEIH G
Citation: J. Engelfriet et al., CONTEXT-FREE GRAPH LANGUAGES OF BOUNDED DEGREE ARE GENERATED BY APEX GRAPH-GRAMMARS, Acta informatica, 31(4), 1994, pp. 341-378
Risultati: 1-14 |