Removing redundancy from a clause

DOI10.1016/0004-3702(93)90069-NzbMath0779.68015WikidataQ59259767 ScholiaQ59259767MaRDI QIDQ685346

Christian G. Fermüller, Georg Gottlob

Publication date: 31 October 1993

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

condensingredundancy eliminationco-\(NP\)-completeredundant literals

Mathematics Subject Classification ID

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

Related Items

Redundancy in logic. II: 2CNF and Horn propositional formulae, Redundancy in logic. III: Non-monotonic reasoning, Revision by communication, On redundant topological constraints, Computing answers with model elimination, Logical reduction of metarules, Redundancy in logic. I: CNF propositional formulae, Semantic trees revisited: Some new completeness results, On Generalization and Subsumption for Ordered Clauses, Recognition and dualization of disguised bidual Horn functions., On the query complexity of selecting minimal sets for monotone predicates

Uses Software

• Datalog

Cites Work

• New developments in structural complexity theory
• The complexity of facets (and some facets of complexity)
• Subsumption and implication
• The complexity of optimization problems
• The complexity of facets resolved
• Implication of clauses is undecidable
• Bounded Query Classes
• On the efficiency of subsumption algorithms
• The Polynomial Time Hierarchy Collapses If the Boolean Hierarchy Collapses
• Resolution Strategies as Decision Procedures
• The Concept of Weak Substitution in Theorem-Proving
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item