-
5
-
-
0032041679
-
Completion of rewrite systems with membership constraints. Part I: Deduction rules
-
Hubert Comon. Completion of rewrite systems with membership constraints. Part I: Deduction rules. Journal of Symbolic Computation, 25(4):397-419, 1998.
-
(1998)
Journal of Symbolic Computation
, vol.25
, Issue.4
, pp. 397-419
-
-
Comon, H.1
-
6
-
-
0032041680
-
Hubert comon. Completion of rewrite systems with membership constraints. Part II: Constraint solving
-
Hubert Comon. Completion of rewrite systems with membership constraints. Part II: Constraint solving. Journal of Symbolic Computation, 25(4):421-453, 1998.
-
(1998)
Journal of Symbolic Computation
, vol.25
, Issue.4
, pp. 421-453
-
-
-
7
-
-
84957622091
-
Higher-order matching and tree automata
-
LNCS 1414, Aarhus. Springer-Verlag, Berlin
-
Hubert Comon and Yan Jurski. Higher-order matching and tree automata. In Proc. Conf. on Computer Science Logic (CSL-97), LNCS 1414, pages 157-176, Aarhus, 1997. Springer-Verlag, Berlin.
-
(1997)
Proc. Conf. on Computer Science Logic (CSL-97)
, pp. 157-176
-
-
Comon, H.1
Jurski, Y.2
-
8
-
-
84957699853
-
Efficient second-order matching
-
LNCS 1103, New Brunswick, NJ, 1996. Springer-Verlag, Berlin
-
Régis Curien, Zhenyu Qian, and Hui Shi. Efficient second-order matching. In Proc. 7th Int. Conf. on Rewriting Techniques and Applications, LNCS 1103, pages 317-331, New Brunswick, NJ, 1996. Springer-Verlag, Berlin, 1996.
-
(1996)
Proc. 7th Int. Conf. on Rewriting Techniques and Applications
, pp. 317-331
-
-
Curien, R.1
Qian, Z.2
Shi, H.3
-
9
-
-
84937422264
-
Linear higher-order matching is NP-complete
-
LNCS 1833, Norwich, 2000. Springer-Verlag, Berlin
-
Philippe de Groote. Linear higher-order matching is NP-complete. In Proc. 11th Int. Conf. on Rewriting Techniques and Applications, LNCS 1833, pages 127-140, Norwich, 2000. Springer-Verlag, Berlin, 2000.
-
(2000)
Proc. 11th Int. Conf. on Rewriting Techniques and Applications
, pp. 127-140
-
-
De Groote, P.1
-
10
-
-
84947239741
-
A decidable variant of higher-order matching
-
LNCS 2378, pages 340ff, Copenhagen, 2002. Springer-Verlag, Berlin
-
Dan Dougherty and ToMasz Wierzbicki. A decidable variant of higher-order matching. In Proc. 13th Int. Conf. on Rewriting Techniques and Applications (RTA), LNCS 2378, pages 340ff, Copenhagen, 2002. Springer-Verlag, Berlin, 2002.
-
(2002)
Proc. 13th Int. Conf. on Rewriting Techniques and Applications (RTA)
-
-
Dougherty, D.1
Wierzbicki, T.2
-
11
-
-
0012575636
-
Higher-order unification and matching
-
Alan Robinson and Andrei Voronkov, editors, chapter 16. North-Holland, Amsterdam
-
Gilles Dowek. Higher-order unification and matching. In Alan Robinson and Andrei Voronkov, editors. Handbook of Automated Reasoning, volume 2, chapter 16, pages 1009-1062. North-Holland, Amsterdam, 2001.
-
(2001)
Handbook of Automated Reasoning
, vol.2
, pp. 1009-1062
-
-
Dowek, G.1
-
12
-
-
84937396988
-
Parallelism constraints
-
LNCS 1833, 2000. Springer-Verlag, Berlin
-
Katrin Erk and Joachim Niehren. Parallelism constraints. In Proc. 11 th Int. Conf. on Rewriting Techniques and Applications, LNCS 1833, pages 110-126, 2000. Springer-Verlag, Berlin, 2000.
-
(2000)
Proc. 11 Th Int. Conf. on Rewriting Techniques and Applications
, pp. 110-126
-
-
Erk, K.1
Niehren, J.2
-
14
-
-
36849075107
-
Tractable and intractable second-order matching problems
-
LNCS 1627. Springer-Verlag, Berlin
-
Kouichi Hirata, Keizo Yamada, and Masaleru Harao. Tractable and intractable second-order matching problems. In Proc. 5th Ann. Int. Computing and Combinatorics Conference (COCOON '99), LNCS 1627, pages 432-441. Springer-Verlag, Berlin, 1999.
-
(1999)
Proc. 5th Ann. Int. Computing and Combinatorics Conference (COCOON '99)
, pp. 432-441
-
-
Hirata, K.1
Yamada, K.2
Harao, M.3
-
16
-
-
0018050926
-
Proving and applying program transformations expressed with second-order patterns
-
Gérard Huet and Bernard Lang. Proving and applying program transformations expressed with second-order patterns. Acta Informatica, 11:31-55, 1978.
-
(1978)
Acta Informatica
, vol.11
, pp. 31-55
-
-
Huet, G.1
Lang, B.2
-
18
-
-
10844252661
-
Higher order β matching is undecidable
-
Ralph Loader. Higher order β matching is undecidable. Logic Journal of the IGPL, 11(1):51-68, 2003.
-
(2003)
Logic Journal of the IGPL
, vol.11
, Issue.1
, pp. 51-68
-
-
Loader, R.1
-
20
-
-
84944212694
-
Stratified context unification is in PSPACE
-
LNCS 2142. Springer-Verlag, Berlin
-
Manfred Schmidt-Schauß. Stratified context unification is in PSPACE. In CSL 2001, LNCS 2142, pages 498-512. Springer-Verlag, Berlin, 2001.
-
(2001)
CSL 2001
, pp. 498-512
-
-
Schmidt-Schauß, M.1
-
21
-
-
0037216073
-
A decision algorithm for stratified context unification
-
Manfred Schmidt-Schauß. A decision algorithm for stratified context unification. Journal of Logic and Computation, 12(6):929-953, 2002.
-
(2002)
Journal of Logic and Computation
, vol.12
, Issue.6
, pp. 929-953
-
-
Schmidt-Schauß, M.1
-
22
-
-
84958752368
-
On the exponent of periodicity of minimal solutions of context equations
-
LNCS 1379, Tsukuba, 1998. Springer-Verlag, Berlin
-
Manfred Schmidt-Schauß and Klaus U. Schulz. On the exponent of periodicity of minimal solutions of context equations. In Proc. 9th Int. Conf. on Rewriting Techniques and Applications, LNCS 1379, pages 61-75, Tsukuba, 1998. Springer-Verlag, Berlin, 1998.
-
(1998)
Proc. 9th Int. Conf. on Rewriting Techniques and Applications
, pp. 61-75
-
-
Schmidt-Schauß, M.1
Schulz, K.U.2
-
23
-
-
0036153167
-
Solvability of context equations with two context variables is decidable
-
Manfred Schmidt-Schauß and Klaus U. Schulz. Solvability of context equations with two context variables is decidable. Journal of Symbolic Computation, 33(1):77-122, 2002.
-
(2002)
Journal of Symbolic Computation
, vol.33
, Issue.1
, pp. 77-122
-
-
Schmidt-Schauß, M.1
Schulz, K.U.2
-
25
-
-
84937413155
-
Deriving theory superposition calculi from convergent term rewriting systems
-
LNCS 1833, Norwich, 2000. Springer-Verlag, Berlin
-
Jürgen Stuber. Deriving theory superposition calculi from convergent term rewriting systems. In Proc. 11th Int. Conf. on Rewriting Techniques and Applications (RTA 2000), LNCS 1833, pages 229-245, Norwich, 2000. Springer-Verlag, Berlin, 2000.
-
(2000)
Proc. 11th Int. Conf. on Rewriting Techniques and Applications (RTA 2000)
, pp. 229-245
-
-
Stuber, J.1
-
26
-
-
84867804369
-
A model-based completeness proof of Extended Narrowing and Resolution
-
(IJCAR-2001), LNCS 2083, Siena, 2001. Springer-Verlag, Berlin
-
Jürgen Stuber. A model-based completeness proof of Extended Narrowing And Resolution. In Proc. 1st Int. Joint Conf. on Automated Reasoning (IJCAR-2001), LNCS 2083, pages 195-210, Siena, 2001. Springer-Verlag, Berlin, 2001.
-
(2001)
Proc. 1st Int. Joint Conf. on Automated Reasoning
, pp. 195-210
-
-
Stuber, J.1
-
27
-
-
84957656463
-
Complexity of the higher-order matching
-
LNAI1632, Trento, 1999. Springer-Verlag, Berlin
-
ToMasz Wierzbicki. Complexity of the higher-order matching. In Proc. 16th Int. Conf. on Automated Deduction (CADE-16), LNAI1632, pages 82-96, Trento, 1999. Springer-Verlag, Berlin, 1999.
-
(1999)
Proc. 16th Int. Conf. on Automated Deduction (CADE-16)
, pp. 82-96
-
-
Wierzbicki, T.1
|