Menu
Home
Contact us
Stats
Categories
Calendar
Toggle Wiki
Wiki Home
Last Changes
Rankings
List pages
Orphan pages
Sandbox
Print
Toggle Image Galleries
Galleries
Rankings
Toggle Articles
Articles home
List articles
Rankings
Toggle Blogs
List blogs
Rankings
Toggle Forums
List forums
Rankings
Toggle File Galleries
List galleries
Rankings
Toggle Maps
Mapfiles
Toggle Surveys
List surveys
Stats
PARTIAL DEDUCTION IN PREDICATE CALCULUS AS A TOOL FOR ARTIFICIAL INTELLIGENCE...
By: Tatiana M. Kosovskaya (1895 reads)
Rating: (1.00/10)

Abstract: Many artificial intelligence problems are NP-complete ones. To decrease the needed time of such a problem solving a method of extraction of sub-formulas characterizing the common features of objects under consideration is suggested. This method is based on the offered by the author notion of partial deduction. Repeated application of this procedure allows to form a level description of an object and of classes of objects. A model example of such a level description and the degree of steps number increasing is presented in the paper.

Keywords: Artificial Intelligence, pattern recognition, predicate calculus, level description of a class

Link:

PARTIAL DEDUCTION IN PREDICATE CALCULUS AS A TOOL FOR ARTIFICIAL INTELLIGENCE PROBLEM COMPLEXITY DECREASING

Tatiana M. Kosovskaya

http://www.foibg.com/ijima//vol05/ijima05-03-p05.pdf

Print
Login
[ register | I forgot my password ]
World Clock
Powered by Tikiwiki Powered by PHP Powered by Smarty Powered by ADOdb Made with CSS Powered by RDF powered by The PHP Layers Menu System
RSS Wiki RSS Blogs rss Articles RSS Image Galleries RSS File Galleries RSS Forums RSS Maps rss Calendars
[ Execution time: 0.07 secs ]   [ Memory usage: 7.48MB ]   [ GZIP Disabled ]   [ Server load: 0.15 ]
Powered by Tikiwiki CMS/Groupware