Skip to main content
SpringerLink
Log in

On Condensation of a Clause

  • Conference paper
Inductive Logic Programming (ILP 2003)

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

Included in the following conference series:

Abstract

In this paper, we investigate condensation of a clause. First, we extend a substitution graph introduced by Scheffer et al. (1996) to a total matcher graph. Then, we give a correct proof of the relationship between subsumption and the existence of cliques in a total matcher graph. Next, we introduce the concept of width of a clique in a total matcher graph. As a corollary of the above relationship, we show that the minimum condensation of a clause is corresponding to the clique with the minimum width in a total matcher graph. Finally, we design a greedy algorithm of finding condensation of a clause, as the algorithm of finding cliques with as small width as possible from the total matcher graph of a clause.

This work is partially supported by Japan Society for the Promotion of Science, Grants-in-Aid for Encouragement of Young Scientists (B) 15700137 and for Scientific Research (B) 13558036.

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 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. Arimura, H.: Learning acyclic first-order Horn sentences from entailment. In: Li, M. (ed.) ALT 1997. LNCS (LNAI), vol. 1316, pp. 432–445. Springer, Heidelberg (1997)

    Google Scholar 

  2. Boppana, R., Halldórsson, M.M.: Approximating maximum independent sets by excluding subgraphs. BIT 32, 180–196 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  3. Baxter, L.D.: The complexity of unification, Doctoral Thesis, Department of Computer Science, University of Waterloo (1977)

    Google Scholar 

  4. Carraghan, R., Pardalos, P.: An exact algorithm for the maximum clique problem. Operations Research Letters 9, 375–382 (1990)

    Article  MATH  Google Scholar 

  5. Chang, C.-L., Lee, R.C.-T.: Symbolic logic and mechanical theorem proving. Academic Press, London (1973)

    MATH  Google Scholar 

  6. Chekuri, C., Rajaraman, A.: Conjunctive query containment revised. Theoretical Computer Science 239, 211–229 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  7. Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman and Company, New York (1979)

    MATH  Google Scholar 

  8. Gottlob, G., Fermüller, C.G.: Removing redundancy from a clause. Artificial Intelligence 61, 263–289 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  9. Horváth, T., Sloan, R.H., Turán, G.: Learning logic programs by using the product homomorphism method. In: Proc. 10th Annual Workshop on Computational Learning Theory, pp. 10–20 (1997)

    Google Scholar 

  10. Horváth, T., Turán, G.: Learning logic programs with structured background knowledge. In: de Raedt, L. (ed.) Advances in inductive logic programming, pp. 172–191. IOS Press, Amsterdam (1996)

    Google Scholar 

  11. Joyner, W.H.: Resolution strategies as decision procedures. Journal of the ACM 23, 398–417 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  12. Leitsch, A.: The resolution calculus. Springer, Heidelberg (1997)

    MATH  Google Scholar 

  13. Lloyd, J.W.: Foundations of logic programming (2nd extended edition). Springer, Heidelberg (1987)

    MATH  Google Scholar 

  14. Maloberti, J., Sebag, M.: θ-subsumption in a constraint satisfaction perspective. In: Rouveirol, C., Sebag, M. (eds.) ILP 2001. LNCS (LNAI), vol. 2157, pp. 164–178. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  15. Nienhuys-Cheng, S.-H., de Wolf, R. (eds.) Foundations of Inductive Logic Programming. LNCS (LNAI) , vol. 1228. Springer, Heidelberg (1997)

    Google Scholar 

  16. Plotkin, G.D.: A note on inductive generalization. Machine Intelligence 5, 153–163 (1970)

    MathSciNet  Google Scholar 

  17. Reddy, C., Tadepalli, P.: Learning first-order acyclic Horn programs from entailment. In: Proc. 15th International Conference on Machine Learning, pp. 472–480 (1998)

    Google Scholar 

  18. Reddy, C., Tadepalli, P.: Learning Horn definitions: Theory and application to planning. New Generation Computing 17, 77–98 (1999)

    Article  Google Scholar 

  19. Scheffer, T., Herbrich, R., Wysotzki, F.: Efficient θ-subsumption based on graph algorithms. In: ILP 1996. LNCS (LNAI), vol. 1314, pp. 212–228. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  20. van der Laag, P.R.J.: An analysis of refinement operators in inductive logic programming, Ph.D. Thesis, Tinbergen Institute (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Artificial Intelligence, Kyushu Institute of Technology, Kawazu 680-4, Iizuka, 820-8502, Japan

    Kouichi Hirata

Authors
  1. Kouichi Hirata
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Fraunhofer IAIS, Schloss Birlinghoven, Sankt Augustin, Germany

    Tamás Horváth

  2. Graduate School of Informatics, Kyoto University Yoshida Honmachi, 606-850, Sakyo-ku, Kyoto, Japan

    Akihiro Yamamoto

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hirata, K. (2003). On Condensation of a Clause. In: Horváth, T., Yamamoto, A. (eds) Inductive Logic Programming. ILP 2003. Lecture Notes in Computer Science(), vol 2835. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39917-9_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39917-9_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20144-1

  • Online ISBN: 978-3-540-39917-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation