Redundancy in Logic II: 2CNF and Horn Propositional Formulae

Details Redundancy in Logic II: 2CNF and Horn Propositional Formulae Redundancy in Logic II: 2CNF and Horn Propositional Formulae

2005-06-17

arxiv.org/abs/cs/0506074v3

Computer Science

Artificial Intelligence

Corrected figures on Theorem 10; added and modified some references

Scientific paper

We report complexity results about redundancy of formulae in 2CNF form. We first consider the problem of checking redundancy and show some algorithms that are slightly better than the trivial one. We then analyze problems related to finding irredundant equivalent subsets (I.E.S.) of a given set. The concept of cyclicity proved to be relevant to the complexity of these problems. Some results about Horn formulae are also shown.

Affiliated with

Also associated with

No associations

Rating

Redundancy in Logic II: 2CNF and Horn Propositional Formulae does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Redundancy in Logic II: 2CNF and Horn Propositional Formulae, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Redundancy in Logic II: 2CNF and Horn Propositional Formulae will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-447996