|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
 |
2
|
|
 |
3
|
|
| |
4
|
CHANDRA, A., AND HAREL, D. Structure and complexity of relational queries. J. Comput. Syst. Sci. 25, 1 (I982), 99-128.
|
| |
5
|
CHANDRA, A., AND HAREL, D. Horn clause queries and generalizations. J. Logic Prog. 2, 1 (1985), 1 - 15.
|
| |
6
|
CLARK, K.L. Negation as failure. In H. Gallaire and J. Minker, eds., Logic and Databases. Plenum Press, New York, 1978, pp. 293-322.
|
| |
7
|
DUMMETT, M. A.E. Elements of Intuitionism. Clarendon Press, Oxford, England, 1977.
|
| |
8
|
DUNG, PH. M., AND KANCHANASUT, K. A natural semantics for logic programs with negation. Tech. Rep. Asian Institute of Technology, Bangkok 10501, Thailand, 1989. (manuscript).
|
| |
9
|
FITTINC, M. A Kripke-Kleene semantics for logic programs. J. Logic Progr. 2, 4 (1985), 295-312.
|
| |
10
|
GELFOND, M. On stratified autoepistemic theories. In Proceedings of the 6th National Conference on Artificial Intelligence. Morgan-Kaufmann, San Mateo, Calif., 1987, pp. 207-211.
|
| |
11
|
GELFOND, M, AND LIFSCHITZ, V. The stable model semantics for logic programming. In Proceedings of the 5th International Conference and Symposium on Logic Programming (Seattle, Wash.). IEEE, New York, 1988, pp. 1070-1080.
|
| |
12
|
GUREVrCrI, Y., AND SHELAH, S. Fixed-point extensions of first order logic. Ann. Pure Appl. Logic 32 (1986), 265-280.
|
| |
13
|
HANKS, S., AND MCDERMOTT, D. Default reasoning, nonmonotonic logics, and the frame problem. In Proceedings of 5th National Conference on Artificial intelligence. Morgan- Kaufmann, San Mateo, Calif., 1986, pp. 328-333.
|
| |
14
|
|
| |
15
|
JAFFAR, J., LASSEZ, J.-L., AND LLOYD, J. Completeness of the negation-as-failure rule. In Proceedings of the International Joint Conference on Artificial Intelligence. Morgan- Kaufmann, San Mateo, Calif., 1983, pp. 500-506.
|
| |
16
|
|
| |
17
|
|
| |
18
|
KUNEN, K. Some remarks on the completed database. Tech. Rep. 775. Univ. of Wisconsin, Madison, Wisc., 1988. (Abstract appeared in Proceedings of the 5th International Conference and Symposium on Logic Programming (Seattle, Wash., Aug.) 1988).
|
| |
19
|
|
| |
20
|
|
| |
21
|
LLOYD, J, W., AND TOPOR, R. W. Making Prolog more expressive. J. Logic Prog. 1. 3 (1984), 225-240.
|
| |
22
|
|
| |
23
|
MAREK, W. Stable theories in autoepistemic logic. Tech. Rep., Univ. Kentucky, Lexington, Ky., 1986.
|
| |
24
|
MAREK, A., AND TRUSZCZYNSKI, M. Autoepistemic logic. Tech. Rep., Umv. Kentucky, Lexington, Ky., 1988.
|
| |
25
|
|
| |
26
|
|
| |
27
|
MORRIS, K. Talk at Workshop XP8.3i, Oregon Graduate Center, July 1987.
|
| |
28
|
|
| |
29
|
|
| |
30
|
PRZYMUSINSKA, H, AND PRZYMUSINSKI, T. C. Weakly perfect model semantics for logic programs. In Proceedings of the 5th International Conference and Symposium on Logic Programming (Seattle, Wash.), 1988, pp. 1106-1120.
|
| |
31
|
|
 |
32
|
|
| |
33
|
REITER, R. On closed world databases. In H. Gallaire and J. Minker, Logic and Databases. Plenum Press, New York, 1978, pp. 55-76.
|
 |
34
|
|
| |
35
|
|
| |
36
|
SCHLIPF, J. S. Negation by securable failure in logic programming. Unpubhshed manuscript, 1987.
|
| |
37
|
|
| |
38
|
|
 |
39
|
|
| |
40
|
|
| |
41
|
|
| |
42
|
|
 |
