Splitting Without Backtracking

Splitting Without Backtracking (2001)

by Re Riazanov , Alexandre Riazanov , Andrei Voronkov , Andrei Voronkov

Citations:

32 - 1 self

Datum	Value	Source
TITLE	Preprint Series CSPP-10 Splitting Without Backtracking	SVM HeaderParse 0.1
AUTHOR NAME	Re Riazanov	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Computer Science; University of Manchester	SVM HeaderParse 0.2
AUTHOR NAME	Andrei Voronkov	SVM HeaderParse 0.1
AUTHOR AFFIL	Recent preprints issued by the Department of Computer Science, Manchester University	SVM HeaderParse 0.2
AUTHOR NAME	Alexandre Riazanov	SVM HeaderParse 0.1
AUTHOR AFFIL	Recent preprints issued by the Department of Computer Science, Manchester University	SVM HeaderParse 0.2
AUTHOR NAME	Andrei Voronkov	SVM HeaderParse 0.1
AUTHOR AFFIL	Recent preprints issued by the Department of Computer Science, Manchester University	SVM HeaderParse 0.2
ABSTRACT	Integrating the splitting rule into a saturation-based theorem prover may be highly bene cial for solving certain classes of rst-order problems. The use of splitting in the context of saturation-based theorem proving based on explicit case analysis (as implemented in SPASS) employs backtracking which is dicult to implement as it aects design of the whole system. Here we present a \cheap " and ecient technique for implementing splitting that does not use backtracking.	SVM HeaderParse 0.1
CITATIONS	7 found	ParsCit 1.0