This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
First-Order Logic Characterization of Program Properties
August 1994 (vol. 6 no. 4)
pp. 518-533

A program is first-order reducible (FO-reducible) w.r.t. a set IC of integrity constraints if there exists a first-order theory T such that the set of models for T is exactly the set of intended models for the program w.r.t. all possible EDBs. In this case, we say that P is FO-reducible to T w.r.t. IC. For FO-reducible programs, it is possible to characterize, using first-order logic implications, properties of programs that are related to all possible EDBs as in the database context. These properties include, among others, containment of programs, independence of updates w.r.t. queries and integrity constraints, and characterization and implication of integrity constraints in programs, all of which have no known proof procedures. Therefore, many important problems formalized in a nonstandard logic can be dealt with by using the rich reservoir of first-order theorem-proving tools, provided that the program is FO-reducible. The following classes of programs are shown to be FO-reducible: (1) a stratified acyclic program P is FO-reducible to comp(P)/spl cup/IC w.r.t. IC for any set IC of constraints; (2) a general chained program P is FO-reducible to comp(P')/spl cup/IC w.r.t. certain acyclicity constraints IC; and (3) a bounded program P is FO-reducible to comp(P')/spl cup/IC w.r.t. any set IC of constraints, where P' is a nonrecursive program equivalent to P. Some heuristics for constructing FO-reducible programs are described.

