| Abstract | .... 2 | |
| 1 | Introduction | .... 3 |
| 2 | Preminaries | .... 3 |
| 2.1 | Proof Tree of Ground Goals | .... 4 |
| 2.2 | Terminating Atom | .... 4 |
| 2.3 | Goal | .... 5 |
| 2.4 | Definite Formula | .... 6 |
| 2.5 | Manipulation Goals | .... 7 |
| 3 | Unfold/Fold Construction of Logic Programs | .... 8 |
| 3.1 | Construction Process | .... 8 |
| 3.2 | Basic Construction Rules | .... 9 |
| 3.3 | Equivalence Preservation Theorem | .... 10 |
| 4 | Preservation of Minimum Herbrand Models | .... 11 |
| 4.1 | Semantics of Definite Formula Programs | .... 11 |
| 4.2 | A Well-Founded Ordering on Ground Goal Sets | .... 14 |
| 4.3 | Rank and Rank Ordering of Ground Goals | .... 15 |
| 4.4 | Rank-Consistent Proof | .... 15 |
| 4.5 | Proof of the Equivaience Preservation Theorem | .... 16 |
| 5 | Spilitting Rules | .... 18 |
| 5.1 | Positive Spilitting | .... 18 |
| 5.2 | Negative Spilitting | .... 19 |
| 5.3 | Safety of the Spilitting Rules | .... 19 |
| 6 | Discussion | .... 20 |
| 7 | Conclusion | .... 22 |
| Acknowledgements | .... 22 | |
| References | .... 22 | |
| End | .... 23 |
ICOT研究論文(TR)一覧に戻る / Back to the list of ICOT Technical Reports