Skip to main content
SpringerLink
Log in

On the Difference of Horn Theories

Extended Abstract

  • Conference paper
  • First Online:
STACS 99 (STACS 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1563))

Included in the following conference series:

Abstract

In this paper, we consider computing the difference between two Horn theories. This problem may arise, for example, if we take care of a theory change in a knowledge base. In general, the difference of Horn theories is not Horn. Therefore, we consider Horn approximations of the difference in terms of Horn cores (i.e., weakest Horn theories included in the difference). We study the problem under the familiar representation of Horn theories by Horn CNFs, as well as under the recently proposed model-based representation in terms of the characteristic models. For all problems and representations, polynomial time algorithms or proofs of intractability for the propositional case are provided.

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

Access this chapter

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Y. Boufkhad. Algorithms for Propositional KB Approximation. In Proc. National Conference on AI (AAAI’ 98), Madison, Wisconsin, pp. 280–285, July 26–30 1998.

    Google Scholar 

  2. M. Cadoli. Semantical and Computational Aspects of Horn Approximations. In Proc. IJCAI-93, pp. 39–44, 1993.

    Google Scholar 

  3. W. Dowling and J. H. Gallier. Linear-time Algorithms for Testing the Satisfiability of Propositional Horn Theories. J. Logic Programming, 3:267–284, 1984.

    Article  MathSciNet  Google Scholar 

  4. T. Eiter, T. Ibaraki, and K. Makino. Computing Intersections of Horn Theories for Reasoning with Models. In: Proc. AAAI’ 98, pp. 292–297, 1998.

    Google Scholar 

  5. T. Eiter, T. Ibaraki, and K. Makino. Disjunctions of Horn Theories and their Cores. In Proc. 9th Int’l Symp. on Algorithms and Computation (ISAAC)’ 98, Dec. 1998.

    Google Scholar 

  6. T. Eiter, T. Ibaraki, and K. Makino. On the Difference of Horn Theories. RUTCOR Research Report RRR 25-98, Rutgers University 1998.

    Google Scholar 

  7. G. Gogic, C. Papadimitriou, and M. Sideri. Incremental Recompilation of Knowledge. J. Artificial Intelligence Research, 8:23–37, 1998.

    MATH  MathSciNet  Google Scholar 

  8. D. S. Johnson, M. Yannakakis, and C. H. Papadimitriou. On Generating All Maximal Independent Sets. Information Processing Letters, 27:119–123, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  9. H. Katsuno and A. O. Mendelzon. Propositional Knowledge Base Revision and Minimal Change. Artificial Intelligence, 52:253–294, 1991.

    Article  MathSciNet  Google Scholar 

  10. H. Kautz, M. Kearns, and B. Selman. Reasoning With Characteristic Models. In Proc. AAAI’ 93, 1993.

    Google Scholar 

  11. H. Kautz and B. Selman. Knowledge Compilation and Theory Approximation. JACM, 43(2):193–224, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  12. D. Kavvadias, C. Papadimitriou, and M. Sideri. On Horn Envelopes and Hypergraph Transversals. In Proc. ISAAC’ 93, LNCS 762, pp. 399–405, 1993.

    Google Scholar 

  13. R. Khardon and D. Roth. Reasoning with Models. Art. Intelligence, 87(1/2):187–213, 1996.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut und Ludwig Wittgenstein Labor für Informations systeme, Technische Universität Wien, Treitlstraße 3, A-1040, Wien, Austria

    Thomas Eiter

  2. Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Kyoto, 606, Japan

    Toshihide Ibaraki

  3. Department of Systems and Human Science, Graduate School of Engineering Science, Osaka University, Toyonaka, Osaka, 560, Japan

    Kazuhisa Makino

Authors
  1. Thomas Eiter
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Toshihide Ibaraki
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kazuhisa Makino
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. FB IV - Informatik, Universität Trier, D-54286, Trier, Germany

    Christoph Meinel

  2. LIFL, Université de Lille I, Bătiment 3, F-59655, Villeneuve d’Ascq Cedex, France

    Sophie Tison

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Eiter, T., Ibaraki, T., Makino, K. (1999). On the Difference of Horn Theories. In: Meinel, C., Tison, S. (eds) STACS 99. STACS 1999. Lecture Notes in Computer Science, vol 1563. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49116-3_44

Download citation

  • DOI: https://doi.org/10.1007/3-540-49116-3_44

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65691-3

  • Online ISBN: 978-3-540-49116-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation