Skip to main content
SpringerLink
Log in

Building a knowledge base: an example

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

The main goal of this paper is to illustrate applications of some recent developments in the theory of logic programming to knowledge representation and reasoning in common sense domains. We are especially interested in better understanding the process of development of such representations together with their specifications. We build on the previous work of Gelfond and Przymusinska in which the authors suggest that, at least in some cases, a formal specification of the domain can be obtained from specifications of its parts by applying certain operators on specifications called specification constructors and that a better understanding of these operators can substantially facilitate the programming process by providing the programmer with a useful heuristic guidance. We discuss some of these specification constructors and their realization theorems which allow us to transform specifications built by applying these constructors to declarative logic programs. Proofs of two such theorems, previously announced in a paper by Gelfond and Gabaldon, appear here for the first time. The method of specifying knowledge representation problems via specification constructors and of using these specifications for the development of their logic programming representations is illustrated by design of a simple, but fairly powerful program representing simple hierarchical domains.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. J.J. Alferes and L.M. Pereira, Reasoning with Logic Programming, Lecture Notes in Artificial Intelligence (Springer, Berlin, 1996).

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  4. K. Apt and A. Pellegrini, On the occur-check free logic programs, ACM Trans. Programming Languages and Systems 16(3) (1994) 687-726.

    Article  Google Scholar 

  5. C. Baral and M. Gelfond, Logic programming and knowledge representation, J. Logic Programming 12 (1994) 1-80.

    MathSciNet  Google Scholar 

  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.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Google Scholar 

  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).

    Google Scholar 

  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-18.

  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.

    Google Scholar 

  18. D. Etherington and R. Reiter, On inheritance hierarchies with exceptions, in: Proceedings of AAAI-83 (1983) pp. 104-108.

  19. F. Pages, Consistency of Clark's completion and existence of stable models, J. Methods Logic Comput. Sci. 1(1) (1994) 51-60.

    MathSciNet  Google Scholar 

  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.

    Article  MATH  Google Scholar 

  24. M. Gelfond and H. Przymusinska, Formalization of inheritance reasoning in autoepistemic logic, Fund. Inform. 13 (1990) 403-45.

    MATH  MathSciNet  Google Scholar 

  25. M. Gelfond and H. Przymusinska, On consistency and completeness of autoepistemic theories, Fund. Inform. 16(1) (1992) 59-92.

    MATH  MathSciNet  Google Scholar 

  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.

    Article  Google Scholar 

  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.

    Article  MATH  MathSciNet  Google Scholar 

  29. K. Kunen, Signed data dependencies in logic programs, J. Logic Programming 7(3) (1989) 231-245.

    Article  MathSciNet  Google Scholar 

  30. V. Lifschitz, Restricted monotonicity, in: Proc. of AAAI-93 (1993) pp. 432-37.

  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).

    Google Scholar 

  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.

    Google Scholar 

  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.

    Article  MATH  MathSciNet  Google Scholar 

  42. K. Stroetmann, A completeness result for SLDNF-resolution, J. Logic Programming 15(4) (1993) 337-355.

    MATH  MathSciNet  Google Scholar 

  43. D. Touretzky, The Mathematics of Inheritance Systems (Morgan Kaufmann, Los Altos, CA, 1986).

    MATH  Google Scholar 

  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.

    Article  MATH  MathSciNet  Google Scholar 

  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.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Texas at El Paso, El Paso, TX, 79968, USA

    Michael Gelfond

  2. Department of Computer Science, University of Toronto, Toronto, Canada, M5S 3G4

    Alfredo Gabaldon

Authors
  1. Michael Gelfond
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alfredo Gabaldon
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gelfond, M., Gabaldon, A. Building a knowledge base: an example. Annals of Mathematics and Artificial Intelligence 25, 165–199 (1999). https://doi.org/10.1023/A:1018938324292

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1018938324292

Keywords

Search

Navigation