Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

An Efficient Derivation for Elementary Formal Systems Based on Partial Unification

  • Conference paper
  • First Online:
Discovery Science (DS 2001)

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

Included in the following conference series:

  • 401 Accesses

Abstract

An EFS is a kind of logic programs expressing various formal languages. We propose an efficient derivation for EFS’s called an S-derivation, where every possible unifiers are evaluated at one step of the derivation. In the S-derivation, each unifier is partially applied to each goal clause by assigning variables whose values are uniquely determined from the set of all possible unifiers. This contributes to reduce the number of backtracking, and thus the S-derivation works efficiently. In this paper, the S-derivation is shown to be complete for the class of regular EFS’s. We implement an EFS interpreter based on the S-derivation in Prolog programming language, and compare the parsing time with that of DCG provided by the Prolog interpreter. As the results of experiments, we verify the efficiency of the S-derivation for accepting context-free languages.

The research reported here is partially supported by the Telecommunication Adbancement Foundation, Japan.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. A. V. Aho and M. J. Corasick: Efficient string matching: An aid to bibliographic search, Communication of the ACM 18, No.6, 333–340 (1975).

    Article  MATH  MathSciNet  Google Scholar 

  2. S. Arikawa, S. Miyano, A. Shinohara, T. Shinohara, and A. Yamamoto: Algorithmic learning theory with elementary formal systems, IEICE Transaction on Information and Systems E75-D, 405–414 (1992).

    Google Scholar 

  3. S. Arikawa, T. Shinohara, and A. Yamamoto: Learning elementary formal systems, Theoretical Computer Science 95, 97–113 (1992).

    Article  MATH  MathSciNet  Google Scholar 

  4. N. Harada, S. Arikawa, and H. Ishizaka: A Class of elementary formal systems that has an efficient parsing algorithm, Information Modeling and Knowledge Bases IX, 89–101 (1997).

    Google Scholar 

  5. J. Jaffar: Minimal and complete word unification, Journal of the ACM 37, 47–85 (1990).

    Article  MATH  MathSciNet  Google Scholar 

  6. D. Kapur: Complexity of unification problems with associative-commutative operation, Journal of Automated Reasoning 9, 261–288 (1992).

    Article  MATH  MathSciNet  Google Scholar 

  7. J. W. Lloyd: Foundations of logic programming (second edition), Springer-Verlag (1987).

    Google Scholar 

  8. Y. Mukouchi and S. Arikawa: Towards a mathematical theory of machine discovery from facts, Theoretical Computer Science 137, 53–84 (1995).

    Article  MATH  MathSciNet  Google Scholar 

  9. T. Shinohara: Inductive inference on monotonic formal systems from positive data, New Generation Computing 8, 371–384 (1991).

    Article  MATH  Google Scholar 

  10. T. Shinohara: Rich classes inferable from positive data: Length-bounded elementary formal system, Information and Computation 108, 175–186 (1994).

    Article  MATH  MathSciNet  Google Scholar 

  11. R. Smullyan: Theory of formal systems, Princeton Univ. Press, Princeton (1961).

    MATH  Google Scholar 

  12. N. Sugimoto, K. Hirata and H. Ishizaka: Constructive learning of translations based on dictionaries, In Proceedings of the Seventh International Workshop on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence 1160, 177–184(1996).

    Google Scholar 

  13. N. Sugimoto: Learnability of translations from positive examples, In Proceedings of the Ninth International Conference on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence 1501, 169–178 (1998).

    Google Scholar 

  14. N. Sugimoto and H. Ishizaka: Generating languages by a derivation procedure for elementary formal systems, Information Processing Letters 69, 161–166 (1999).

    Article  MathSciNet  Google Scholar 

  15. A. Yamamoto: Procedural semantics and negative information of elementary formal system, Journal of Logic Programming 13, 89–97 (1992).

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Noriko Sugimoto, Hiroki Ishizaka & Takeshi Shinohara

Authors
  1. Noriko Sugimoto
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hiroki Ishizaka
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Takeshi Shinohara
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. DFKI GmbH Saarbrücken, 66123, Saarbrücken, Germany

    Klaus P. Jantke

  2. Department of Informatics, Kyushu University, 6-10-1 Hakozaki, Higashi-ku, 812-8581, Fukuoka, Japan

    Ayumi Shinohara

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sugimoto, N., Ishizaka, H., Shinohara, T. (2001). An Efficient Derivation for Elementary Formal Systems Based on Partial Unification. In: Jantke, K.P., Shinohara, A. (eds) Discovery Science. DS 2001. Lecture Notes in Computer Science(), vol 2226. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45650-3_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-45650-3_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42956-2

  • Online ISBN: 978-3-540-45650-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation