Abstract
This chapter addresses the most important and widely used paradigm of expert systems: rule-based programming. Some practitioners identify rule-based systems with expert systems, because the most visible industrial successes of expert systems (and artificial intelligence) involve rule-based systems.
Cause and effect, means and ends, seed and fruit, cannot be severed; for the effect already blooms in the cause, the end pre-exists in the means, the fruit in the seed. Ralph Waldo Emerson, 1841
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
J. Backus, “The syntax and semantics of the proposed international algebraic language of the Zurich ACM-GAMM conference,” Proc. International Conf. on Information Processing, pp. 125–132, 1959.
N. Chomsky, “Three models for the description of languages,” IRE Trans, on Information Theory, 2:113–124.
N. Dershowitz and J.P. Jouannaud, “Rewrite Systems,” in J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science (Vol. B: Formal Models and Semantics), North-Holland, 1990.
C. Forgy, “Rete: A Fast Algorithm for the Many Pattern/Many Object Pattern Match Problem,” Artificial Intelligence, 1985, 19:17–37.
J. Giarratano and G. Riley, Expert systems: principles and programming, third edition, PWS Pub. Co., Boston (MA), 1998.
P. Z. Ingerman, “Panini-Backus form,” Communications of the ACM 10(3): 137, 1967.
J.E. Laird, A. Newell, and P.S. Rosenbloom, “Soar: An architecture for general intelligence,” Artificial Intelligence, 1987, 33(1):1–64.
A.A. Markov, Theory of Algorithms (translated by Jacques J. Schorr-Kon in 1962, Israel Program for Scientific Translations, Jerusalem), Russian original Teoriya algorifmov, Izdatel’stvo Akademii Nauk SSSR, Moskva-Leningrad, 1954.
C.K. Mohan, Negation in Equational Reasoning and Conditional Specifications, Ph.D. dissertation, Computer Science Dept., State University of New York at Stony Brook, Dec. 1988.
C.K. Mohan, “Priority Rewriting: Semantics, Confluence and Conditionals,” in Proc. 3rd Conf. on Rewriting Techniques and Applications (RTA), Chapel Hill (N.C.), Springer-Verlag LNCS 355, April 1989, pp. 278–291.
C.K. Mohan and M.K. Silvas, “Negation with Logical Variables in Conditional Rewriting,” in Proc. 3rd.Conf. on Rewriting Techniques and Applications (RTA), Chapel Hill (NC), Springer-Verlag LNCS 355, April 1989, pp. 292–310.
P. Naur (ed.), “Revised Report on the Algorithmic Language ALGOL 60,” Communications of the ACM, May 1960, 3(5):299–314.
Panini, Ashtadhyayi (Sanskrit Grammar), 5th century BC, est.
E. Post, Formal reductions of the general combinatorial decision problem, American J. of Math., 65:197–215, 1943.
J.A. Wentworth, R. Knaus, and H. Aougab, Verification, Validation and Evaluation of Expert Systems: An FHWA Handbook, Volume 1, Turner-Fairbank Highway Research Center, McLean VA (http://www.tfhrc.gov/advanc/we/cover.htm).
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Mohan, C.K. (2000). Rule Based Programming. In: Frontiers of Expert Systems. The Springer International Series in Engineering and Computer Science, vol 552. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-4509-5_4
Download citation
DOI: https://doi.org/10.1007/978-1-4615-4509-5_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7033-8
Online ISBN: 978-1-4615-4509-5
eBook Packages: Springer Book Archive