Show simple item record

dc.contributor.advisorRaut, Manoj Kumar
dc.contributor.authorAgarwal, Rishabh
dc.date.accessioned2018-05-17T09:29:56Z
dc.date.available2018-05-17T09:29:56Z
dc.date.issued2017
dc.identifier.citationRishabh Agarwal(2017).Algorithms For Computing Prime Implicates Using Distributivity And Labelled Resolution In Modal Logic.Dhirubhai Ambani Institute of Information and Communication Technology.vi, 24 p.(Acc.No: T00652)
dc.identifier.urihttp://drsr.daiict.ac.in//handle/123456789/688
dc.description.abstract"Modal Logic is used for Knowledge Representation and Reasoning in many problems. Suppose we have a knowledge Base(KB) and a Query (Q), the question here is whether KB j= Q or not. Knowledge Compilation is one of the techniques that have been proposed to deal with the computation intractability of such query answering problems. Knowledge Compilation (KC) techniques have been proposed successfully in Modal logic to overcome such logical entailment problem. So KC is split into two phases such as on-line and off-line. The KB is preprocessed in offline phase into another Knowledge Base KB0,where KB0 contains the set of prime implicates and queries are answered from KB0 in polynomial time. In this thesis, we have implemented the prime implicate computation algorithm [3] in modal logic. We have also suggested an algorithm to compute prime implicates using labelled resolution in modal logic and proved its correctness."
dc.publisherDhirubhai Ambani Institute of Information and Communication Technology
dc.subjectGenPI method
dc.subjectData structure
dc.subjectModal logic
dc.subjectKnowledge representation
dc.subjectAlgorithm
dc.classification.ddc511.3 AGA
dc.titleAlgorithms For Computing Prime Implicates Using Distributivity And Labelled Resolution In Modal Logic
dc.typeDissertation
dc.degreeM.Tech.
dc.student.id201511036
dc.accession.numberT00652


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record