Skip to main content

Deducing Logic Programs

  • 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:

  • 459 Accesses

Abstract

Consider an agent endowed with a logic program which is able to respond to certain questions about the logic program. We would like to answer the question: to what extent can we deduce the logic program from the agent’s answers, and how can we do this?

For example, suppose the agent has a logic program with the unique answer set {p, q}. Supposing that we are only allowed to ask whether a given literal is in an answer set, we may guess that the logic program is {p ←, q ←}. It is clear that this is unlikely to be the actual logic program, however we cannot distinguish between this program and the actual program with only the questions allowed. On the other end of the scale, suppose we are allowed to ask the agent to tell us their logic program. Then it is trivial to determine exactly the logic program of the agent.

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

References

  1. Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9(3/4), 365–386 (1991)

    Article  Google Scholar 

  2. Lifschitz, V., Tang, L., Turner, H.: Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence 25(2-3), 369–390 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  3. Shapiro, E.: Inductive inference of theories from facts. In: Lassez, J., Plotkin, G. (eds.) Computational Logic: Essays in Honor of Alan Robinson, pp. 199–255 (1991)

    Google Scholar 

  4. Muggleton, S.: Inductive Logic Programming. Academic Press, London (1992)

    MATH  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

Wong, KS. (2006). Deducing Logic Programs. 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_54

Download citation

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

  • 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