TY - GEN
T1 - Labelled clauses
AU - Lev-Ami, Tal
AU - Weidenbach, Christoph
AU - Reps, Thomas
AU - Sagiv, Mooly
PY - 2007
Y1 - 2007
N2 - We add labels to first-order clauses to simultaneously apply superpositions to several proof obligations inside one clause set. From a theoretical perspective, the approach unifies a variety of deduction modes. These include different strategies such as set of support, as well as explicit case analysis, e.g., splitting. From a practical perspective, labelled clauses offer advantages in the case of related proof obligations resulting from multiple conjectures over the same axiom set or from a single conjecture that is a large conjunction. Here we can share clauses (e.g., the axioms and clauses deduced from them, share Skolem symbols), share deduced clause variants, and transfer lemmas between the different obligations. Motivated by software verification, we have created a prototype implementation of labelled clauses that supports multiple conjectures, and we provide convincing experiments for the benefits.
AB - We add labels to first-order clauses to simultaneously apply superpositions to several proof obligations inside one clause set. From a theoretical perspective, the approach unifies a variety of deduction modes. These include different strategies such as set of support, as well as explicit case analysis, e.g., splitting. From a practical perspective, labelled clauses offer advantages in the case of related proof obligations resulting from multiple conjectures over the same axiom set or from a single conjecture that is a large conjunction. Here we can share clauses (e.g., the axioms and clauses deduced from them, share Skolem symbols), share deduced clause variants, and transfer lemmas between the different obligations. Motivated by software verification, we have created a prototype implementation of labelled clauses that supports multiple conjectures, and we provide convincing experiments for the benefits.
UR - https://www.scopus.com/pages/publications/35048901992
U2 - 10.1007/978-3-540-73595-3_21
DO - 10.1007/978-3-540-73595-3_21
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:35048901992
SN - 3540735941
SN - 9783540735946
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 311
EP - 327
BT - Automated Deduction - CADE-21 - 21st International Conference on Automated Deduction, Proceedings
PB - Springer Verlag
T2 - 21st International Conference on Automated Deduction, CADE-21 2007
Y2 - 17 July 2007 through 20 July 2007
ER -