Theorem Proving with Sequence Variables and Flexible Arity Symbols (2002)
| Venue: | LOGIC IN PROGRAMMING, ARTI INTELLIGENCE AND REASONING. INTERNATIONAL CONFERENCE LPAR'02, VOLUME 2514 OF LNAI |
| Citations: | 7 - 4 self |
BibTeX
@INPROCEEDINGS{Kutsia02theoremproving,
author = {Temur Kutsia},
title = {Theorem Proving with Sequence Variables and Flexible Arity Symbols},
booktitle = {LOGIC IN PROGRAMMING, ARTI INTELLIGENCE AND REASONING. INTERNATIONAL CONFERENCE LPAR'02, VOLUME 2514 OF LNAI},
year = {2002},
pages = {278--291},
publisher = {Springer Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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.
