Skip to main content

Construction of Explanation Graphs from Extended Dependency Graphs for Answer Set Programs

  • Conference paper
  • First Online:

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

Abstract

Extended dependency graphs are an isomorphic representation form for Answer Set Programs, while explanation graphs give an explanation for the truth value of a literal contained in an answer set. We present a method and an algorithm to construct explanation graphs from a validly colored extended dependency graph. This method exploits the graph structure of the extended dependency graph to gradually build up explanation graphs. Moreover, we show interesting properties and relations of the graph structures, such as loops, and we consider both answer set and well-founded semantics. We also present two different approaches for the determination of assumptions in an extended dependency graph, an optimal but exponential and a sub-optimal but linear one.

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

Buying options

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

References

  1. Pontelli, E., Son, T.C., Elkhatib, O.: Justifications for logic programs under answer set semantics. Theor. Pract. Logic Program. 9(1), 1–56 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  2. Constantini, S., Provetti, A.: Graph representations of consistency and truth-dependencies in logic programs with answer set semantics. In: The 2nd International IJCAI Workshop on Graph Structures for Knowledge Representation and Reasoning (GKR 2011), vol. 1 (2011)

    Google Scholar 

  3. Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Gener. Comput. 9(3–4), 365–385 (1991)

    Article  Google Scholar 

  4. Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer, Heidelberg (1987)

    Book  MATH  Google Scholar 

  5. Brignoli, G., Costantini, S., Provetti, A.: Characterizing and computing stable models of logic programs: the non-stratified case. In: Proceedings of the Conference on Information Technology, Bhubaneswar, India. AAAI Press (1999)

    Google Scholar 

  6. Van Gelder, A., Ross, K.A., Schlipf, J.S.: The well-founded semantics for general logic programs. J. ACM 38(3), 620–650 (1991)

    MATH  Google Scholar 

  7. Dimopoulos, Y., Torres, A.: Graph theoretical structures in logic programs and default theories. Theor. Comput. Sci. 170, 209–244 (1996)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Acknowledgement

This work has been supported by the German Research Foundation DFG, Collaborative Research Center SFB876, Project A5. (http://sfb876.tu-dortmund.de)

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Patrick Krümpelmann .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Albrecht, E., Krümpelmann, P., Kern-Isberner, G. (2014). Construction of Explanation Graphs from Extended Dependency Graphs for Answer Set Programs. In: Hanus, M., Rocha, R. (eds) Declarative Programming and Knowledge Management. INAP WLP WFLP 2013 2013 2013. Lecture Notes in Computer Science(), vol 8439. Springer, Cham. https://doi.org/10.1007/978-3-319-08909-6_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-08909-6_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-08908-9

  • Online ISBN: 978-3-319-08909-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics