Building a knowledge base: An example

Annals of Mathematics and Artificial Intelligence

Volumn 25, Issue 3-4, 1999, Pages 165-199

  Gelfond, Michael ^a   Gabaldon, Alfredo ^b  

^a University of Texas at El Paso   (United States)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0042094692     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1018938324292     Document Type: Article

References (47)

1. J.J. Alferes and L.M. Pereira, Reasoning with Logic Programming, Lecture Notes in Artificial Intelligence (Springer, Berlin, 1996).
2. K. Apt, H. Blair and A. Walker, Towards a theory of declarative knowledge, in: Foundations of Deductive Databases and Logic Programming, ed. J. Minker (Morgan Kaufmann, San Mateo, CA, 1988) pp. 89-148.
3. K. Apt and D. Pedreschi, Proving termination in general Prolog programs, in: Proc. of the International Conference on Theoretical Aspects of Computer Software, Lecture Notes in Computer Science, Vol. 526 (Springer, Berlin, 1991) pp. 265-289.
4. K. Apt and A. Pellegrini, On the occur-check free logic programs, ACM Trans. Programming Languages and Systems 16(3) (1994) 687-726.
5. C. Baral and M. Gelfond, Logic programming and knowledge representation, J. Logic Programming 12 (1994) 1-80.
6. C. Baral, M. Gelfond and O. Kosheleva, Expanding queries to incomplete databases by interpolating general logic programs, J. Logic Programming 35 (1998) 195-230.
7. N. Bidoit and C. Froidevaux, Minimalism subsumes default logic and circumscription, in: Proc. of LICS-87 (1987) pp. 89-97.
8. D. Chan, Constructive negation based on the completed databases, in: Proc. 5th International Conference and Symposium on Logic Programming (1988) pp. 111-125.
9. W. Chen, Extending Prolog with nonmonotonic reasoning, J. Logic Programming 27(2) (1996) 169-183.
10. W. Chen, T. Swift and D. Warren, Efficient top-down computation of queries under the well-founded semantics, J. Logic Programming 24(3) (1995) 161-201.
11. P. Cholewinski, W. Marek and M. Truszczynski, Default reasoning system DeReS, in: Proc. of KR-96 (1996) pp. 518-528.
12. K. Clark, Negation as failure, in: Logic and Data Bases, eds. H. Gallaire and J. Minker (Plenum Press, NY, 1978) pp. 293-322.
13. P. Dembinski and J. Maluszynski, AND-parallelism with intelligent backtracking for annotated logic programs, in: Logic Programming: Proc. of the International Symposium on Logic Programming, eds. V. Saraswat and K. Ueda (1985) pp. 25-38.
14. Y. Deville, Logic Programming: Systematic Program Development (Addison-Wesley, Reading, MA, 1990).
15. P.M. Dung and T.C. Son, Nonmonotonic inheritance, argumentation, and logic programming, in: Proceedings of LPNMR (1995) pp. 316-329.
16. P.M. Dung and T.C. Son, An argumentation-theoretic approach to reasoning with specificity, in: Proceedings of KR '96 (1996) pp. 407-418.
17. T. Eiter, N. Leone, C. Mateis, G. Pfeifer and F. Scarcello, A deductive system for non-monotonic reasoning, in: Proc. 4th LPNMR, Lecture Notes in Computer Science, Vol. 1265 (Springer, Berlin, 1997) pp. 363-374.
18. D. Etherington and R. Reiter, On inheritance hierarchies with exceptions, in: Proceedings of AAAI-83 (1983) pp. 104-108.
19. F. Fages, Consistency of Clark's completion and existence of stable models, J. Methods Logic Comput. Sci. 1(1) (1994) 51-60.
20. M. Gelfond and A. Gabaldon, From functional specifications to logic programs, in: Logic Programming: Proc. of the 1997 International Symposium, ed. J. Maluszynski (1997) pp. 355-371.
21. M. Gelfond and V. Lifschitz, The stable model semantics for logic programming, in: Logic Programming: Proc. of the 5th International Conference and Symposium, eds. R. Kowalski and K. Bowen (1988) pp. 1070-1080.
22. M. Gelfond and V. Lifschitz, Logic programs with classical negation, in: Logic Programming: Proc. of the 7th International Conference, eds. D. Warren and P. Szeredi (1990) pp. 579-597.
23. M. Gelfond and V. Lifschitz, Classical negation in logic programs and disjunctive databases, New Generation Computing 9 (1991) 365-385.
24. M. Gelfond and H. Przymusinska, Formalization of inheritance reasoning in autoepistemic logic, Fund. Inform. 13 (1990) 403-445.
25. M. Gelfond and H. Przymusinska, On consistency and completeness of autoepistemic theories, Fund. Inform. 16(1) (1992) 59-92.
26. M. Gelfond and H. Przymusinska, Towards a theory of elaboration tolerance: logic programming approach, J. Software Eng. Knowledge Eng. 6(1) (1996) 89-112.
27. J.F. Horty, Some direct theories of non-monotonic inheritance, in: Handbook of Logic in Artificial Intelligence and Logic Programming, eds. D. Gabbay, C. Hogger and J.A. Robinson (1994).
28. J.F. Horty, R.H. Thomason and D.S. Touretzky, A skeptical theory of inheritance in nonmonotonic semantic networks, Artificial Intelligence 42(2-3) (1990) 311-348.
29. K. Kunen, Signed data dependencies in logic programs, J. Logic Programming 7(3) (1989) 231-245.
30. V. Lifschitz, Restricted monotonicity, in: Proc. of AAAI-93 (1993) pp. 432-437.
31. V. Lifschitz, Foundations of logic programming, in: Principles of Knowledge Representation, ed. G. Brewka (CSLI Publications, 1996) pp. 69-128.
32. V. Lifschitz and H. Turner, Splitting a logic program, in: Proc. 11th ICLP, ed. P. Van Hentenryck (1994) pp. 23-38.
33. F. Lin, A study of nonmonotonic reasoning, Ph.D. thesis, Stanford University (1991).
34. W. Marek and V.S. Subrahmanian, The relationship between logic program semantics and non-monotonic reasoning, in: Proc. of the 6th International Conference on Logic Programming, eds. G. Levi and M. Martelli (1989) pp. 600-617.
35. N. McCain and H. Turner, Language independence and language tolerance in logic programs, in: Proc. of the 11th International Conference on Logic Programming (1994) pp. 38-57.
36. L. Niemela and P. Simons, Efficient implementation of the well-founded and stable model semantics, in: Proc. of JICSLP-96 (MIT Press, Cambridge, MA, 1996).
37. L. Pereira and J. Alferes, Well-founded semantics for logic programs with explicit negation, in: Proc. of the 10th European Conference on Artificial Intelligence (1992) pp. 102-106.
38. T. Przymusinki, On constructive negation in logic programming, in: Proc. of the North American Conference of Logic Programming (1989) pp. 16-20.
39. R. Reiter, On closed world data bases, in: Logic and Data Bases, eds. H. Gallaire and J. Minker (Plenum Press, New York, 1978) pp. 119-140.
40. R. Reiter, A logic for default reasoning, Artificial Intelligence 13(1-2) 81-132.
41. L.A. Stein, Resolving ambiguity in non-monotonic inheritance hierarchies, Artificial Intelligence 55(2-3) (1992) 259-310.
42. K. Stroetmann, A completeness result for SLDNF-resolution, J. Logic Programming 15(4) (1993) 337-355.
43. D. Touretzky, The Mathematics of Inheritance Systems (Morgan Kaufmann, Los Altos, CA, 1986).
44. H. Turner, A monotonicity theorem for extended logic programs, in: Proc. 10th ICLP, ed. D.S. Warren (1993) pp. 567-585.
45. H. Turner, Signed logic programs, in: Proc. of ILPS, ed. M. Bruynooghe (1994) pp. 61-75.
46. A. Van Gelder, K. Ross and J. Schlipf, The well-founded semantics for general logic programs, Journal of the ACM 38(3) (1991) 620-650.
47. X. Wang, J.H. You and L.Y Yuan, A default interpretation of defeasible network, in: Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI-97) (1997) pp. 156-161.