Pages that link to "Item:Q1356213"

The following pages link to Branch-and-cut solution of inference problems in propositional logic (Q1356213):

Displayed 14 items.

• Computational experience with an interior point algorithm on the satisfiability problem (Q753688) ‎ (← links)
• New methods for computing inferences in first order logic (Q1309900) ‎ (← links)
• An exact algorithm for the constraint satisfaction problem: Application to logical inference (Q1313760) ‎ (← links)
• Recognition of \(q\)-Horn formulae in linear time (Q1337669) ‎ (← links)
• Easy problems are sometimes hard (Q1342226) ‎ (← links)
• A complete adaptive algorithm for propositional satisfiability (Q1811072) ‎ (← links)
• A new algorithm for the propositional satisfiability problem (Q1894360) ‎ (← links)
• Running time experiments on some algorithms for solving propositional satisfiability problems (Q1897402) ‎ (← links)
• Branching rules for satisfiability (Q1904401) ‎ (← links)
• Testing heuristics: We have it all wrong (Q1922626) ‎ (← links)
• Many-valued logic and mixed integer programming (Q1924752) ‎ (← links)
• The \(Multi\)-SAT algorithm (Q1961449) ‎ (← links)
• MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability (Q2457672) ‎ (← links)
• GD-SAT model and crossover line (Q4784347) ‎ (← links)