Stable models and their computation for logic programming with inheritance and true negation

Journal of Logic Programming

Volumn 27, Issue 1, 1996, Pages 5-43

  Buccafurri, F ^b   Leone, N ^a   Rullo, P ^c  

^a CNR   (Italy)

^b ISI CNR   (Italy)

^c NONE

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL LINGUISTICS; COMPUTATIONAL METHODS; COMPUTER SIMULATION; COMPUTER SOFTWARE; DATA STRUCTURES;

DATALOG; INHERITANCE HIERARCHY; ORDERED LOGIC; SEMANTICS; STABLE MODELS;

LOGIC PROGRAMMING;

EID: 0030126054     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/0743-1066(95)00076-3     Document Type: Article

References (71)

1. Abiteboul, S., Simon, E., and Vianu, V., Non-Deterministic Languages to Express Deterministic Transformations, in: Proc. ACM Symp. on Principles of Database Syst., 1990, pp. 218-229.
2. Ahlsen et al., The KIWIS Knowledge Base Management System, in: Proc. 3rd Int. Conf. CAiSE'91, Trondheim, Norway, May 1991.
3. Apt, K., Blair, H., and Walker, A., Towards a Theory of Declarative Knowledge, in: Foundation of Deductive Database and Logic Programming J. Minker (ed.), Morgan Kaufmann, Los Altos, CA, 1988, pp. 89-148.
4. Balbin, I. and Ramamohanarao, K., A Generalization of the Differential Approach to Recursive Query Evaluation, J. of Logic Programming 4(3):259-262 (1987).
5. Baral, C. and Gelfond, M., Logic Programming and Knowledge Representation, J. of Logic Programming 19/20:73-148 (May/July 1994).
6. Bell, C., Nerode, A., Ng, R., and Subrahmanian, V. S., Implementing Stable Semantics by Linear Programming, in: Proc. 2nd Int. Workshop on Logic Programming and Nonmonotonic Reasoning (LPNMR-93), MIT Press, Lisbon, Portugal, July 1993, pp. 23-42 .
7. Bell, C., Nerode, A., Ng, R., and Subrahmanian, V. S., Mixed Integer Programming Methods for Computing Nonmonotonic Deductive Databases, J. ACM (1994).
8. Bidoit, N. and Froidevaux, C., Negation by Default and Unstratifiable Logic Programs, Theoretical Comp. Sci. 78:85-112 (1991).
9. Brewka, G., Nonmonotonic Reasoning: Logical Foundations of Commonsense, Cambridge Univ. Press, 1991.
10. Buccafurri, F., Leone, N., and Rullo, P., Stable Models and Their Computation for Logic Programming with Inheritance and True Negation, Tech. Rep. Christian Doppler Laboratories, Technische Universitat Wien, TR 94-73.
11. Cadoli, M. and Lenzerini, M., The Complexity of Closed World Reasoning and Circumscription (Extended Abstract in: Proc. AAAI-90, 1990, pp. 550-555); J. Comput. Syst. Sci.; 48:155-211 (1994).
12. Cadoli, M. and Lenzerini, M., The Complexity of Closed World Reasoning and Circumscription (Extended Abstract in: Proc. AAAI-90, 1990, pp. 550-555); J. Comput. Syst. Sci.; 48:155-211 (1994).
13. Cadoli, M. and Schaerf, M., A Survey of Complexity Results for Non-Monotonic Logics, J. Logic Programming 17:127-160 (1993).
14. Chandra, A. and Harel, D., Structure and Complexity of Relational Queries, J. Comp. Syst. Sci. 25(1):99-128 (1982).
15. Chellas, B. F., Modal Logic, Cambridge University Press, 1980.
16. Chimenti, D., Gamboa, R., Krishnamurthy, R., Naqvi, S., Tsur, S., and Zaniolo, C., The LDL System Prototype, IEEE Trans. on Knowledge and Data Eng. 2(1) (Mar. 1990).
17. Cuadrado, J. and Pimentel, S., A Truth Maintenance System Based on Stable Models, in: Proc. 1989 North American Conf. on Logic Programming, 1989, pp. 274-290.
18. Eiter, T., Gottlob, G., and Manila, H., Expressive Power and Complexity of Disjunctive DATALOG, in: Proc. ACM Symp. on Principles of Database Syst. 1994, pp. 267-278.
19. Fitting, M., A Kripke-Kleene Semantics for Logic Programs, J. of Logic Programming, 2(4):295-312, 1985.
20. Fuentes, L. O., Applying Uncertainty Formalisms to Well-Defined Problems, manuscript, 1991.
21. Garey, M. R. and Johnson, D. S., Computer and Intractability: A Guide to the Theory of NP-Completeness, Freeman, 1979.
22. Geerts, P. and Vermeir, D., Credulous and Autoepistemic Reasoning Using Ordered Logic, in: Proc. 1st Int. Workshop on Logic Programming and Nonmonotonic Reasoning, Washington, July 1991.
23. Gelfond, M. and Lifschitz, V., The Stable Model Semantics for Logic Programming, in: Proc. 5th Int. Conf. on Logic Programming, MIT Press, Cambridge, MA, 1988, pp. 1070-1080.
24. Gelfond, M. and Lifschitz, V., Logic Programs with Classical Negation, in: Proc. 7th ICLP, Jerusalem, 1990, pp. 579-597.
25. Gelfond, M. and Przymusinska, H., Negation as Failure: Careful Closure Procedure, Artificial Intell. 30:273-287 (1986).
26. Gelfond, M., Przymusinska, H., and Przymusinski, T. C., On the Relation Between Circumscription and Negation as Failure, Artificial Intell. 38:75-94 (1989).
27. Gottlob, G., Complexity Results for Nonmonotonic Logics, J. of Logic and Computation, 2(3):397-425 (1992).
28. Greco, S. and Saccá, D., Negative Logic Programs, in: Proc. of North American Logic Programming Conf., 1990.
29. The KIWIS Team, The KIWI(s) Project: Past and Future, in: Proc. of 6th ESPRIT Conf., 1989, pp. 594-603.
30. Kowlaski, R. A. and Sadri, F., Logic Programs with Exceptions, in: Proc. of 7th ICLP, Jerusalem, 1990, pp. 598-616.
31. Laenens, E., Saccá, D., and Vermeir, D., Extending Logic Programming, in: Proc. ACM SIGMOD, May 1990.
32. Laenens, E. and Vermeir, D., A Fixpoint Semantics for Ordered Logic, J. Logic and Computation 1(2):159-185 (Dec. 1990).
33. Laenens, E. and Vermeir, D., Assumption-Free Semantics for Ordered Logic Programs: On the Relationships Between Well-Founded and Stable Partial Models, J. of Logic and Computation 2(2):133-172 (May 1992).
34. Leone, N., Mecchia, A., Rossi, G., and Rullo, P., The Bottom-Up Query Machine of the KIWIS System, in: Lecture Notes in Computer Sci. Proc. CAiSE92, Springer-Verlag, 1992, pp. 632-650.
35. Leone, N., Mecchia, A., Rossi, G., and Rullo, P., A Deductive Environment for Dealing with Objects and Non-Monotonic Reasoning, CRAI - Tech. Rep. RI 94-06, Rende, Italy, 1994.
36. Leone, N., Romeo, M., Rullo, P., and Saccá, D., Effective Implementation of Negation in Database Logic Query Languages, in: LOGIDATA+: Deductive, Database with Complex Objects, Lecture Notes in Computer Science 701, Springer-Verlag, 1993, pp. 159-175.
37. Leone, N. and Rossi, G., Well-Founded Semantics and Stratification for Ordered Logic Programs, New Generation Computing 12(1):91-121 (Nov. 1993), Springer-Verlag.
38. Leone, N. and Rullo, P., Stable Model Semantics and Its Computation for Ordered Logic Programs, in: 10th European Conf. on Artificial Intell., Vienna, Austria, Aug. 1992, pp. 92-96.
39. Leone, N. and Rullo, P., Ordered Logic Programming with Sets, J. Logic and Computation, 3(6):621-642 (Dec. 1993), Oxford University Press.
40. Lifschitz, V., On the Declarative Semantics of Logic Programs with Negation, in: Foundation of Deductive Database and Logic Programming, J. Minker (ed.), Morgan Kaufman, Los Altos, CA, 1987, pp. 89-148.
41. Lloyd, J. W., Foundations of Logic Programming, Springer-Verlag, 1987.
42. Marek, W. and Subrahmanian, V. S., The Relationships Between Stable, Supported, Default and Autoepistemic Semantics for General Logic Programs, Theoretical Comput. Sci. 103:365-386 (1992).
43. Marek, W. and Truszczyński, M., Modal Logic for Default Reasoning, Annals of Math. and Artificial Intell., 1:275-302 (1990).
44. Marek, W. and Truszczyński, M., Autoepistemic Logic, J. ACM 38(3):518-619 (1991).
45. Marek, W. and Truszczyński, M., Computing Intersection of Autoepistemic Expansions, in: Proc. 1st Int. Workshop on Logic Programming and Non Monotonic Reasoning, MIT Press, 1991, pp. 37-50.
46. McCarthy, J., Circumscription - A Form of Nonmonotonic Reasoning, Artificial Intell. 13:27-39 (1980).
47. McDermott, D. and Doyle, J., Non-Monotonic Logic I, Artificial Intell. 13:41-72 (1980).
48. Moore, R. C., Semantics Considerations on Non-Monotonic Logic, Artificial Intell. 25 (1985).
49. Papadimitriou, C. H., Computational Complexity, Addison-Wesley Company, 1994.
50. Pereira, L. M. and Nerode, A., in: Proc. 2nd Int. Workshop on Logic Programming and Nonmonotonic Reasoning (LPNMR-93), MIT Press, Lisbon, Portugal, July 1993.
51. Poole, D., A Logical Framework for Default Reasoning, Artificial Intell., 36:27-47 (1988).
52. Przymusinski, T. C., On the Declarative Semantics of Stratified Deductive Databases and Logic Programs, in: Foundations of Deductive Databases and Logic Programming, J. Minker (ed.), Morgan Kaufman, Los Altos, CA, 1987, pp. 193-216.
53. Przymusinski, T. C., Every Logic Program Has a Natural Stratification and an Iterated Fixed Point Model, in: Proc. Symp. on Principles of Database Syst., ACM SIGACT-SIGMOD, 1989, pp. 11-21.
54. Przymusinski, T. C., Extended Stable Model Semantics for Normal and Disjunctive Logic Programs, in: Proc. 7th Int. Conf. on Logic Programming, MIT Press, Cambridge, 1990, pp. 205-218.
55. Przymusinska, H. and Przymusinski, T. C., Weakly Perfect Model Semantics for Logic Programs, in: Proc. 5th Int. Conf. and Symp. on Logic Programming, 1988.
56. Reiter, R., A Logic for Default Reasoning, Artificial Intell. 13:81-132 (1980).
57. Ross, K. A., Modular Stratification and Magic Sets for Datalog Programs with Negation, in: Proc. ACM Symp. on Principles of Database Syst., 1990.
58. Saccá, D., The Expressive Power of Stable Models for Datalog Queries with Negation, in: Proc. ILPS'93 Workshop on Structural Complexity and Recursion-Theoretic Methods in Logic Programming, 1993, pp. 150-162.
59. Saccá, D. and Zaniolo, C., Stable Models and Nondeterminism in Logic Programs with Negation, in: Proc. ACM Symp. on Principles of Database Syst., 1990.
60. Saccá, D. and Zaniolo, C., Determinism and Non-Determinism in Logic Programs with Negation, unpublished manuscript, 1992.
61. Schepherdson, J. C., Negation in Logic Programming, in: Foundation of Deductive Database and Logic Programming, J. Minker (ed.), Morgan Kaufman, Los Altos, CA, 1987, pp. 89-148.
62. Schlipf, J. S., The Expressive Powers of Logic Programming Semantics, in: Proc. ACM Symp. on Principles of Database Syst., 1990, pp. 196-204.
63. Schlipf, J. S., A Survey of Complexity and Undecidability Results in Logic Programming, in: Proc. Workshop on Structural Complexity and Recursion-Theoretic Methods in Logic Programming, Washington DC, Nov. 1993, pp. 93-102.
64. Shvarts, G., Autoepistemic Modal Logics, in: Proc. TARK-90, Morgan Kaufmann, Los Altos, CA, 1990.
65. Stillman, J., The Complexity of Propositional Default Logic, in: Proc. AAAI-92, 1992, pp. 794-799.
66. Subrahmanian, V. S., Nau, D., and Vago, C., WFS + Branch and Bound = Stable Models, IEEE Trans. on Knowledge and Data Eng. (1994).
67. Tarski, A., A Lattice-Theoretical Fixpoint Theorem and Its Applications, Pacific J. Math. 5:285-309.
68. Touretzky, D. S., The Mathematics of Inheritance Systems, Pitman, London, 1986.
69. Ullman, J. D., Principles of Database and Knowledge-Base Systems, Vol. 1 and 2, Computer Science Press, Rockville, MD, 1989.
70. Van Gelder, A., Ross, K. A., and Schlipf, J. S., The Well-Founded Semantics for General Logic Programs, J. ACM (1990).
71. Vardi, M. Y., The Complexity of Relational Query Languages, in: Proc. ACM Symp. on Theory of Computing, 1982, pp. 137-146.