Pages that link to "Item:Q1356213"
From MaRDI portal
The following pages link to Branch-and-cut solution of inference problems in propositional logic (Q1356213):
Displaying 19 items.
- A linear-time transformation of linear inequalities into conjunctive normal form (Q293409) (← links)
- Learning from conflicts in propositional satisfiability (Q427560) (← links)
- 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)
- What we can learn from conflicts in propositional satisfiability (Q2630816) (← links)
- Generating hard satisfiability problems (Q2674174) (← links)
- The satisfiability constraint gap (Q2674178) (← links)
- Simplifying clausal satisfiability problems (Q5096298) (← links)
