Carregant...
Carregant...

Vés al contingut (premeu Retorn)

On the completeness of arbitrary selection strategies for paramodulation

Autor
Bofill, M.; Godoy, G.
Tipus d'activitat
Article en revista
Revista
Lecture notes in computer science
Data de publicació
2001-07
Volum
2076
Pàgina inicial
951
Pàgina final
962
URL
http://www.springer.com/us/book/9783540422877 Obrir en finestra nova
Resum
A crucial way for reducing the search space in automated deduction are the so-called selection strategies: in each clause, the subset of selected literals are the only ones involved in inferences. For first-order Horn clauses without equality, resolution is complete with an arbitrary selection of one single literal in each clause [dN96]. For Horn clauses with built-in equality, i.e., paramodulation-based inference systems, the situation is far more complex. Here we show that if a paramodulation-...
Grup de recerca
ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals

Participants