Skip to main content

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

  • Conference paper
Logic Programming (ICLP 2006)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 4079))

Included in the following conference series:

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.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baral, C.: Knowledge representation, reasoning and declarative problem solving. Cambridge University Press, Cambridge (2003)

    Book  MATH  Google Scholar 

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

    Chapter  Google Scholar 

  3. 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, M., Lamma, E., Mello, P.: Modularity in logic programming. Journal of logic programming 19-20, 443–502 (1994)

    Article  MathSciNet  Google Scholar 

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

    Chapter  Google Scholar 

  6. Chen, W., Kifer, M., Warren, D.: A foundation for higher-order logic programming. Journal of Logic Programming 15(3), 187–230 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  7. Common Logic Standard, http://philebus.tamu.edu/cl/

  8. 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, 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, S., Gabbrielli, M.: Transformations of CLP modules. Theoretical computer science 166, 101–146 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  11. 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, 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, 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, M., Fikes, R.: Knowledge interchange format. Technical Report Technical Report Logic-92-1, Stanford University (1992)

    Google Scholar 

  15. 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, 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, 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, C.: Big java. John Wiley, Chichester (2005)

    Google Scholar 

  19. 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, M.: A transformation system for deductive databases modules with perfect model semantics. Theoretical computer science 110, 377–403 (1993)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  23. 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, 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. RuleML: The Rule Markup Initiative (2005), http://www.ruleml.org/

  26. Tari, L., Baral, C., Anwar, S.: A Language for Modular ASP: Application to ACC Tournament Scheduling. In: Proc. of ASP 2005 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baral, C., Dzifcak, J., Takahashi, H. (2006). Macros, Macro Calls and Use of Ensembles in Modular Answer Set Programming. In: Etalle, S., Truszczyński, M. (eds) Logic Programming. ICLP 2006. Lecture Notes in Computer Science, vol 4079. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11799573_28

Download citation

  • DOI: https://doi.org/10.1007/11799573_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-36635-5

  • Online ISBN: 978-3-540-36636-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics