
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Jia Liang Han, "Program Partition and Logic Program Analysis," IEEE Transactions on Software Engineering, vol. 21, no. 12, pp. 959968, December, 1995.  
BibTex  x  
@article{ 10.1109/32.489072, author = {Jia Liang Han}, title = {Program Partition and Logic Program Analysis}, journal ={IEEE Transactions on Software Engineering}, volume = {21}, number = {12}, issn = {00985589}, year = {1995}, pages = {959968}, doi = {http://doi.ieeecomputersociety.org/10.1109/32.489072}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Software Engineering TI  Program Partition and Logic Program Analysis IS  12 SN  00985589 SP959 EP968 EPD  959968 A1  Jia Liang Han, PY  1995 KW  Declarative programming KW  program partitions KW  semantic analysis KW  logic programming KW  query optimization KW  deductive databases KW  program verifications. VL  21 JA  IEEE Transactions on Software Engineering ER   
[1] A. Aho, J. Hopcroft, and J. Ullman, Data Structures and Algorithms.Reading, Mass: AddisonWesley, 1983.
[2] A.V. Aho,M.R. Garey,, and J.D. Ullman,“The transitive reduction of a directed graph,” SIAM J. Comput. vol. 1, no. 2, pp. 131137, 1972.
[3] H. AïtKaci,Warren’s Abstract Machine, A Tutorial Reconstruction, MIT Press, Series on Logic Programming, Cambridge, Mass., 1991.
[4] K. Apt, "Logic Programming," Handbook of Theoretical Computer Science, vol. B, J. van Leeuven, ed., pp. 493574.Cambridge, Mass.: MIT Press, 1990.
[5] K. Apt, H.A. Blair, and A. Walker, "Towards a Theory of Declarative Knowledge," Foundations of Deductive Databases and Logic Programming, J. Minker, ed., pp. 89148. Morgan Kaufmann, 1988.
[6] F. Bancilhon, D. Maier, Y. Sagiv, and J.D. Ullman, "Magic Sets and Other Strange Ways to Implement Logic Programs," Proc. Fifth ACM PODS Symp. Principles of Database Systems, pp. 115, 1986.
[7] J.L. Han,“Preventing infinite looping in Prolog,” Proc. IEEE Int’l Conf. on Tools for Artificial Intelligence,San Jose, Calif., pp. 524525, Nov. 1991.
[8] J.L. Han,“On constraints in recursive rules,” in preparation. A preliminary report, B. Srinivasan and J. Zeleznikow, eds., “Handling constants and/or repeated variables in linear recursive programs,” Research and Practical Issues in Databases.Singapore: World Scientific, pp. 113123, Feb. 1992.
[9] J.L. Han,“On optimizing uniformly bounded datalog program,” Advances in Database Research, M. Orlowska and M. Papazoglou, eds., Singapore: World Scientific, pp. 250261, Feb. 1993.
[10] J.L. Han,“On termination of single rule recursions in Prolog,” Faculty of Sciences Working Paper Series, ScMC9301, Univ. ofSouthern Queensland, Australia, Feb. 1993. An abstract appeared in [7].
[11] J.L. Han and S.S. Chen,“Graphic representation of linear recursive rules,” Int’l J. of Intelligent Systems, vol. 7, no. 4, pp. 317337, 1992.
[12] Y.E. Ioannidis,“A time bound on the materialization of some recursively defined views,” Algorithmica, vol. 1, no. 4, pp. 361385, 1986. Also in Proc. 11th Int’l Conf. on Very Large Data Bases,Stockholm, Sweden, pp. 219226, Aug. 1985.
[13] D.B. Kemp,K. Ramamohanarao,, and Z. Somogyi,“Right, left, and multilinear rule transformations that maintain context information,” Proc. of the 16th Int’l Conf. on Very Large Data Bases,Brisbane, Australia, pp. 380391, 1990.
[14] M. Kifer, G. Lausen, and J. Wu, "Logical Foundations of ObjectOriented and FrameBased Languages," J. ACM, vol. 42, pp. 741843, 1995.
[15] J.W. Lloyd, Foundations of Logic Programming, Springer Series in Symbolic Computation, second ed. New York: SpringerVerlag, 1987.
[16] I.S. Mumick and H. Pirahesh,“Overbound and rightlinear queries,” Proc. 10th ACM SIGACTSIGMODSIGART Symp. on Principles of Database Systems, pp. 127141, 1991.
[17] J. Naughton, R. Ramakrisnhan, Y. Sagiv, and J.F. Ullman, “Efficient Evaluation of Right, Left, and MultiLinear Rules,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 235242, 1989.
[18] Y. Sagiv,“Is there anything better than magic?” Proc. North Am. Conf. on Logic Programming,Cambridge Mass.: MIT Press, pp. 235254, 1990.
[19] R.E. Tarjan,“Depth first search and linear graph algorithms,” SIAM J. Computing, vol. 1, no. 2, pp. 146160, 1972.
[20] J. Ullman, Principles of Database and KnowledgeBase Systems, vol. 1. Computer Science Press, 1988.
[21] J.D. Ullman, Principles of Database and KnowledgeBase Systems, vol. II: The New Tech nologies. New York: Computer Science Press, 1989.
[22] M.H. van Emden and R.A. Kowalski, “The Semantics of Predicate Logic as a Programming Language,” J. ACM, vol. 23, no. 4, pp. 733742, Oct. 1976.
[23] A. van Gelder,K. Ross, and J.S. Schlipf,"The wellfounded semantics for general logic programs," J. ACM, vol. 38, no. 3, pp. 620650, July 1991.
[24] D.H.D. Warren,An Abstract Prolog Instruction Set, Technical Note 309, SRI International, Menlo Park, Calif., Oct. 1983.