Skip to main content Accessibility help
×
×
Home

A SIMPLE ALGORITHM FOR DEDUCTION

  • BILL WHITEN (a1)
Abstract

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.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      A SIMPLE ALGORITHM FOR DEDUCTION
      Available formats
      ×
      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      A SIMPLE ALGORITHM FOR DEDUCTION
      Available formats
      ×
      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      A SIMPLE ALGORITHM FOR DEDUCTION
      Available formats
      ×
Copyright
References
Hide All
[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) 837.
[2]Ben-Ari, M., Mathematical logic for computer science (Springer, London, 2004).
[3]Bourg, D. M. and Seemann, G., AI for game developers (O’Reilly, Sebastopol, CA, 2004).
[4]Clay Mathematics Institute, , 2009. Millennium Problems, N vs NP.http://www.claymath.org/millennium/.
[5]Forgy, C., “Rete: a fast algorithm for the many pattern/many object pattern match problem”, Artificial Intelligence 19 (1982) 1737.
[6]Ginsberg, M. I., “Multivalued logics: a uniform approach to reasoning in artificial intelligence”, Comput. Intelligence 4 (1988) 265316.
[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) 297395.
[8]Hopgood, A. A., The state of artificial intelligence, Volume 65 of Advances in Computers (ed. Zelkowitz, M. V.), (Elsevier, Amsterdam, 2005) 175.
[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.
[10]Russell, S. J. and Norvig, P., Artificial intelligence: a modern approach (Pearson Education, London, 2003).
[11]Stanford Encyclopedia of Philosophy, , Paraconsistent. http://plato.stanford.edu/entries/logic-paraconsistent/.
[12]Stern, A., Matrix logic (North Holland, Amsterdam, 1988).
[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) 249295.
[14]Wikipedia, , 2009. Paraconsistent logic, http://en.wikipedia.org/wiki/Paraconsistent_logic.
[15]Wikipedia, , 2009. NP-complete. http://en.wikipedia.org/wiki/NP-complete.
[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) 167323.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The ANZIAM Journal
  • ISSN: 1446-1811
  • EISSN: 1446-8735
  • URL: /core/journals/anziam-journal
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×
MathJax

Keywords

MSC classification

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed