Saved in:
Bibliographic Details
Main Author: Kim, Dohan
Format: Preprint
Published: 2023
Subjects:
Online Access:https://arxiv.org/abs/2303.13257
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866916648651325440
author Kim, Dohan
author_facet Kim, Dohan
contents Although reasoning about equations over strings has been extensively studied for several decades, little research has been done for equational reasoning on general clauses over strings. This paper introduces a new superposition calculus with strings and present an equational theorem proving framework for clauses over strings. It provides a saturation procedure for clauses over strings and show that the proposed superposition calculus with contraction rules is refutationally complete. This paper also presents a new decision procedure for word problems over strings w.r.t. a set of conditional equations R over strings if R can be finitely saturated under the proposed inference system.
format Preprint
id arxiv_https___arxiv_org_abs_2303_13257
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Equational Theorem Proving for Clauses over Strings
Kim, Dohan
Logic in Computer Science
Although reasoning about equations over strings has been extensively studied for several decades, little research has been done for equational reasoning on general clauses over strings. This paper introduces a new superposition calculus with strings and present an equational theorem proving framework for clauses over strings. It provides a saturation procedure for clauses over strings and show that the proposed superposition calculus with contraction rules is refutationally complete. This paper also presents a new decision procedure for word problems over strings w.r.t. a set of conditional equations R over strings if R can be finitely saturated under the proposed inference system.
title Equational Theorem Proving for Clauses over Strings
topic Logic in Computer Science
url https://arxiv.org/abs/2303.13257