43
|
|
CITED BY 198
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Sei Chun , Huizhu Lu , Jonghoon Chun, Succinct model semantics: a simple model for inclusive interpretations, Proceedings of the 1998 ACM symposium on Applied Computing, p.39-44, February 27-March 01, 1998, Atlanta, Georgia, United States
|
|
|
|
|
|
|
|
|
|
|
|
Sumit Ganguly , Sergio Greco , Carlo Zaniolo, Minimum and maximum predicates in logic programming, Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.154-163, May 29-31, 1991, Denver, Colorado, United States
|
|
|
|
|
|
|
|
|
|
|
|
Catriel Beeri , Raghu Ramakrishnan , Divesh Srivastava , S. Sudarshan, The valid model semantics for logic programs, Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.91-104, June 02-05, 1992, San Diego, California, United States
|
|
|
|
|
|
Kannan Govindarajan , Bharat Jayaraman , Surya Mantha, Optimization and relaxation in constraint logic languages, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.91-103, January 21-24, 1996, St. Petersburg Beach, Florida, United States
|
|
|
|
|
|
|
|
|
Benjamin N. Grosof , Yannis Labrou , Hoi Y. Chan, A declarative approach to business rules in contracts: courteous logic programs in XML, Proceedings of the 1st ACM conference on Electronic commerce, p.68-77, November 03-05, 1999, Denver, Colorado, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Thomas Eiter , Georg Gottlob , Heikki Mannila, Adding disjunction to datalog (extended abstract), Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.267-278, May 24-27, 1994, Minneapolis, Minnesota, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Sergio Greco , Carlo Zaniolo , Sumit Ganguly, Greedy by choice, Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.105-113, June 02-05, 1992, San Diego, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Nicola Leone , Gerald Pfeifer , Wolfgang Faber , Thomas Eiter , Georg Gottlob , Simona Perri , Francesco Scarcello, The DLV system for knowledge representation and reasoning, ACM Transactions on Computational Logic (TOCL), v.7 n.3, p.499-562, July 2006
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Aleksander Pivk , Philipp Cimiano , York Sure , Matjaz Gams , Vladislav Rajkovič , Rudi Studer, Transforming arbitrary tables into logical form with TARTAR, Data & Knowledge Engineering, v.60 n.3, p.567-595, March, 2007
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Thomas Eiter , Giovambattista Ianni , Thomas Lukasiewicz , Roman Schindlauer , Hans Tompits, Combining answer set programming with description logics for the Semantic Web, Artificial Intelligence, v.172 n.12-13, p.1495-1539, August, 2008
|
|
|
|
|
|
|
|
|
Grigoris Antoniou , Antonis Bikakis , Anna Karamolegou , Nikos Papachristodoulou , Manolis Stratakis, A context-aware meeting alert using semantic web and rule technology, International Journal of Metadata, Semantics and Ontologies, v.2 n.3, p.147-156, March 2007
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Martin Gebser , Benjamin Kaufmann , André Neumann , Torsten Schaub, Conflict-driven answer set solving, Proceedings of the 20th international joint conference on Artifical intelligence, p.386-392, January 06-12, 2007, Hyderabad, India
|
|
|
Murray Patterson , Yongmei Liu , Eugenia Ternovska , Arvind Gupta, Grounding for model expansion in k-guarded formulas with inductive definitions, Proceedings of the 20th international joint conference on Artifical intelligence, p.161-166, January 06-12, 2007, Hyderabad, India
|
|
|
Luis Moniz Pereira , Joaquim N. Aparicio , Jose J. Alferes, Derivation procedures for extended stable models, Proceedings of the 12th international joint conference on Artificial intelligence, p.863-868, August 24-30, 1991, Sydney, New South Wales, Australia
|
|
|
Antonis C. Kakas , Bert Van Nuffelen , Marc Denecker, A-system: problem solving through abduction, Proceedings of the 17th international joint conference on Artificial intelligence, p.591-596, August 04-10, 2001, Seattle, WA, USA
|
|
|
|
|
|
|
|
|
Francesco Calimeri , Wolfgang Fabery , Nicola Leone , Simona Perri, Declarative and computational properties of logic programs with aggregates, Proceedings of the 19th international joint conference on Artificial intelligence, p.406-411, July 30-August 05, 2005, Edinburgh, Scotland
|
|
|
|
|
|
|
|
|
|
REVIEW
"Chris Nikolopoulos : Reviewer"
A general logic program is a Horn clause logic program with
negations. Two approaches have been tried to extend logic programs with
negation: the program completion approach (the closed world assumption
and SLDNF resolution augmented with nega
more...
|