undefined

3-a) Consider a propositional clause in which we permit not more than one positive literal. Let us call this clause as X. Given a set of such clauses {X., X,.... X,} in which each of the clauses is made of literals {P, P2, ..... Pwrite an algorithm which takes such a set of clauses and verify if this is satisfiable. Ensure that this is the most efficient possible. Given a clause 1000000 terms involving 25000 literals, explain what will be the run time of your algorithm? [4 M] This is about a faster way to satisfy a set of horn clauses. [1.5 M if you could understand this ] This can be done using forward chaining in linear time. [1.5 M, if you could figure out that forward chaining can solve it in linear time ] Algorithms which are more complex than just a linear time are not accepted. [1 M - for specify,that this can solve it in linear time for the numbers given] 3-a) Consider a propositional clause in which we permit not more than one positive literal. Let us call this clause as X. Given a set of such clauses {X., X,.... X,} in which each of the clauses is made of literals {P, P2, ..... Pwrite an algorithm which takes such a set of clauses and verify if this is satisfiable. Ensure that this is the most efficient possible. Given a clause 1000000 terms involving 25000 literals, explain what will be the run time of your algorithm? [4 M] This is about a faster way to satisfy a set of horn clauses. [1.5 M if you could understand this ] This can be done using forward chaining in linear time. [1.5 M, if you could figure out that forward chaining can solve it in linear time ] Algorithms which are more complex than just a linear time are not accepted. [1 M - for specify,that this can solve it in linear time for the numbers given]