Abstract
In this paper we present a method for integrating equational reasoning into instantiation-based theorem proving. The method employs a satisfiability solver for ground equational clauses together with an instance generation process based on an ordered paramodulation type calculus for literals. The completeness of the procedure is proved using the the model generation technique, which allows us to justify redundancy elimination based on appropriate orderings. © Springer-Verlag 2004.
| Original language | English |
|---|---|
| Title of host publication | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci. |
| Publisher | Springer Nature |
| Pages | 71-84 |
| Number of pages | 13 |
| Volume | 3210 |
| Publication status | Published - 2004 |
| Event | Computer Science Logic, 18th International Workshop, CSL 2004, 13th Annual Conference of the EACSL, Karpacz, Poland, September 20-24, 2004, Proceedings - Duration: 1 Jan 1824 → … http://dblp.uni-trier.de/db/conf/csl/csl2004.html#GanzingerK04http://dblp.uni-trier.de/rec/bibtex/conf/csl/GanzingerK04.xmlhttp://dblp.uni-trier.de/rec/bibtex/conf/csl/GanzingerK04 |
Publication series
| Name | Lecture Notes in Computer Science |
|---|
Conference
| Conference | Computer Science Logic, 18th International Workshop, CSL 2004, 13th Annual Conference of the EACSL, Karpacz, Poland, September 20-24, 2004, Proceedings |
|---|---|
| Period | 1/01/24 → … |
| Internet address |