On restrictions of ordered paramodulation with simplification
CADE-10 Proceedings of the tenth international conference on Automated deduction
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
Basic superposition is complete
ESOP'92 Symposium proceedings on 4th European symposium on programming
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
Term rewriting and all that
The Mathematica book (4th edition)
The Mathematica book (4th edition)
The TH ∃ OREM ∀ project: a progress report
Symbolic computation and automated reasoning
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
Theorem Proving modulo Associativity
CSL '95 Selected Papers from the9th International Workshop on Computer Science Logic
Unification with Sequence Variables and Flexible Arity Symbols and Its Extension with Pattern-Terms
AISC '02/Calculemus '02 Proceedings of the Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation
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
Unification with Sequence Variables and Flexible Arity Symbols and Its Extension with Pattern-Terms
AISC '02/Calculemus '02 Proceedings of the Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation
Journal of Symbolic Computation
Reasoning support for expressive ontology languages using a theorem prover
FoIKS'06 Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems
| Hi-index | 0.00 |
An ordering for terms with sequence variables and flexible arity symbols is presented. The ordering coincides with the lexicographic extension of multiset path ordering on terms without sequence variables. It is shown that the classical strict superposition calculus with ordering and equality constraints can be used as a refutationally complete proving method for well-constrained sets of clauses with sequence variables and flexible arity symbols.