Parametric connectives in disjunctive logic programming

AI Communications

Volumn 17, Issue 2, 2004, Pages 63-74

  Perri, Simona ^a   Leone, Nicola ^a  

^a UNIVERSITY OF CALABRIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATABASE SYSTEMS; KNOWLEDGE ACQUISITION; KNOWLEDGE REPRESENTATION; PROBLEM SOLVING; SEMANTICS;

DECLARATIVE PROGRAMMING; DISJUNCTIVE LOGIC PROGRAMMING; LITERALS; PARAMETRIC CONNECTIVES;

LOGIC PROGRAMMING;

EID: 3142715778     PISSN: 09217126     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (17)

1. K.R. Apt, H.A. Blair and A. Walker, Towards a theory of declarative knowledge, in: Foundations of Deductive Data-bases and Logic Programming, J. Minker, ed., Morgan Kaufmann Publishers, Inc., Washington, DC, 1988, pp. 89-148.
2. C. Baral, Knowledge Representation, Reasoning and Declarative Problem Solving, Cambridge University Press, 2002.
3. C. Baral and M. Gelfond, Logic programming and knowledge representation, Journal of Logic Programming 19/20 (1994), 73-148.
4. R. Ben-Eliyahu and R. Dechter, Propositional semantics for disjunctive logic programs, Annals of Mathematics and Artificial Intelligence 12 (1994), 53-87.
5. T. Eiter, W. Faber, G. Gottlob, C. Koch, N. Leone, C. Mateis, G. Pfeifer and F. Scarcello, The DLV system, in: Workshop on Logic-Based Artificial Intelligence, J. Minker, ed., Washington, DC, College Park, Maryland, 1999. Computer Science Department, University of Maryland, Workshop Notes.
6. T. Eiter, G. Gottlob and H. Mannila, Disjunctive datalog, ACM Transactions on Database Systems 22(3) (1997), 364-418.
7. W. Faber, N. Leone and O. Pfeifer, Pushing goal derivation in DLP computations, in: Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'99), number 1730 in Lecture Notes in AI (LNAI), M. Gelfond, N. Leone and O. Pfeifer, eds, El Paso, Texas, USA, Springer Verlag, 1999, pp. 177-191.
8. W. Faber, N. Leone and O. Pfeifer, Experimenting with heuristics for answer set programming, in: Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI) 2001, Seattle, WA, USA, Morgan Kaufmann Publishers, 2001, pp. 635-640.
9. M. Gelfond and V. Lifschitz, The stable model semantics for logic programming, in: Logic Programming: Proceedings Fifth Intl Conference and Symposium, Cambridge, MA, MIT Press, 1988, pp. 1070-1080.
10. M. Gelfond and V. Lifschitz, Classical negation in logic programs and disjunctive databases, New Generation Computing 9 (1991), 365-385.
11. G. Gottlob, Complexity and expressive power of disjunctive logic programming, in: Proceedings of the International Logic Programming Symposium (ILPS'94), M. Bruynooghe, ed., Ithaca NY, MIT Press, 1994, pp. 23-42.
12. V. Lifschitz, Foundations of logic programming, in: Principles of Knowledge Representation, G. Brewka, ed., CSU Publications, Stanford, 1996, pp. 69-127.
13. V. Lifschitz, L.R. Tang and H. Turner, Nested expressions in logic programs, Annals of Mathematics and Artificial Intelligence 25(3-4) (1999), 369-389.
14. J. Lobo, J. Minker and A. Rajasekar, Foundations of Disjunctive Logic Programming, MIT Press, Cambridge, MA, 1992.
15. J. Minker, Overview of disjunctive logic programming, Annals of Mathematics and Artificial Intelligence 12(1994), 1-24.
16. P. Simons, I. Niemelä and T. Soininen, Extending and implementing the stable model semantics, Artificial Intelligence 138 (June) (2002), 181-234.
17. B. Wolfinger, ed., Workshop: Disjunctive Logic Programming and Disjunctive Databases, Berlin, German Society for Computer Science (GI), Springer, 13th IFIP World Computer Congress, Hamburg, Germany, 1994.