Browse > Article

An Efficient Execution of Non-Horn Logic Programs  

Shin, Dong-Ha (상명대학교 소프트웨어공학부)
Baek, Ynn-Cheol (상명대학교 소프트웨어공학부)
Publication Information
Journal of the Korea Institute of Information and Communication Engineering / v.9, no.4, 2005 , pp. 816-823 More about this Journal
Abstract
Non-Horn logic programs are extended from Horn logic programs to the level of 1st order predicate logic. Even though they are more expressive than Horn logic programs, They are not practically used because we do not have efficient implementations. Currently to execute non-Horn logic programs, we translate them to equivalent Horn logic programs using the proof procedure InH-Prolog and compile the Horn logic programs to WAM(Warren Abstract Machine) instructions. In this paper, we propose EWAM(Extended Warren Machine) that executes non-Horn logic programs more efficiently and a compilation scheme that compiles non-Horn logic programs to the EWAM instruction. We implement an EWAM emulator and a compiler and measured the performance of the EWAM emulator and the compiler and found that they are very efficient.
Keywords
non-Horn; Horn; proof procedure; WAM;
Citations & Related Records
연도 인용수 순위
  • Reference
1 H. Ait-Kaci, Warren's Abstract Machine A Tutorial Reconstruction, The MIT Press, Cambridge, MA, 1991
2 D. W. Loveland, Near-Hom Prolog and Beyond, Journal of Automated Reasoning, 7: 1-26, Klwer Academic Publishers, 1991
3 D. W. Reed and D. W. Loveland, Near-Horn Prolog and the Ancestry Family of Proof Procedures, Annals of Mathematics and Artificial Intelligence, 14, 1995
4 B. T. Smith and D. W. Loveland, A Simple near-Horn Prolog Interpreter, Technical Report CS-1988-21, Department of Computer Science, Duke University, 1988
5 신동하, 조상계열 증명 절차를 이용한 비혼 논리 프로그램의 컴파일 방법, 정보과학회논문지(B), 제26권, 제7호, 한국정보과학회, 1999
6 J. Minker and A. Rajasekar, Procedural Interpretation of Non-Horn Logic Programs, Proceedings of the 9th International Conference on Automated Deduction, 278-293, 1988
7 D. W. Loveland and D. W. Reed, A near-Horn Prolog for Compilation, Technical Report CS-1989-14, Department of Computer Science, Duke University, 1989
8 신동하, 비혼 논리 프로그램을 위한 증명 절차, 자연과학연구, 제5호, 상명대학교 자연과학연구소, 1998
9 J. bevemyr, The luther WAM Emulator, Technical Report 72, Department of Computer Science, Uppsala University, 1992
10 D. W. Reed, D. W. Loveland and B. T. Smith, The near-Hom Approach to Disjunctive Logic Programming, Technical Report CS-1992-19, Department of Computer Science, Duke University, 1992
11 W. F. Clocksin and C. S. Mellish, Programming in Prolog, Fourth Edition, Springer-Verlag, Berlin, 1994
12 J. W. Lloyd, Foundations of Logic Programming, Second, Extended Edition, Springer-Verlag, Berlin, 1987
13 D. H. D. Warren, An Abstract Prolog Instruction Set, Technical Note 309, SRI International, October 1983
14 J. Lobo, J. Minker, and A. Rajasekar, Foundations of Disjunctive Logic Programming, The MIT Press, Cambridge, MA, 1992
15 J. Minker and A. Rajasekar, A Fixpoint Semantics for Disjunctive Logic Programs, The Journal of Logic Programming, Vol. 9, 45-74, Elsevier Science Publishing Co., Inc., New York,1990   DOI   ScienceOn
16 SICS, SICStus Prolog V3 User's Manual, 1995
17 D. A. Plaisted, Non-Horn Gause Logic Programming Without Contrapositives, Journal of Automated Reasoning, 4:287-325, Kluwer Academic Publishers, 1988