Artificial Intelligence
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
NP trees and Carnap's modal logic
Journal of the ACM (JACM)
On compact representations of propositional circumscription
Theoretical Computer Science
Minimum Covers in Relational Database Model
Journal of the ACM (JACM)
The size of a revised knowledge base
Artificial Intelligence
Compilability and compact representations of revision of Horn knowledge bases
ACM Transactions on Computational Logic (TOCL)
Strongly equivalent logic programs
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
On the semantics of updates in databases
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference
Theoretical Computer Science
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
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Approximating minimal unsatisfiable subformulae by means of adaptive core search
Discrete Applied Mathematics - The renesse issue on satisfiability
Lean clause-sets: generalizations of minimally unsatisfiable clause-sets
Discrete Applied Mathematics - The renesse issue on satisfiability
A survey on knowledge compilation
AI Communications
The equivalence problem for regular expressions with squaring requires exponential space
SWAT '72 Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)
Propositional independence: formula-variable independence and forgetting
Journal of Artificial Intelligence Research
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
Eliminating Redundant Clauses in SAT Instances
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Elimination of redundancy in ontologies
ESWC'11 Proceedings of the 8th extended semantic web conference on The semantic web: research and applications - Volume Part I
On improving MUS extraction algorithms
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
On deciding MUS membership with QBF
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Towards efficient MUS extraction
AI Communications - 18th RCRA International Workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”
On computing minimal equivalent subformulas
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
| Hi-index | 0.00 |
A knowledge base is redundant if it contains parts that can be inferred from the rest of it. We study some problems related to the redundancy of a CNF formula. In particular, any CNF formula can be made irredundant by deleting some of its clauses: what results is an irredundant equivalent subset. We study the complexity of problems related to irredundant equivalent subsets: verification, checking existence of an irredundant equivalent subset with a given size, checking necessary and possible presence of clauses in irredundant equivalent subsets, and uniqueness. We also consider the problem of redundancy with different definitions of equivalence.