Journal of Symbolic Computation
Minimal and complete word unification
Journal of the ACM (JACM)
Communications of the ACM
Pattern matching by Rs-operations: towards a unified approach to querying sequenced data
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Word unification and transformation of generalized equations
Journal of Automated Reasoning
Reasoning about strings in databases
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Theorem proving with ordering and equality constrained clauses
Journal of Symbolic Computation
Sequences, Datalog and transducers
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The Ontolingua Server: a tool for collaborative ontology construction
International Journal of Human-Computer Studies - Special issue: innovative applications of the World Wide Web
The Mathematica book (4th edition)
The Mathematica book (4th edition)
The TH ∃ OREM ∀ project: a progress report
Symbolic computation and automated reasoning
String operations in query languages
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Theorem Proving with Sequence Variables and Flexible Arity Symbols
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Groebner Bases for Non-Commutative Polynomial Rings
AAECC-3 Proceedings of the 3rd International Conference on Algebraic Algorithms and Error-Correcting Codes
IWWERT '90 Proceedings of the First International Workshop on Word Equations and Related Topics
Theorem Proving modulo Associativity
CSL '95 Selected Papers from the9th International Workshop on Computer Science Logic
How to Make SQL Stand for String Query Language
DBPL '99 Revised Papers from the 7th International Workshop on Database Programming Languages: Research Issues in Structured and Semistructured Database Programming
Theorem Proving with Sequence Variables and Flexible Arity Symbols
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Solving equations with sequence variables and sequence functions
Journal of Symbolic Computation
XCentric: logic programming for XML processing
Proceedings of the 9th annual ACM international workshop on Web information and data management
On the relation between Context and Sequence Unification
Journal of Symbolic Computation
Connecting Logical Representations and Efficient Computations
Electronic Notes in Theoretical Computer Science (ENTCS)
Context Sequence Matching for XML
Electronic Notes in Theoretical Computer Science (ENTCS)
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Sequence unification through currying
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Sequence disunification and its application in collaborative schema construction
WISE'07 Proceedings of the 2007 international conference on Web information systems engineering
Matching with regular constraints
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
VeriFLog: a constraint logic programming approach to verification of website content
APWeb'06 Proceedings of the 2006 international conference on Advanced Web and Network Technologies, and Applications
| Hi-index | 0.01 |
A minimal and complete unification procedure for a theory with individual and sequence variables, free constants and free fixed and flexible arity function symbols is described and a brief overview of an extension with pattern-terms is given.