Advertisement

Macros, Macro Calls and Use of Ensembles in Modular Answer Set Programming

  • Chitta Baral
  • Juraj Dzifcak
  • Hiro Takahashi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4079)

Abstract

Currently, most knowledge representation using logic programming with answer set semantics (AnsProlog) is ‘flat’. In this paper we elaborate on our thoughts about a modular structure for knowledge representation and declarative problem solving formalism using AnsProlog. We present language constructs that allow defining of modules and calling of such modules from programs. This allows one to write large knowledge bases or declarative problem solving programs by reusing existing modules instead of writing everything from scratch. We report on an implementation that allows such constructs. Our ultimate aim is to facilitate the creation and use of a repository of modules that can be used by knowledge engineers without having to re-implement basic knowledge representation concepts from scratch.

Keywords

Logic Program Knowledge Representation Logic Programming Planning Program Transitive Closure 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Baral 2003]
    Baral, C.: Knowledge representation, reasoning and declarative problem solving. Cambridge University Press, Cambridge (2003)MATHCrossRefGoogle Scholar
  2. [Baselice, Bonatti, & Gelfond 2005]
    Baselice, S., Bonatti, P., Gelfond, M.: Towards an Integration of Answer Set and Constraint Solving. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol. 3668, pp. 52–66. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  3. [Boley et al. 2004]
    Boley, H., Grosof, B., Kifer, M., Sintek, M., Tabet, S., Wagner, G.: Object-Oriented RuleML (2004), http://www.ruleml.org/indoo/indoo.html
  4. [Bugliesi et al. 1994]
    Bugliesi, M., Lamma, E., Mello, P.: Modularity in logic programming. Journal of logic programming 19-20, 443–502 (1994)CrossRefMathSciNetGoogle Scholar
  5. [Calimeri et al. 2004]
    Calimeri, F., Ianni, G., Ielpa, G., Pietramala, A., Santoro, M.C.: A System with Template Answer Set Programs. In: Alferes, J.J., Leite, J.A. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 693–697. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  6. [Chen, Kifer, & Warren 1993]
    Chen, W., Kifer, M., Warren, D.: A foundation for higher-order logic programming. Journal of Logic Programming 15(3), 187–230 (1993)MATHCrossRefMathSciNetGoogle Scholar
  7. [com]
    Common Logic Standard, http://philebus.tamu.edu/cl/
  8. [Dean et al. 2002]
    Dean, M., Connolly, D., van Harmelen, F., Hendler, J., Horrocks, I., McGuinness, D., Patel-Schneider, P., Stein, L.: OWL web ontology language 1.0 reference (2002), http://www.w3.org/TR/owl-ref/
  9. [Eiter et al. 1997]
    Eiter, T., Gottlob, G., Veith, H.: Modular logic programming and generalized quantifiers. In: Proc. 4th international conference on Logic programming and non-monotonic reasoning, pp. 290–309. Springer, Heidelberg (1997)Google Scholar
  10. [Etalle & Gabbrielli 1996]
    Etalle, S., Gabbrielli, M.: Transformations of CLP modules. Theoretical computer science 166, 101–146 (1996)MATHCrossRefMathSciNetGoogle Scholar
  11. [Gelfond & Gabaldon 1997]
    Gelfond, M., Gabaldon, A.: From functional specifications to logic programs. In: Maluszynski, J. (ed.) Proc. of International Symposium on Logic Programming, pp. 355–370 (1997)Google Scholar
  12. [Gelfond & Lifschitz 1988]
    Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R., Bowen, K. (eds.) Logic Programming: Proc. of the Fifth Int’l. Conf. and Symp., pp. 1070–1080. MIT Press, Cambridge (1988)Google Scholar
  13. [Gelfond 2006]
    Gelfond, M.: Going places - notes on a modular development of knowledge about travel. In: Proceedings of AAAI 2006 Spring Symposium: Formalizing and Compiling Background Knowledge and Its Applications to Knowledge Representation and Question Answering (2006)Google Scholar
  14. [Genesereth & Fikes 1992]
    Genesereth, M., Fikes, R.: Knowledge interchange format. Technical Report Technical Report Logic-92-1, Stanford University (1992)Google Scholar
  15. [Grosof et al. 2003]
    Grosof, B., Horrocks, I., Volz, R., Decker, S.: Description Logic Programs: Combining Logic Programs with Description Logic. In: Proceedings of 12th International Conference on the World Wide Web (WWW 2003) (2003)Google Scholar
  16. [Guha 1990]
    Guha, R.: Micro-theories and Contexts in Cyc Part I: Basic Issues. Technical Report MCC Technical Report Number ACT-CYC-129-90 (1990)Google Scholar
  17. [Horrocks et al. 2003]
    Horrocks, I., Patel-Schneider, P., Boley, H., Tabet, S., Grosof, B., Dean, M.: SWRL: A Semantic Web Rule Language Combining OWL and RuleML (2003), http://www.daml.org/2003/11/swrl/
  18. [Horstman 2005]
    Horstman, C.: Big java. John Wiley, Chichester (2005)Google Scholar
  19. [Lifschitz & Ren 2006]
    Lifschitz, V., Ren, W.: Towards a Modular action description language. In: Proceedings of AAAI 2006 Spring Symposium: Formalizing and Compiling Background Knowledge and Its Applications to Knowledge Representation and Question Answering (2006)Google Scholar
  20. [Maher 1993]
    Maher, M.: A transformation system for deductive databases modules with perfect model semantics. Theoretical computer science 110, 377–403 (1993)MATHCrossRefMathSciNetGoogle Scholar
  21. [McCarthy 1993]
    McCarthy, J.: Notes on formalizing contexts. In: Bajcsy, R. (ed.) Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence, pp. 555–560. Morgan Kaufmann, San Mateo (1993)Google Scholar
  22. [Miller et al. 1990]
    Miller, G., Beckwith, R., Fellbaum, C., Gross, D., Miller, K.: Introduction to wordnet: An on-line lexical database. International Journal of Lexicography (special issue) 3(4), 235–312 (1990)CrossRefGoogle Scholar
  23. [Niemelä & Simons 1997]
    Niemelä, I., Simons, P.: Smodels – an implementation of the stable model and well-founded semantics for normal logic programs. In: Dix, J., Furbach, U., Nerode, A. (eds.) Proc. 4th international conference on Logic programming and non-monotonic reasoning, pp. 420–429. Springer, Heidelberg (1997)Google Scholar
  24. [Niles & Pease 2001]
    Niles, I., Pease, A.: Towards a standard upper ontology. In: Proceedings of the international conference on Formal Ontology in Information Systems, pp. 2–9 (2001)Google Scholar
  25. [rul 2005]
    RuleML: The Rule Markup Initiative (2005), http://www.ruleml.org/
  26. [Tari, Baral, & Anwar 2005]
    Tari, L., Baral, C., Anwar, S.: A Language for Modular ASP: Application to ACC Tournament Scheduling. In: Proc. of ASP 2005 (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Chitta Baral
    • 1
  • Juraj Dzifcak
    • 1
  • Hiro Takahashi
    • 1
  1. 1.Department of Computer Science and EngineeringArizona State UniversityTempeUSA

Personalised recommendations