Skip to main content

A Truly Declarative Prolog-Like Language

  • Chapter
Engineering Systems with Intelligence

Abstract

This paper presents a truly declarative Prolog-like language that is based on attribute grammars, and imposes no restriction on the ordering of the subgoals when writing a logic rule. The method is based on a multipass attribute grammar evaluator combined with an already developed methodology for relating attribute grammars and logic programming.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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. P. Deransart et.al,“Attribute Grammars”, Goos G., Hartnanis J., (Eds.), Springer-Verlag, 1988.

    Google Scholar 

  2. [2] D. E. Knuth, “Semantics of context free language?, Mathematical Systems Theory, vol 2, no 2, pp.127–145, 1968, and vol 5, no 1, pp.95–96, 1971.

    Article  MathSciNet  MATH  Google Scholar 

  3. G. Papakonstantinou, C. Moraitis, T. Panayiotopoulos, “An Attribute Grammar Interpreter as a Knowledge Engineering Tool”, Angewandte Informatik, 9/86, pp.382–388, 1986.

    Google Scholar 

  4. M. Sideri, S. Efremidis, G. Papakonstantinou, “Semantically Driven Parsing of Context-free Languages”, THE COMPUTER JOURNAL, vol 32, no 1, pp.91–93, 1989.

    Article  MATH  Google Scholar 

  5. T. Panayiotopoulos, G. Papakonstantinou, G. Stamatopoulos, “An Attribute Grammar Based Theorem Prover”, Information and Software Technology, vol 30, no 9, pp.553–560, November 1988.

    Article  Google Scholar 

  6. T. Panayiotopoulos, G. Papakonstantinou, N. M. Sgouros, “An Attribute Grammar interpreter for Inexact Reasoning”, Information and Software Technology, vol 32, no 5, pp.347–356, June 1990.

    Article  Google Scholar 

  7. R. Floyd, “The syntax of programming languages - a survey”, IEEE Transactions on Electronic Computers vol EG-13, no 4, pp.346–353, 1964.

    Article  Google Scholar 

  8. F. Jalili, “A general incremental evaluator for attribute grammars”, Science of Computer Programming, vol 5, pp.83–96, 1985.

    Article  MathSciNet  MATH  Google Scholar 

  9. L. Sterling, E. Shapiro, “The art of Prolog. Advanced programming techniques”, E.Shapiro (Ed), MIT Press, Cambridge, MA, USA, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Papakonstantinou, G., Panayiotopoulos, T., Sideri, M. (1991). A Truly Declarative Prolog-Like Language. In: Tzafestas, S.G. (eds) Engineering Systems with Intelligence. Microprocessor-Based and Intelligent Systems Engineering, vol 9. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-2560-4_6

Download citation

  • DOI: https://doi.org/10.1007/978-94-011-2560-4_6

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-5130-9

  • Online ISBN: 978-94-011-2560-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics