Pages that link to "Item:Q3723723"

The following pages link to Linear-time algorithms for testing the satisfiability of propositional horn formulae (Q3723723):

Displaying 7 items.

• A decomposition method for CNF minimality proofs (Q392185) (← links)
• A subclass of Horn CNFs optimally compressible in polynomial time (Q693287) (← links)
• A linear algorithm for renaming a set of clauses as a Horn set (Q1318709) (← links)
• The complexity of propositional closed world reasoning and circumscription (Q1329160) (← links)
• Conjunctive-query containment and constraint satisfaction (Q1591157) (← links)
• A Conceptual Framework for Secrecy-preserving Reasoning in Knowledge Bases (Q2946749) (← links)
• Acquiring Generalized Domain-Range Restrictions (Q5445321) (← links)