Minimal representation of directed hypergraphs
SIAM Journal on Computing
The complexity of facets resolved
Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
Removing redundancy from a clause
Artificial Intelligence
Optimal compression of propositional Horn knowledge bases: complexity and approximation
Artificial Intelligence
Approximating the Minimum Equivalent Digraph
SIAM Journal on Computing
Minimum Covers in Relational Database Model
Journal of the ACM (JACM)
Generating all maximal models of a Boolean expression
Information Processing Letters
Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference
Theoretical Computer Science
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
The Minimization Problem for Boolean Formulas
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
The Minimum Equivalent DNF Problem and Shortest Implicants
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Approximating minimal unsatisfiable subformulae by means of adaptive core search
Discrete Applied Mathematics - The renesse issue on satisfiability
Extension and Equivalence Problems for Clause Minimal Formulae
Annals of Mathematics and Artificial Intelligence
Graph Minors. XX. Wagner's conjecture
Journal of Combinatorial Theory Series B - Special issue dedicated to professor W. T. Tutte
Improving exact algorithms for MAX-2-SAT
Annals of Mathematics and Artificial Intelligence
Redundancy in logic I: CNF propositional formulae
Artificial Intelligence
Complexity Results for 2CNF Default Theories
Fundamenta Informaticae
Detecting redundant production rules
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Minimum witnesses for unsatisfiable 2CNFs
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Redundancy in logic III: Non-monotonic reasoning
Artificial Intelligence
Rewriting (dependency-)quantified 2-CNF with arbitrary free literals into existential 2-HORN
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.00 |
We report results about the redundancy of formulae in 2CNF form. In particular, we give a slight improvement over the trivial redundancy algorithm and give some complexity results about some problems related to finding Irredundant Equivalent Subsets (i.e.s.) of 2CNF formulae. The problems of checking whether a 2CNF formula has a unique i.e.s. and checking whether a clause in is all its i.e.s.'s are polynomial. Checking whether a 2CNF formula has an i.e.s. of a given size and checking whether a clause is in some i.e.s.'s of a 2CNF formula are polynomial or NP-complete depending on whether the formula is cyclic. Some results about Horn formulae are also reported.