Abstract
This chapter presents the theoretical base of extProlog. It is discussed as a logic programming language. It would therefore be convenient to start with the definition of logic programming; however, there is no formal definition of a logic programming language. It is commonly understood that a logic programming language is one that has the ultimate goal of providing clarity and declarativeness for programming. In general, a programming activity consists of two parts: design of the algorithm (heuristic) and its implementation in a language. The algorithm part can be further decomposed into a logic aspect and a control aspect. The logic aspect refers to the facts or data and the rules and requirements specifying what the algorithm does. The control aspect refers to how the algorithm can be implemented by arranging the rules and requirements in a particular order. The latter aspect becomes serious when the algorithm is modified.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Clocksin, W. F. and Mellish, C. S. (1997) Programming in Prolog, Springer.
Bridge, J. (1977) Beginning of Model Theory, Oxford University Press.
Maier, D. and Warren, D. S. (1988) Computing with Logic, Benjamin.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
(2006). extProlog as Logic Programming Language. In: Klir, G.J. (eds) Foundations and Applications of Mis. IFSR International Series on Systems Science and Engineering, vol 24. Springer, New York, NY. https://doi.org/10.1007/978-0-387-35840-6_17
Download citation
DOI: https://doi.org/10.1007/978-0-387-35840-6_17
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-31414-3
Online ISBN: 978-0-387-35840-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)