Removing redundancy from a clause☆
References (28)
Subsumption and implication
Inf. Process. Lett.
(1987)New developments in structural complexity theory
Theor. Comput. Sci.
(1990)The complexity of optimization problems
J. Comput. Syst. Sci.
(1988)- et al.
The complexity of facets resolved
J. Comput. Syst. Sci.
(1988) - et al.
The complexity of facets (and some facets of complexity)
J. Comput. Syst. Sci.
(1984) Implication of clauses is undecidable
Theor. Comput. Sci.
(1988)The NP-completeness of subsumption
(1977)- et al.
What you always wanted to know about datalog (and never dared to ask)
IEEE Trans. Knowl. Data Eng.
(1989) - et al.
Surveys in Computer Science
- et al.
On the complexity of clause condensing
Cited by (50)
On the query complexity of selecting minimal sets for monotone predicates
2016, Artificial IntelligenceCitation Excerpt :In the case of positive answers, the SAT solver also returns a satisfying truth assignment (i.e. a witness). The ability of the SAT solver to return a witness on positive answers can have a profound impact on query complexity characterizations of function problems (related results have actually been investigated in the past, e.g. [16,17]). This article shows that for some function problems, the availability of witnesses enables reducing the worst case number of oracle queries from polynomial to logarithmic.
On redundant topological constraints
2015, Artificial IntelligenceCitation Excerpt :Redundancy checking is an important task in AI research, in particular in knowledge representation and reasoning. For example, Ginsberg [21] and Schmolze and Snyder [44] designed algorithms for checking redundancy of knowledge bases; Gottlob and Fermüller [22] and Liberatore [32] analysed the computational properties of removing redundancy from a clause and a CNF formula, respectively; and Grimm and Wissmann [23] considered checking redundancy of ontologies. An extended abstract [15] of this paper was presented in KR-2014.
Intensional dynamic programming. A Rosetta stone for structured dynamic programming
2009, Journal of AlgorithmsRedundancy in logic III: Non-monotonic reasoning
2008, Artificial IntelligenceRedundancy in logic II: 2CNF and Horn propositional formulae
2008, Artificial IntelligenceRedundancy in logic I: CNF propositional formulae
2005, Artificial Intelligence
- ☆
This paper improves and extends earlier results of the first author presented in [9]. The work has been carried out in the context of the Christian Doppler Research Laboratory for Expert Systems.