Pages that link to "Item:Q2457681"

The following pages link to Redundancy in logic. I: CNF propositional formulae (Q2457681):

Displaying 22 items.

• On computing minimal independent support and its applications to sampling and counting (Q265701) (← links)
• Quantified maximum satisfiability (Q272016) (← links)
• Algorithms for computing minimal equivalent subformulas (Q460638) (← links)
• Counting minimal unsatisfiable subsets (Q832272) (← links)
• On redundant topological constraints (Q891795) (← links)
• Logical and algorithmic properties of stable conditional independence (Q985147) (← links)
• Minimal sets on propositional formulae. Problems and reductions (Q1677431) (← links)
• Understanding the complexity of axiom pinpointing in lightweight description logics (Q1680678) (← links)
• Semantic relevance (Q2104509) (← links)
• Logical reduction of metarules (Q2203321) (← links)
• On the complexity of inconsistency measurement (Q2321337) (← links)
• On preprocessing techniques and their impact on propositional model counting (Q2362107) (← links)
• Redundancy in logic. II: 2CNF and Horn propositional formulae (Q2389621) (← links)
• Redundancy in logic. III: Non-monotonic reasoning (Q2389660) (← links)
• Computing smallest MUSes of quantified Boolean formulas (Q2694579) (← links)
• BEACON: An Efficient SAT-Based Tool for Debugging $${\mathcal {EL}}{^+}$$ Ontologies (Q2818038) (← links)
• Efficient Reasoning for Inconsistent Horn Formulae (Q2835881) (← links)
• On Improving MUS Extraction Algorithms (Q3007681) (← links)
• SAT-Based Formula Simplification (Q3453233) (← links)
• Towards formal XAI: formally approximate minimal explanations of neural networks (Q6535352) (← links)
• Computing MUS-based inconsistency measures (Q6545579) (← links)
• The ghosts of forgotten things: a study on size after forgetting (Q6560989) (← links)