T. Kutsia. Unification with sequence variables and flexible arity symbols and its extension with pattern-terms. In J. Calmet, B. Benhamou, O. Caprotti, L. Henocque, and V. Sorge, editors, Artificial Intelligence, Automated Reasoning and Symbolic Computation. Proc. of Joint AISC'2002 -- Calculemus'2002 Conference, volume 2385 of LNAI, pages 290--304. Springer, 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Functional Programming with Sequence Variables: The Sequentica.. - Marin (2003) (1 citation) (Correct)
....by a score function which must be optimized. We illustrate the usefulness of our extensions and describe how they have been implemented. 1 Introduction The concept of sequence variable has proved useful in many areas, such as symbolic computation [6] term rewriting [1, 4] unification [5] and computational logic [3] We feel that the expressive power of this concept is not yet completely understood and that a better formalization is still desirable. A sequence variable is a function parameter which can be instantiated with a (possibly empty) sequence of terms. Currently, ....
....if there exists one, and fail if there is no matcher. Note that, by Remark 1, the calls of Matcher( from inside ExtPattMatch( are deterministic. The method uncut(inp) undoes all the cuts performed on an expression. For example, uncut(f [cut[1, 2] g[cut[3, 4] 5, cut[6, 7] yields f[1, 2, g[3, 4, 5, 6, 7]] Algorithm ExtPattMatch Description Matching with sequence annotated patterns inp: input data i: recursion index the matcher # between uncut(inp) and patt , if # exists; fail, otherwise. if i = #(patt) 1 return Matcher(inp, patt ) Matcher(inp, patt i ) Enumerate the ....
T. Kutsia. Unification with Sequence Variables and Flexible Arity Symbols and its Extension with Pattern-Terms. In Artificial Intelligence, Automated Reasoning and Symbolic Computation. Proceedings of Joint AICS'2002 - Calculemus'2002 Conference, volume 2385 of LNAI, Marseille, France, 2002.
Can Context Sequence Matching Be Used for XML Querying? - Kutsia, Marin Self-citation (Kutsia) (Correct)
No context found.
T. Kutsia. Unification with sequence variables and flexible arity symbols and its extension with pattern-terms. In J. Calmet, B. Benhamou, O. Caprotti, L. Henocque, and V. Sorge, editors, Artificial Intelligence, Automated Reasoning and Symbolic Computation. Proc. of Joint AISC'2002 -- Calculemus'2002 Conference, volume 2385 of LNAI, pages 290--304. Springer, 2002.
Context Sequence Matching for XML - Kutsia (2005) Self-citation (Kutsia) (Correct)
No context found.
T. Kutsia. Unification with sequence variables and flexible arity symbols and its extension with pattern-terms. In J. Calmet, B. Benhamou, O. Caprotti, L. Henocque, and V. Sorge, editors, Artificial Intelligence, Automated Reasoning and Symbolic Computation. Proc. of Joint AISC'2002.
A Rule-Based Framework for Solving Regular Context Sequence.. - Kutsia, Marin (2006) Self-citation (Kutsia) (Correct)
No context found.
T. Kutsia. Unification with sequence variables and flexible arity symbols and its extension with pattern-terms. In J. Calmet, B. Benhamou, O. Caprotti, L. Henocque, and V. Sorge, editors, Proc. of Joint Aisc'2002---Calculemus'2002 Conference, volume 2385 of Lnai, pages 290--304. Springer, 2002.
Matching with Regular Constraints - Kutsia, Marin (2005) Self-citation (Kutsia) (Correct)
No context found.
T. Kutsia. Unification with sequence variables and flexible arity symbols and its extension with pattern-terms. In J. Calmet, B. Benhamou, O. Caprotti, L. Henocque, and V. Sorge, editors, Proc. of Joint AISC'2002---Calculemus'2002 Conference, volume 2385 of LNAI, pages 290--304. Springer, 2002.
Matching with Regular Constraints - Kutsia, Marin (2005) Self-citation (Kutsia) (Correct)
No context found.
T. Kutsia. Unification with sequence variables and flexible arity symbols and its extension with pattern-terms. In J. Calmet, B. Benhamou, O. Caprotti, L. Henocque, and V. Sorge, editors, Proc. of Joint AISC'2002---Calculemus'2002 Conference, volume 2385 of LNAI, pages 290--304. Springer, 2002.
Pattern Unification with Sequence Variables and Flexible Arity.. - Kutsia (2002) Self-citation (Kutsia) (Correct)
No context found.
T. Kutsia. Unification with sequence variables and flexible arity symbols and its extension with pattern-terms. In J. Calmet, B. Benhamou, O. Caprotti, L. Henocque, and V. Sorge, editors, Artificial Intelligence, Automated Reasoning and Symbolic Computation. Proceedings of Joint AICS'2002.
On the Implementation of a Rule-Based Programming System and.. - Marin, Kutsia (2003) (1 citation) Self-citation (Kutsia) (Correct)
No context found.
T. Kutsia. Unification with Sequence Variables and Flexible Arity Symbols and its Extension with Pattern-Terms. In J. Calmet, B. Benhamou, O. Caprotti, L. Henocque, and V. Sorge, editors, editor, Artificial Intelligence, Automated Reasoning and Symbolic Computation. Proceedings of Joint AICS'2002 - Calculemus '2002 Conference, volume 2385 of LNAI, Marseille, France, 2002.
On the Implementation of a Rule-Based Programming System and.. - Marin, Kutsia (2003) (1 citation) Self-citation (Kutsia) (Correct)
No context found.
T. Kutsia. Unification with Sequence Variables and Flexible Arity Symbols and its Extension with Pattern-Terms. In J. Calmet, B. Benhamou, O. Caprotti, L. Henocque, and V. Sorge, editors, editor, Artificial Intelligence, Automated Reasoning and Symbolic Computation. Proceedings of Joint AICS'2002 - Calculemus '2002 Conference, volume 2385 of LNAI, Marseille, France, 2002.
Theorem Proving with Sequence Variables and Flexible Arity Symbols - Kutsia (2002) Self-citation (Kutsia) (Correct)
....for sequence variables. Buchberger ( Buc96] Buc01] proposed to study usage of sequence variables in proving, solving and rewriting context, which, among the other results, lead to development of unification procedure for equational theories with sequence variables and flexible arity symbols ( Kut02c] Kut02a] Kut02b] It was shown that although (general) unification is decidable, its type is infinitary, even for the free theory with sequence variables and flexible arity symbols. It suggests to use Supported by the Austrian Science Foundation (FWF) under Project SFB F1302 and by ....
T. Kutsia. Unification with sequence variables and flexible arity symbols and its extension with pattern-terms. In Artificial Intelligence, Automated Reasoning and Symbolic Computation. Proceedings of Joint AICS'2002 -- Calculemus'2002 conference, volume 2385 of Lecture Notes in Artificial Intelligence, Marseille, France, 1--5 July 2002. Springer Verlag.
CLP(Flex): Constraint Logic Programming Applied to XML.. - Coelho, Florido (2004) (Correct)
No context found.
T. Kutsia. Unification with sequence variables and flexible arity symbols and its extension with pattern-terms. In Artificial Intelligence, Automated Reasoning and Symbolic Computation. Proceedings of Joint AICS'2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC