This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Nondeterministic, Nonmonotonic Logic Databases
September/October 2001 (vol. 13 no. 5)
pp. 813-823

Abstract—We consider in this paper an extension of Datalog with mechanisms for temporal, nonmonotonic, and nondeterministic reasoning, which we refer to as Datalog++. We show, by means of examples, its flexibility in expressing queries concerning aggregates and data cube. Also, we show how iterated fixpoint and stable model semantics can be combined to the purpose of clarifying the semantics of Datalog++ programs and supporting their efficient execution. Finally, we provide a more concrete implementation strategy on which basis the design of optimization techniques tailored for Datalog++ is addressed.

[1] 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. 89-148. Morgan Kaufmann, 1988.
[2] N. Arni, K. Ong, S. Tsur, and C. Zaniolo, “$\cal LDL$++: A Second Generation Deductive Databases Systems,” technical report, MCC Co., 1993.
[3] F. Bonchi, F. Giannotti, G. Mainetto, and D. Pedreschi, “A Classification-Based Methodology for Planning Audit Strategies in Fraud Detection,” Proc. Fifth ACM-SIGKDD Int'l Conf. Knowledge Discovery&Data Mining (KDD'99), pp. 175-184, Aug. 1999.
[4] A. Brogi, V.S. Subrahmanian, and C. Zaniolo, “The Logic of Totally and Partially Ordered Plans: A Deductive Database Approach,” Annals Math. in Artificial Intelligence, vol. 19, pp. 59-96, 1997.
[5] J. Chomicki, “Temporal Deductive Databases,” Temporal Databases: Theory, Design and Implementation, A. Tansel, J. Clifford, S. Gadia, S. Jajodia, A. Segev, and R. Snodgrass, eds., pp. 294-320, 1993.
[6] M. Gelfond and V. Lifschitz, “The Stable Model Semantics for Logic Programming,” Proc. Fifth Int'l Conf. Logic Programming, pp. 1070-1080, 1988.
[7] F. Giannotti, S. Greco, D. Saccà, and C. Zaniolo, “Programming with Non Determinism in Deductive Databases,” Annals Math. in Artificial Intelligence, vol. 19, pp. 97-125, 1997.
[8] F. Giannotti, G. Manco, M. Nanni, and D. Pedreschi, “Datalog++: A Basis for Active Object-Oriented Databases,” Proc. DOOD '97, Fifth Int'l Conf. Deductive and Object-Oriented Databases, pp. 283-301, 1997.
[9] F. Giannotti, G. Manco, M. Nanni, and D. Pedreschi, “Query Answering in Non Deterministic Non Monotonic Logic Databases,” Proc. Conf. Flexible Query-Answering Systems (FQAS '98), T. Andreasen, H. Christiansen, and H. Larsen, eds., 1998.
[10] F. Giannotti, G. Manco, and D. Pedreschi, “A Deductive Data Model for Representing and Querying Semistructured Data,” Proc. Second Int'l Workshop Logic Programming Tools for Internet Applications, July 1997.
[11] F. Giannotti, G. Manco, D. Pedreschi, and F. Turini, “Experiences with a Logic-Based Knowledge Discovery Support Environment,” Proc. 1999 ACM SIGMOD Workshop Research Issues in Data Mining and Knowledge Discovery (SIGMOD '99 DMKD), 1999.
[12] F. Giannotti, D. Pedreschi, D. Saccà, and C. Zaniolo, “Non-Determinism in Deductive Databases,” Proc. Second Int'l Conf. Deductive and Object-Oriented Databases (DOOD '91), pp. 129-146, 1991.
[13] F. Giannotti, D. Pedreschi, and C. Zaniolo, “Semantics and Expressive Power of Non Deterministic Constructs for Deductive Databases,” J. Computer and Systems Sciences, 1999.
[14] F. Giannotti, G. Manco, M. Nanni, and D. Pedreschi, “On the Effective Semantics of Temporal, Non-Monotonic, Non-Deterministic Logic Languages,” Proc. Int'l Conf. Computer Science Logic (CSL '98), pp. 58-72, Aug. 1998.
[15] F. Giannotti, G. Manco, M. Nanni, D. Pedreschi, and F. Turini, “Integration of Deduction and Induction for Mining Supermarket Sales Data,” Proc. Third Int'l Conf. Practical Applications of Knowledge Discovery and Data Mining (PADD '99), pp. 79-94, Sept. 1999.
[16] D. Kemp, K. Ramamohanarao, and P.J. Stuckey, "ELS-Programs and the Efficient Evaluation of Non-Stratified Programs by Transformation to ELS," Proc. Fourth Int'l Conf. Deductive and Object-Oriented Databases, pp. 91-108, Lecture Notes in Computer Science No. 1013, Dec. 1995.
[17] R. Krishnamurthy and S. Naqvi, “Non-Deterministic Choice in Datalog,” Proc. Third Int'l Conf. Data and Knowledge Bases, pp. 416-424, 1988.
[18] B. Lüdascher, U. Hamann, and G. Lausen, “A Logical Framework for Active Rules” Proc. Seventh COMAD Int'l Conf. Management of Data, 1995.
[19] M. Nanni, “Nondeterminism and XY-Stratification in Deductive Databases (in Italian),” master's thesis, Dept. of Computer Science, Univ. of Pisa, 1997.
[20] S. Naqvi and S. Tsur, A Logical Language for Data and Knowledge Bases.New York: Computer Science Press, 1989.
[21] T.C. Przymusinski, "Every Logic Program has a Natural Stratification and an Iterated Least Fixed Point Model," ACM SIGACT-SIGMOD-SIGART Symp. Principles of Database Systems, pp. 11-21, 1989.
[22] K.A. Ross, “Modular Stratification and Magic Sets for Datalog Programs with Negation,” J. ACM, vol. 41, no. 6, pp. 1216-1266, 1994.
[23] D. Saccà and C. Zaniolo, "Stable Models and Non-determinism for Logic Programs with Negation," ACM SIGACT-SIGMOD-SIGART Symp. Principles of Database Systems, pp. 205-217, 1990.
[24] J. Ullman, Principles of Database and Knowledge-Base Systems, vol. 1. Computer Science Press, 1988.
[25] C. Zaniolo, “Active Database Rules with Transaction-Conscious Stable-Model Semantics” Proc. Fourth Int'l Conf. Deductive and Object-Oriented Databases, (DOOD '95), pp. 55-72, 1995.
[26] C. Zaniolo, N. Arni, and K. Ong, “Negation and Aggregates in Recursive Rules: The$\cal LDL+\!+$Approach,” Proc. Third Int'l Conf. Deductive and Object-Oriented Databases (DOOD '93), 1993.
[27] C. Zaniolo, S. Ceri, C. Faloutsos, R.T. Snodgrass, V.S. Subrahmanian, and R. Zicari, Advanced Database Systems. Morgan Kaufmann Publishers, 1997.

Index Terms:
Logic programming, databases, negation, nondeterminism, stable models.
Citation:
Fosca Giannotti, Giuseppe Manco, Mirco Nanni, Dino Pedreschi, "Nondeterministic, Nonmonotonic Logic Databases," IEEE Transactions on Knowledge and Data Engineering, vol. 13, no. 5, pp. 813-823, Sept.-Oct. 2001, doi:10.1109/69.956102
Usage of this product signifies your acceptance of the Terms of Use.