
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Francesco Buccafurri, Nicola Leone, Pasquale Rullo, "Enhancing Disjunctive Datalog by Constraints," IEEE Transactions on Knowledge and Data Engineering, vol. 12, no. 5, pp. 845860, September/October, 2000.  
BibTex  x  
@article{ 10.1109/69.877512, author = {Francesco Buccafurri and Nicola Leone and Pasquale Rullo}, title = {Enhancing Disjunctive Datalog by Constraints}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {12}, number = {5}, issn = {10414347}, year = {2000}, pages = {845860}, doi = {http://doi.ieeecomputersociety.org/10.1109/69.877512}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  Enhancing Disjunctive Datalog by Constraints IS  5 SN  10414347 SP845 EP860 EPD  845860 A1  Francesco Buccafurri, A1  Nicola Leone, A1  Pasquale Rullo, PY  2000 KW  Nonmonotonic reasoning KW  knowledge representation KW  deductive databases KW  disjunctive datalog KW  computational complexity. VL  12 JA  IEEE Transactions on Knowledge and Data Engineering ER   
Abstract—This paper presents an extension of Disjunctive Datalog (
[1] K.R. Apt and R.N. Bol, “Logic Programming and Negation: A Survey,” J. Logic Programming, vols. 19/20, pp. 9–71, 1994.
[2] C. Baral and M. Gelfond, “Logic Programming and Knowledge Representation,” J. Logic Programming, vols. 19/20, pp. 73–148, 1994.
[3] R. BenEliyahu and R. Dechter, “Propositional Semantics for Disjunctive Logic Programs,” Ann. Math. and Artificial Intelligence, vol. 12, pp. 53–87, 1994.
[4] R. BenEliyahu and L. Palopoli, “Reasoning with Minimal Models: Efficient Algorithms and Applications,” Proc. Fourth Int'l Conf. Principles of Knowledge Representation and Reasoning (KR '94), pp. 39–50, 1994.
[5] P.A. Bonatti, M.L. Sapino, and V.S. Subrahmanian, “Merging Heterogeneous Security Orderings,” J. Computer Security, vol. 5, no. 1, pp. 3–29, 1997.
[6] S. Brass and J. Dix, “Disjunctive Semantics Based upon Partial and BottomUp Evaluation,” Proc. 12th Int'l Conf. Logic Programming (ICLP '95), pp. 199–213, 1995.
[7] G. Brewka, Nonmonotonic Reasoning: Logical Foundations of Commonsense, Cambridge Trends in Computer Science 12. Cambridge Univ. Press, 1991.
[8] G. Brewka, “Reasoning about Priorities in Default Logic,” Proc. Am. Assoc. for Artificail Intelligence, vol. 2, pp. 940–945, 1994.
[9] G. Brewka and T. Eiter, “Preferred Answer Sets for Extended Logic Programs,” Proc. Int'l Conf. Principles of Knowledge Representation and Reasoning (KR '98), pp. 86–97, 1998.
[10] F. Buccafurri, N. Leone, and P. Rullo, “Disjunctive Ordered Logics: Semantics and Expressiveness,” Proc. Int'l Conf. Principles of Knowledge Representation and Reasoning (KR '98), pp. 418–429, 1998.
[11] M. Cadoli and M. Schaerf, “A Survey of Complexity Results for NonMonotonic Logics,” J. Logic Programming, vol. 17, pp. 127–160, 1993.
[12] J. Chomicki and V.S. Subrahmanian, “Generalized Closed World Assumption is$\Pi^{0}_{2}{\hbox{}}{\rm{Complete}}$,” Information Processing Letters, vol. 34, pp. 289–291, 1990.
[13] H. Decker and M. Celma, “A Slick Procedure for Integrity Checking in Deductive Databases,” Proc. 12th Int'l Conf. Logic Programming, pp. 456–469, 1994.
[14] T. Eiter, G. Gottlob, and H. Mannila, "Adding Disjunction to Datalog," Proc. 13th ACM SIGACT SIGMODSIGART Symp. Principles of Database Systems (PODS94), pp. 267278, May 1994.
[15] T. Eiter and G. Gottlob, “On the Computational Cost of Disjunctive Logic Programming: Propositional Case,” Ann. Math.ematics and Artificial Intelligence, J.C. Baltzer AG, Science Publishers, vol. 15, pp. 289–323, 1995.
[16] T. Eiter, G. Gottlob, and N. Leone, “Abduction From Logic Programs: Semantics and Complexity,” Theoretical Computer Science—Logic, Semantics and Theory of Programming, vol. 189,nos. 1–2, pp. 129–177, 1997.
[17] T. Eiter and G. Gottlob, "The Complexity of LogicBased Abduction," J. ACM, vol. 42, no. 1, pp. 342, Jan. 1995.
[18] T. Eiter, G. Gottlob, and H. Mannila, “Disjunctive Datalog,” ACM Trans. Database Systems, vol. 22, no. 3, pp. 364418, 1997.
[19] R. Fagin, J.D. Ullman, and M. Vardi, "On the Semantics of Updates in Database," Proc. ACM Symp. Principles Database Systems, pp. 352365.New York: ACM, 1983.
[20] J.A. Fernández, J. Lobo, J. Minker, and V.S. Subrahmanian, “Disjunctive LP + Integrity Constraints = Stable Model Semantics,” Ann. Math. and Artificial Intelligence, vol. 8,nos. 3–4, pp. 449–474, 1993.
[21] J.A. Fernández and J. Minker, “Semantics of Disjunctive Deductive Databases,” Proc. Fourth Int'l Conf. Database Theory, pp. 2150, 1992.
[22] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness.New York: W.H. Freeman, 1979.
[23] M. Gelfond and V. Lifschitz, “Classical Negation in Logic Programs and Disjunctive Databases,” New Generation Computing, vol. 9, pp. 365–385, 1991.
[24] L. Gong and X. Qian, "Computational Issues in Secure Interoperation," IEEE Trans. Software Eng., Jan. 1996, pp. 4352.
[25] G. Gottlob, “Complexity and Expressive Power of Disjunctive Logic Programming,” Proc. Int'l Logic Programming Symp. (ILPS '94), M. Bruynooghe, ed., pp. 23–42, 1994.
[26] M.L. Ginsberg, “Counterfactuals,” Artificial Intelligence, vol. 30, pp. 35–79, 1986.
[27] S. Greco, “Extending Datalog with Choice and Weak Constraints,” Proc. Joint Conf. Declarative Programming (APPIAGULPPRODE '96), pp. 329–340, 1996.
[28] S. Greco and D. Sacc, “${\rm{NP}}$Optimization Problems in Datalog,” Proc. Int'l Logic Programming Symp. (ILPS '97), 1997.
[29] IFIPGI Workshop “Disjunctive Logic Programming and Disjunctive Databases,” Proc. 13th IFIP World Computer Congress, 1994.
[30] J. Kadin, “$P^{NP[O(\log n)]}$and Sparse TuringComplete Sets for$NP$,” J. Computer and System Sciences, vol. 39, pp. 282–298, 1989.
[31] M. Krentel, “The Complexity of Optimization Problems,” J. Computer and System Sciences, vol. 36, pp. 490–509, 1988.
[32] R. Kowalski and F. Sadri, “A TheoremProving Approach to Database Integrity,” Foundations of Deductive Databases and Logic Programming, J. Minker, ed., pp. 313–362, Morgan Kaufman, 1988.
[33] N. Leone, P. Rullo, and F. Scarcello, “Declarative and Fixpoint Characterizations of Disjunctive Stable Models,” Proc. Int'l Logic Programming Symp. (ILPS '95), pp. 399–413, 1995.
[34] N. Leone, P. Rullo, and F. Scarcello, “Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics and Computation,” Information and Computation, vol. 135, no. 2, pp. 69–112, Academic Press, 1997.
[35] V. Lifschitz, “Computing Circumscription,” Proc. Int'l Joint Conf. Artificial Intelligence (IJCAI '85), pp. 121–127, 1985.
[36] V. Lifschitz, “Foundations of Logic Programming,” Principles of Knowledge Representation, CSLI Publications, pp. 69–127, 1996.
[37] J.W. Lloyd, Foundations of Logic Programming. Berlin: Springer, 1984.
[38] J.W. Lloyd, E.A. Sonenberg, and R.W. Topor, “Integrity Constraint Checking in Stratified Databases,” J. Logic Programming, vol. 2, pp. 331–343, 1987.
[39] J. Lobo, J. Minker, and A. Rajasekar, Foundations of Disjunctive Logic Programming. Cambridge, Mass.: MIT Press, 1992.
[40] A. Kakas and P. Mancarella, “Generalized Stable Models: A Semantics for Abduction,” Proc. European Conf. Artificial Intelligence (ECAI '90), pp. 385–391, 1990.
[41] A. Kakas, R. Kowalski, and F. Toni, “Abductive Logic Programming,” J. Logic and Computation, vol. 2, no. 6, pp. 719–771, 1992.
[42] M. Krentel, “Generalizations of OptP to the Polynomial Hierarchy,” Theoretical Computer Science, vol. 97, no. 2, pp. 183–198, 1992.
[43] W. Marek and V.S. Subrahmanian, “The Relationship between Logic Program Semantics and NonMonotonic Reasoning,” Proc. Sixth Int'l Conf. Logic Programming (ICLP '89), pp. 600–617, 1989.
[44] W. Marek and M. Truszczynski, "Autoepistemic Logic," J. ACM, vol. 38, no. 3, pp. 588619, 1991.
[45] J. Minker,“On indefinite databases and the closed world assumption,” Proc. Automated Deduction Conf., pp. 292308, 1982.
[46] C.H. Papadimitriou, Computational Complexity. AddisonWesley, 1994.
[47] Y. Peng and J.A. Reggia, Abductive Inference Models for Diagnostic ProblemSolving, SpringerVerlag, New York, 1990.
[48] C.S. Peirce, “Abduction and Induction,” Philosophical Writings of Peirce, J. Buchler, ed., chapter 11, 1995.
[49] H. Przymusinska and T. Przymusinski, “Weakly Perfect Model Semantics for Logic Programs,” Proc. Fifth Int'l Conf. and Symp. Logic Programming, pp. 1,106–1,120, 1988.
[50] T.C. Przymusinski, "On the Declarative Semantics of Deductive Databases and Logic Programs," J. Minker, ed., Foundations of Deductive Databases and Logic Programming, pp. 193216. Morgan Kaufmann, 1988.
[51] T. Przymusinski, “Stable Semantics for Disjunctive Programs,” New Generation Computing, vol. 9, pp. 401–424, 1991.
[52] T. Przymusinski, “Static Semantics for Normal and Disjunctive Logic Programs,” Ann. Mathematics and Artificial Intelligence, J.C. Baltzer AG, Science Publishers, vol. 14, pp. 323–357, 1995.
[53] K.A. Ross, “The Well Founded Semantics for Disjunctive Logic Programs,” Deductive and ObjectOriented Databases, W. Kim, J. M. Nicolas, and S. Nishio, eds., pp. 385–402, 1990.
[54] K.A. Ross, "Modular Stratification and Magic Sets for DATALOG Programs with Negation," Proc. Ninth ACM PODS Symp. Principles of Database Systems, pp. 161171, 1990; extended version, containing new results, obtained from author.
[55] D. Saccà, "The Expressive Powers of Stable Models for Bound and Unbound DATALOG Queries," J. Computer and System Sciences, 1995.
[56] C. Sakama, “Possible Model Semantics for Disjunctive Databases,” Proc. First Int'l Conf. Deductive and Object Oriented Databases, pp. 1,055–1,060, 1989.
[57] C. Sakama and K. Inoue, “Representing Priorities in Logic Programs,” Proc. Joint Int'l Conf. and Symp. Logic Programming, pp. 82–96, 1996.
[58] J.S. Schlipf, "The Expressive Powers of the Logic Programming Semantics (extended abstract)," ACM SIGACTSIGMODSIGART Symp. Principles of Database Systems, pp. 196204, 1990.
[59] L. Stockmeyer, “Classifying the Computational Complexity of Problems,” J. Symbolic Logic, vol. 52, no. 1, pp. 1–43, 1987.
[60] L.J. Stockmeyer and A.R. Meyer, "Word Problems Requiring Exponential Time," Proc. Fifth ACM Symp. Theory of Computing, pp. 19, 1973.
[61] J. Ullman, Principles of Database and KnowledgeBase Systems, vol. 1. Computer Science Press, 1988.
[62] 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.
[63] M.Y. Vardi, "The Complexity of Relational Query Languages," Proc. ACM Symp. Theory of Computing, pp. 137146, 1982.
[64] K. Wagner, "Bounded Query Classes," SIAM J. Computing, vol. 19, no. 5, pp. 833846, 1990.
[65] J.H. You and L. Yuan, “A ThreeValued Semantics for Deductive Databases and Logic Programs,” J. Computer and System Sciences, vol. 49, pp. 334–361, 1994.