[1] K. R. Apt and M. Bezem, "Acyclic programs," inProc. 7th Int. Conf. Logic Programming, 1990, pp. 617-633.
[2] K. Apt, H. Blair, and A. Walker, "Towards a Theory of Declarative Knowledge,"Proc. Workshop Foundations Deductive Databases and Logic Programming, Washington D.C., 1988, pp. 546-629.
[3] S. Abiteboul and R. Hull, "Data functions, datalog and negation," inProc. ACM-SIGMOD Conf., 1988.
[4] A. Aho and J. Ullman, "Universality of data retrieval languages," inProc. 6th ACM Symp: Principles of Programming Languages, San Antonio, TX, Jan. 1979.
[5] J. A. Blakeley, N. Coburn, and P.-A. Larson, "Updating derived relations: Detecting irrelevant and autonomously computable updates," inProc. Very Large Data Bases, 1986, pp. 457-466.
[6] A. Brodsky and Y. Sagiv, "Inference of monotonicity constraints in Datalog programs," inProc. ACM Symp. Principles of Database Syst., 1989, pp. 190-199.
[7] K. L. Clark, "Negation as failure," inLogic and Data Bases, H. Gallaire and J. Minker, Eds. New York: Plenum Press, 1978, pp. 293-322.
[8] L. Cavedon, "Continuity, consistency, and completeness properties for logic programs," inProc. 6th Int. Conf. Logic Programming, 1989, pp. 571-584.
[9] A. K. Chandra and D. Harel, "Horn-clause queries and generalizations,"J. Logic Programming, pp. 1-15, Nov. 1985.
[10] U. S. Chakravarthy, J. Grant, and J. Minker, "Foundations of semantic query optimization for deductive databases," inProc. Int. Workshop Foundations Deductive Databases Logic Programming, J. Minker, Ed., Aug. 1986.
[11] A. K. Chandra and P. M. Merlin, "Implementation of conjunctive queries in relational databases," inProc. 9th ACM SIGACT Symp. Theory of Computing, pp. 77-90.
[12] H. Decker, "Integrity enforcement in deductive databases," inProc. 1st Int. Conf. Expert Database Syst., 1986. pp. 281-295.
[13] C. Elkan, "Independence of logic database queries and updates," inProc. ACM Symp. Principles of Database Syst., 1990, pp. 154-160.
[14] R. Fagin, "Horn clauses and database dependencies,"J. ACM, vol. 29, no. 3, pp. 952-985, Oct. 1982.
[15] M. Gelfond and V. Lifschits, "The stable model semantics for logic programming," inProc. 5th Int. Conf. Symp. Logic Programming, 1989, pp. 1070-1080.
[16] H. Gallaire and J. Minker,Logic and Data Bases. New York: Plenum, 1978.
[17] A. Van Gelder, "The well-founded semantics for general logic programs,"J. ACM, vol. 38, pp. 620-650, 1991.
[18] I. Guessarian, "Deciding boundedness for uniformly connected Datalog programs," Int. Conf. Database Theory,Lecture Notes in Computer Science, 470, pp. 395-405, 1990.
[19] P. Kanellakis and S. Abiteboul, "Deciding bounded recursion in database logic programs,"SIGACT News, vol. 20, pp. 17-23, 1989.
[20] A. Klug and R. Price, "Determining view dependencies using tableaux,"ACM Trans. Database Syst., vol. 7, no. 3, pp. 361-380, Sept. 1982.
[21] J. W. Lloyd,Foundations of Logic Programming, New York: Springer, 1984.
[22] L. W. Lloyd, E. A. Sonenberg, and R. W. Topor, "Integrity constraint checking in stratified database,"J. Logic Programming, vol. 4, pp. 331-343, 1987.
[23] J. McCarthy, "Circumscription-a form of nonmonotonic reasoning,"Artificial Intell., vol. 13, nos. 1-2, pp. 27-39, 1980.
[24] M. J. Maher, "Equivalence of logic programs," inFoundations of Deductive Databases and Logic Programming, J. Minker, Ed. Los Altos, CA: Morgan Kaufmann, 1988, pp. 243-274.
[25] E. Mendelson,Introduction to Mathematical Logic, 3rd ed. Monterey, CA: Wadsworth&Brooks/Cole Advanced Books&Software, 1987.
[26] J. M. Nicolas, "Logic for improving integrity checking in relational databases,"Acta Informatica, vol. 18, no. 3, pp. 227-253, 19XX.
[27] J. F. Naughton, "Data independent recursion in deductive databases,"J. Comput. Syst. Sci., vol. 39, pp. 256-289, 1989.
[28] J. F. Naughton and Y. Sagiv, "A decidable class of bounded recursions," inProc. 6th ACM Symp. Principles of Database Syst.(San Diego, CA), Mar. 1987, pp. 214-226.
[29] T. Przymusinski, "On the semantics of stratified deductive databases and logic programs," inFoundations of Deductive Databases and Logic Programming, J. Minker, Ed. Los Altos, CA: Morgan-Kaufman, 1987.
[30] J. A. Robinson, "A machine oriented logic based on the resolution principle,"J. ACM, vol. 18, pp. 636-646, 19XX.
[31] K. A. Ross, "Modular acyclicity and tail recursion in logic programs," inProc. ACM Symp. Principles of Database Syst.1991, pp. 92-101.
[32] Y. Sagiv, "Optimizing Datalog program." inFoundations of Deductive Databases and Logic Programming, J. Minker, Ed. Los Altos, CA: Morgan Kaufmann, 1988, pp. 659-698.
[33] J. C. Shepherdson, "Negation in logic programming," inProc. Foundations of Deductive Databases and Logic Program. (Washington, DC), 1986, J. Minker, Ed.
[34] O. Shmueli, "Decidability and expressiveness aspects of logic queries," inProc. ACM SIGACT-SIGMOD Symp. Principles Database Systems, 1987, pp. 237-249.
[35] Y. Sagiv and M. Yannakakis, "Equivalences among relational expressions with the union and difference operators,"J. ACM, vol. 27, pp. 633-655, 1980.
[36] R. W. Topor and E. A. Sonenberg, "On domain independent databases." inFoundations of Deductive Databases and Logic Programming. J. Minker, Ed. Los Altos, CA: Morgan Kaufmann, 1988, pp. 217-240.
[37] J. D. Ullman,Database and Knowledge-base Systems. Rockville, MD: Computer Science Press, 1988.
[38] M. Y. Vardi, "Decidability and undecidability results for boundedness of linear recursive queries," inProc. ACM Symp. Principles of Database Syst., 1988, pp. 341-350.

Index Terms:
eductive databases; query processing; formal logic; logic programming; database theory; programming theory; first-order logic; program properties; order reducible; first-order theory; FO-reducible programs; EDBs; database context; integrity constraints; theorem-proving tools; stratified acyclic program; general chained program; bounded program; nonrecursive program; deductive databases; fixed points; logic programs; perfect models; query answering; updates; extensional database; inference rules
Citation:
K. Wang, L.Y. Yuan, "First-Order Logic Characterization of Program Properties," IEEE Transactions on Knowledge and Data Engineering, vol. 6, no. 4, pp. 518-533, Aug. 1994, doi:10.1109/69.298170
Usage of this product signifies your acceptance of the Terms of Use.