Removing redundancy from a clause

DOI10.1016/0004-3702(93)90069-NMaRDI QIDQ685346zbMATH OpenWikidataFDO

Authors Christian G. Fermüller, Georg Gottlob

Publication date 31 October 1993

Published in Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

redundancy eliminationcondensingco-\(NP\)-completeredundant literals

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic programming (68N17) Logic in artificial intelligence (68T27)

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; zbMATH DE number 4164189
• Blocked clause elimination

Cites work

• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• scientific article; zbMATH DE number 3945370 (Why is no real title available?)
• scientific article; zbMATH DE number 4049047 (Why is no real title available?)
• scientific article; zbMATH DE number 3731310 (Why is no real title available?)
• scientific article; zbMATH DE number 3568056 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3640922 (Why is no real title available?)
• scientific article; zbMATH DE number 1142309 (Why is no real title available?)
• scientific article; zbMATH DE number 4114095 (Why is no real title available?)
• scientific article; zbMATH DE number 3415409 (Why is no real title available?)
• Bounded Query Classes
• Implication of clauses is undecidable
• New developments in structural complexity theory
• On the efficiency of subsumption algorithms
• Resolution Strategies as Decision Procedures
• Subsumption and implication
• The Concept of Weak Substitution in Theorem-Proving
• The Polynomial Time Hierarchy Collapses If the Boolean Hierarchy Collapses
• The complexity of facets (and some facets of complexity)
• The complexity of facets resolved
• The complexity of optimization problems

Cited in

(20)

• Minimizing the number of clauses by renaming
• On condensation of a clause.
• Revision by communication
• Semantic trees revisited: some new completeness results
• Inductive Logic Programming
• How to avoid the derivation of redundant clauses in reasoning systems
• Redundancy in logic. I: CNF propositional formulae
• On the query complexity of selecting minimal sets for monotone predicates
• Redundancy in logic. II: 2CNF and Horn propositional formulae
• Redundancy in logic. III: Non-monotonic reasoning
• Removing Redundant Arguments of Functions*
• Logical reduction of metarules
• On Generalization and Subsumption for Ordered Clauses
• Computing answers with model elimination
• Eliminating Redundant Clauses in SAT Instances
• Text redundancies
• The ghosts of forgotten things: a study on size after forgetting
• scientific article; zbMATH DE number 4164189 (Why is no real title available?)
• Recognition and dualization of disguised bidual Horn functions.
• On redundant topological constraints

Describes a project that uses

Uses Software

• Datalog

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)