Removing redundancy from a clause
From MaRDI portal
Publication:685346
DOI10.1016/0004-3702(93)90069-NzbMATH Open0779.68015WikidataQ59259767 ScholiaQ59259767MaRDI QIDQ685346FDOQ685346
Authors: Christian G. Fermüller, Georg Gottlob 
Publication date: 31 October 1993
Published in: Artificial Intelligence (Search for Journal in Brave)
Recommendations
- Eliminating Redundant Clauses in SAT Instances
- Minimizing the number of clauses by renaming
- Elimination of self-resolving clauses
- Preprocessing of propagation redundant clauses
- Preprocessing of propagation redundant clauses
- Removing Redundant Arguments of Functions*
- An Operator for Removal of Subsumed Clauses
- scientific article
- Blocked clause elimination
Analysis of algorithms and problem complexity (68Q25) Logic programming (68N17) Logic in artificial intelligence (68T27)
Cites Work
- Title not available (Why is that?)
- The complexity of optimization problems
- The complexity of facets resolved
- Title not available (Why is that?)
- Title not available (Why is that?)
- New developments in structural complexity theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- The complexity of facets (and some facets of complexity)
- Bounded Query Classes
- The Polynomial Time Hierarchy Collapses If the Boolean Hierarchy Collapses
- Subsumption and implication
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Resolution Strategies as Decision Procedures
- Title not available (Why is that?)
- On the efficiency of subsumption algorithms
- Implication of clauses is undecidable
- Title not available (Why is that?)
- The Concept of Weak Substitution in Theorem-Proving
Cited In (20)
- Revision by communication
- On the query complexity of selecting minimal sets for monotone predicates
- The ghosts of forgotten things: a study on size after forgetting
- Inductive Logic Programming
- Text redundancies
- Eliminating Redundant Clauses in SAT Instances
- Minimizing the number of clauses by renaming
- On Generalization and Subsumption for Ordered Clauses
- Computing answers with model elimination
- On redundant topological constraints
- Redundancy in logic. I: CNF propositional formulae
- Removing Redundant Arguments of Functions*
- On condensation of a clause.
- Semantic trees revisited: Some new completeness results
- Logical reduction of metarules
- Redundancy in logic. II: 2CNF and Horn propositional formulae
- Redundancy in logic. III: Non-monotonic reasoning
- Title not available (Why is that?)
- How to avoid the derivation of redundant clauses in reasoning systems
- Recognition and dualization of disguised bidual Horn functions.
Uses Software
This page was built for publication: Removing redundancy from a clause
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685346)
