No CrossRef data available.
Article contents
A SIMPLE ALGORITHM FOR DEDUCTION
Part of:
General logic
Published online by Cambridge University Press: 09 March 2010
Abstract
Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
It is shown that a simple deduction engine can be developed for a propositional logic that follows the normal rules of classical logic in symbolic form, but the description of what is known about a proposition uses two numeric state variables that conveniently describe unknown and inconsistent, as well as true and false. Partly true and partly false can be included in deductions. The multi-valued logic is easily understood as the state variables relate directly to true and false. The deduction engine provides a convenient standard method for handling multiple or complicated logical relations. It is particularly convenient when the deduction can start with different propositions being given initial values of true or false. It extends Horn clause based deduction for propositional logic to arbitrary clauses. The logic system used has potential applications in many areas. A comparison with propositional logic makes the paper self-contained.
MSC classification
- Type
- Research Article
- Information
- Copyright
- Copyright © Australian Mathematical Society 2010
References
[1]Belnap, N. D., “A useful four-valued logic”, in: Modern uses of multiple-valued logic, (eds Dunn, J. M. and Epstein, G.), (D Reidel Publishing, Dordrecht, Holland, 1975) 8–37.Google Scholar
[3]Bourg, D. M. and Seemann, G., AI for game developers (O’Reilly, Sebastopol, CA, 2004).Google Scholar
[4]Clay Mathematics Institute, , 2009. Millennium Problems, N vs NP.http://www.claymath.org/millennium/.Google Scholar
[5]Forgy, C., “Rete: a fast algorithm for the many pattern/many object pattern match problem”, Artificial Intelligence 19 (1982) 17–37.CrossRefGoogle Scholar
[6]Ginsberg, M. I., “Multivalued logics: a uniform approach to reasoning in artificial intelligence”, Comput. Intelligence 4 (1988) 265–316.CrossRefGoogle Scholar
[7]Hahnle, R., “Advanced many-valued logic”, in: Handbook of philosophical logic, 2nd ed, Volume 2 (eds Gabbay, D. M. and Guenthner, F.), (Kluwer Academic, Dordrecht, Holland, 2001) 297–395.CrossRefGoogle Scholar
[8]Hopgood, A. A., The state of artificial intelligence, Volume 65 of Advances in Computers (ed. Zelkowitz, M. V.), (Elsevier, Amsterdam, 2005) 1–75.Google Scholar
[9]Ramadas, S. N., Tweedie, A., O’Leary, L. and Hayward, G., A rule based design toll for ultrasonic transdusers and arrays, Paper #1091, International Congress on Ultrasonics, Vienna, Apr. 9–13, 2007, Session R252007.CrossRefGoogle Scholar
[10]Russell, S. J. and Norvig, P., Artificial intelligence: a modern approach (Pearson Education, London, 2003).Google Scholar
[11]Stanford Encyclopedia of Philosophy, , Paraconsistent. http://plato.stanford.edu/entries/logic-paraconsistent/.Google Scholar
[13]Urquhart, A., “Basic many-valued logic”, in: Handbook of philosophical logic, 2nd ed, Volume 2 (eds Gabbay, D. M. and Guenthner, F.), (Kluwer Academic, Dordrecht, 2001) 249–295.CrossRefGoogle Scholar
[14]Wikipedia, , 2009. Paraconsistent logic, http://en.wikipedia.org/wiki/Paraconsistent_logic.Google Scholar
[16]Wolf, R. G., “A survey of many-valued logic (1966–1974)”, in: Modern uses of multiple-valued logic, (eds Dunn, J. M. and Epstein, G.), (D Reidel Publishing, Dordrecht, 1975) 167–323.Google Scholar
You have
Access