Enumeration of success patterns in logic programs
We have proposed the concept of item set for a Prolog program. It is inspired by the item set construction in parsing theories. Difficulties due to the exsistence of variables are overcome by the term-depth abstraction technique which reduces an in finite set of items to the finite one.
Since our technique relies on the item set construction combined with term-depth abstraction, another kind of term abstraction, instead of term-depth abstraciton, would bring forth the new kind of item set construction. For example, looking at a term from data type point of view would produce an item set which contains information about data types of arguments in a clause. Such is an area of future research.
Unable to display preview. Download preview PDF.
- [Aho 77]Aho,A.V. and Ullman,J.D.:“Principles of Compiler Design”, Addison-Wesley, 1977.Google Scholar
- [Chang 73]Chang,C.C. and Lee,R.C.T.:“Symbolic Logic and Mechanical Theorem Proving”, Academic Press, New York, 1973.Google Scholar
- [Colmerauer 78]Colmerauer, A.: “Metamorphosis grammars”, Lec. note in Comp. Sci. No. 63, Springer Verlag, 1978.Google Scholar
- [Gallaire 78]Gallaire,H. and Minker, J.(eds): “Logic and Data Bases”, Plenum Press, New York, 1978.Google Scholar
- [Kowalski 71]Kowalski,R.A.:“Predicate logic as programming language”, Proc. IFIP-74 Congress, 1974.Google Scholar
- [Tamaki 82]Tamaki,H. and Sato,T.:“A Transformation System for Logic Programs which preserves equivalence”, in preparation.Google Scholar
- [Warren 79]Warren,D., Pereira,L.M. and Pereira,F.: “User's Guide to DEC system-10 Prolog”, occasional paper 15, Dep. of AI, Edinburgh Univ., 1979.Google Scholar