If to compare the existing general purpose theorem provers, which efficiency is more than modest, and human way of reasoning, which is incomparably more efficient, one can see some principal distinction in knowledge organization in both cases. We give a no
MinimizingEntropyofKnowledgeRepresentaion
AnatolSlissenko1
Dept.ofInformatics,UniversityParis-12,France
and
InstituteforInformatics,AcademyofSciencesofRussia,
St-Petersburg,Russia
Abstract
Iftocomparetheexistinggeneralpurposetheoremprovers,whiche ciencyismorethanmodest,andhumanwayofreasoning,whichisincomparablymoree cient,onecanseesomeprincipaldistinctioninknowledgeorganizationinbothcases.Wegiveanotionofentropywhichpermitstosetupathesisthatane cientknowledgeorganizationadherestotheprincipleofminimizingtheentropy.Withinthesameframeworkonecande nevariousquantitativecharacteristicsofsystemsofknowledge.Apracticalconsequenceofthispointofviewisstrategy-orientedarchitectureoftheoremprovers.Wementionanexperimentalimplementationofsuchanarchitecturethatdemonstratedpromisingresults.
0.Introduction
Thetopicunderconsiderationismotivatedbyine ciencyofautomatictheorem-proversclearlyunderstoodalreadyinthe60ies.Sincethentherewerenoprincipalprogressinthedevelop-mentofarchitecturesoftheoremprovers,thoughthemodernones(onecan ndmanyreferenciesatdoc.guandang.net)areincomparablymorepowerfulthenthosemadebypioneers[AR83a,AR83b].Buttherelativepowerofmoderntheoremproversisaconsequenceofdevelopmentofcomputersandprogrammingbutnotoffundamentalideas.Thestrategyusedeveninmoderntheoremproversrepresentgeneralsyntacticobservationsthatpracti-callydoplaynoroleinnontrivialproofs.Theyareequallyapplicabletoanydomain.Ontheotherhand,tolearntoreasoninaparticulardomaintakesalotoftime,andmoreover,thestructureofknowledgeofanyparticulardomaindevelops,aswellasmethodsofsearchforproofs,asaresultofconsiderableintellectualinvestments.E.g.compareatwopageformalisationofcalculusandahandbookonthesamesubject.Theoreticalpropertiesofmoreorlesspowerfullogicsthatrep-resentourknowledge,inparticulartheiruniversality,signifythatnogeneralpurposeproofsearchcanbee cient.Theuniversalitymeansthatanyalgorithmicdi cultycanbemodeledintheselogics;thereareevenindividualprovablepropositionsthatarehardtohandle(cf.[Sli75]).Theseconsiderationsmeanthattheonlywaytoachievethee ciencyofproofsearchistoorganizethebasicknowledgeofconcretedomainsandtheknowledgeaboutproofsearchinthesedomainsinane cientway.Butconstructingsuchaknowledgerepresentationneedsadequatetoolstorestructurethisknowledge.Wearegoingtodiscussonetheoreticalpointofviewandonepracticalapproachtodevelopsuchtools.
Inthepresentcommunicationwebrie ydevelopasystemofnotionsthatpermitstogivequantitativecharacteristicsofsystemsofknowledgerepresentation.Thelatterarerepresentedasinferencesystemsde nedinSection1.TheninSection2weintroduceproofcomplexitythatcanservetode nevariousmeasuresofqualityofsystemsofknowledgerepresentation(see[Sli91]).Herewespeakonlyaboutentropy.ThelastSection3touchesastrategybasedtheoremproving.Address:Dept.ofInformatics,UniversityParis-12,61Av.duG´en.deGaulle,94010,Cr´eteil,France.E-mail:slissenko@univ-paris12.fr1
UK Elena Shalfeeva Institute for Automation and Control Processes, Russian Academy of Sciences, Vladivostok, Russia Abstract There are many different types ...
France and Institute for Informatics, Academy of Sciences of Russia, St-Petersburg, Russia Anatol Slissenko2 Abstract We consider a class of algorithms ...
Slovak Academy of Scienc... 暂无评价 19页 免费 Institute of Informatics... 暂无评价 10页 免费 Academy of Sciences of 8页 免费 Academy of Sciences ...
Bulgarian Academy of Sci... 暂无评价 5页 免费 Institute of Biophysics,....Departmentof Applied Informatics,TechnicalUniversityof Gdafisk,U1. G. ...
LPDP { Bulgarian Academy... 暂无评价 13页 免费 Institute of Biophysics,....Reports in Informatics 30, Deptartment of Informatics, University of Bergen, ...
Turbin St.-Petersburg Institute for Informatics and Automation Russian Academy of Sciences 39, 14-th Line, 199178, St.-Petersburg, Russia, e-mail:smir@...
St. Petersburg Institute for Informatics and Automation of the Academy of Sciences of Russia, 14th line 39, St. Petersburg 199178, Russia. Research ...
Kamalian Institute for Informatics and Automation Problems of National Academy of Sciences of Armenia, 0014, Armenia Ijevan Branch of Yerevan State University ...
T.Levashova & A.Krizhanovsky St.Petersburg Institute for Informatics and Automation of the Russian Academy of Sciences St.Petersburg, Russia ABSTRACT: ...
26 no. 20 2010, pages 2622–2623 doi:10.1093/bioinformatics/btq488 ...Institute of Molecular Biology, Russian Academy of Sciences, Moscow 119991, ...
热门文档