Skip to main content
SpringerLink
Log in
Book cover

International Conference on Logic Programming and Nonmonotonic Reasoning

LPNMR 2015: Logic Programming and Nonmonotonic Reasoning pp 97–111Cite as

Online Action Language \(o\mathcal {BC}\)+

  • Conference paper
  • First Online:

  • 775 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9345))

Abstract

We present an online action language called \(o\mathcal{BC}\)+, which extends action language \(\mathcal{BC}\)+ to handle external events arriving online. This is done by first extending the concept of online answer set solving to arbitrary propositional formulas, and then defining the semantics of \(o\mathcal{BC}\)+ based on this extension, similar to the way the offline \(\mathcal{BC}\)+ is defined. The design of \(o\mathcal{BC}\)+ ensures that any action description in \(o\mathcal{BC}\)+ satisfies the syntactic conditions required for the correct computation of online answer set solving, thereby alleviates the user’s burden for checking the sophisticated conditions.

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

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 EPUB and 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

Learn about institutional subscriptions

Notes

  1. 1.

    http://www.cs.uni-potsdam.de/wv/oclingo/.

  2. 2.

    So \(c\!=\!v\) is an atom in the propositional signature, and not an equality in first-order logic.

  3. 3.

    Statically determined fluents are fluents whose values are completely determined by fluents in the same state, and not by direct effects of actions [5, Sect. 5.5].

  4. 4.

    In [2], this process stops only at the second iteration.

  5. 5.

    In practice when F is non-ground, we assume F is grounded first by substituting every variable with every element in the Herbrand universe.

  6. 6.

    For notational simplicity, we define \(E_0[e_0]\) and \(F_0[f_0]\) to be \(\top \), \(e_0,f_0\) to be 0, and \(I(E_0[e_0])\) and \(I(F_0[f_0])\) to be \(\emptyset \).

  7. 7.

    It uses several abbreviations of causal laws as defined in [4].

References

  1. Valle, E.D., Ceri, S., van Harmelen, F., Fensel, D.: It’s a streaming world! Reasoning upon rapidly changing information. IEEE Intell. Syst. 24(6), 83–89 (2009)

    Article  Google Scholar 

  2. Gebser, M., Grote, T., Kaminski, R., Schaub, T.: Reactive answer set programming. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS, vol. 6645, pp. 54–66. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  3. Janhunen, T., Oikarinen, E., Tompits, H., Woltran, S.: Modularity aspects of disjunctive stable models. J. Artif. Intell. Res. 35, 813–857 (2009)

    MATH  MathSciNet  Google Scholar 

  4. Babb, J., Lee, J.: Action language \(\cal BC\)+: preliminary report. In: Proceedings of the AAAI Conference on Artificial Intelligence (AAAI) (2015)

    Google Scholar 

  5. Giunchiglia, E., Lee, J., Lifschitz, V., McCain, N., Turner, H.: Nonmonotonic causal theories. Artif. Intell. 153(1–2), 49–104 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  6. Lee, J., Lifschitz, V., Yang, F.: Action language \(\cal BC\): preliminary report. In: Proceedings of International Joint Conference on Artificial Intelligence (IJCAI) (2013)

    Google Scholar 

  7. Babb, J., Lee, J.: Module theorem for the general theory of stable models. TPLP 12(4–5), 719–735 (2012)

    MATH  MathSciNet  Google Scholar 

  8. Ferraris, P.: Answer sets for propositional theories. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS (LNAI), vol. 3662, pp. 119–131. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  9. Bartholomew, M., Lee, J.: Stable models of multi-valued formulas: partial vs. total functions. In: Proceedings of International Conference on Principles of Knowledge Representation and Reasoning (KR), pp. 583–586 (2014)

    Google Scholar 

  10. Ferraris, P., Lee, J., Lifschitz, V., Palla, R.: Symmetric splitting in the general theory of stable models. In: Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), pp. 797–803. AAAI Press (2009)

    Google Scholar 

  11. Cerexhe, T., Gebser, M., Thielscher, M.: Online agent logic programming with oClingo. In: Pham, D.-N., Park, S.-B. (eds.) PRICAI 2014. LNCS, vol. 8862, pp. 945–957. Springer, Heidelberg (2014)

    Google Scholar 

Download references

Acknowledgements

We are grateful to Michael Bartholomew, Yi Wang, and the anonymous referees for their useful comments on the draft. This work was partially supported by the National Science Foundation under Grant IIS-1319794 and South Korea IT R&D program MKE/KIAT 2010-TD-300404-001.

Author information

Authors and Affiliations

  1. School of Computing, Informatics, and Decision Systems Engineering, Arizona State University, Tempe, USA

    Joseph Babb & Joohyung Lee

Authors
  1. Joseph Babb
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Joohyung Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Joohyung Lee .

Editor information

Editors and Affiliations

  1. University of Calabria, Rende, Italy

    Francesco Calimeri

  2. University of Calabria, Rende, Italy

    Giovambattista Ianni

  3. University of Kentucky Dept. Computer Science, Lexington, Kentucky, USA

    Miroslaw Truszczynski

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Babb, J., Lee, J. (2015). Online Action Language \(o\mathcal {BC}\)+. In: Calimeri, F., Ianni, G., Truszczynski, M. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2015. Lecture Notes in Computer Science(), vol 9345. Springer, Cham. https://doi.org/10.1007/978-3-319-23264-5_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23264-5_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-23263-8

  • Online ISBN: 978-3-319-23264-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation