Skip to main content
SpringerLink
Log in
Book cover

Portuguese Conference on Artificial Intelligence

EPIA 1993: Progress in Artificial Intelligence pp 150–157Cite as

Regular languages and a class of logic programs

  • Conference paper
  • First Online:

  • 734 Accesses

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

Abstract

We show that the success set of a specific family of logic programs (having only monadic functors and monadic predicates) can be characterized by a regular language with star-height 0 or 1 and reciprocally that for every such set S there is a logic program belonging to the family whose success set is characterized by S.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Amihud and Y. Choueka. Loop programs and polinomially computable functions. International Journal of Computer Mathematics, Section A, 9:195–205, 1981.

    Google Scholar 

  2. R. M. Burstall and John Darlington. A transformation system for develloping recursive programs. Journal of the Association for Computing Machinery, 24(1):44–67, 1977.

    Google Scholar 

  3. Howard Blair, Wiktor Marek, Anil Nerode, and Jeffrey Remmel, editors. Informal Proceedings of the Workshop on Structural Complexity and Recursion-Theoretic Methods in Logic programming, Washigton DC, 1992.

    Google Scholar 

  4. John C., Cherniavsky. Simple programs realize exactly Presburger formulas. SIAM Journal on Computing, 5:666–677, 1976.

    Google Scholar 

  5. C. A. R. Hoare and D. C. S. Allison. Incomputability. Computing Surveys, 4:169–178, 1972.

    Google Scholar 

  6. K. Hashigushi. Algorithms for determining relative star height. Information and Control, 78:124–169, 1987.

    Google Scholar 

  7. John E. Hopcroft and Jeffrey D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, MA, 1979.

    Google Scholar 

  8. Takumi Kasai and Akeo Adachi. A characterization of time complexity by simple loop programs. Journal of Computer and System Sciences, 20:1–17, 1980.

    Google Scholar 

  9. Armando B. Matos. Some results on the complexity and decidability of restricted logic programs. Technical report, Centro de Informática, Universidade do Porto, 1992.

    Google Scholar 

  10. Elliot Mendelson. Introduction to Mathematical Logic. Van Nostrand, Princeton, 1966.

    Google Scholar 

  11. A. Meyer and D. Ritchie. The complexity of loop programs. In Proceedings of the 22nd National Conference of the ACM, pages 465–469, Washington, 1967.

    Google Scholar 

  12. Hartley Jr. Rogers. Theory of Recursive Functions and Effective Computation. McGraw Hill., New York, 1967.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIACC, Universidade do Porto, Rua do Campo Alegre 823, 4100, Porto, Portugal

    Armando B. Matos

Authors
  1. Armando B. Matos
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Miguel Filgueiras Luís Damas

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Matos, A.B. (1993). Regular languages and a class of logic programs. In: Filgueiras, M., Damas, L. (eds) Progress in Artificial Intelligence. EPIA 1993. Lecture Notes in Computer Science, vol 727. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57287-2_44

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57287-9

  • Online ISBN: 978-3-540-48036-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation