Loop elimination, a sound optimisation technique for PTTP related theorem proving
In this paper we present loop elimination, an important optimisation technique for first-order theorem proving based on Prolog technology, such as the Prolog Technology Theorem Prover or the DLog Description Logic Reasoner. Although several loop checking techniques exist for logic programs, to the b...
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
2012
|
| Sorozat: | Acta cybernetica
20 No. 3 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Tárgyszavak: | |
| doi: | 10.14232/actacyb.20.3.2012.5 |
| Online Access: | http://acta.bibl.u-szeged.hu/30840 |
| Tartalmi kivonat: | In this paper we present loop elimination, an important optimisation technique for first-order theorem proving based on Prolog technology, such as the Prolog Technology Theorem Prover or the DLog Description Logic Reasoner. Although several loop checking techniques exist for logic programs, to the best of our knowledge, we are the first to examine the interaction of loop checking with ancestor resolution. Our main contribution is a rigorous proof of the soundness of loop elimination. |
|---|---|
| Terjedelem/Fizikai jellemzők: | 441-458 |
| ISSN: | 0324-721X |