Branch-and-cut solution of inference problems in propositional logic
From MaRDI portal
Recommendations
- Resolution vs. cutting plane solution of inference problems: Some computational experience
- Generalized resolution for 0--1 linear inequalities
- A Computational Study of Satisfiability Algorithms for Propositional Logic
- An exact algorithm for the constraint satisfaction problem: Application to logical inference
Cites work
- scientific article; zbMATH DE number 4053069 (Why is no real title available?)
- scientific article; zbMATH DE number 3568056 (Why is no real title available?)
- A Computing Procedure for Quantification Theory
- Input Proofs and Rank One Cutting Planes
- LTUR: A simplified linear-time unit resolution algorithm for Horn formulae and computer implementation
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Polynomial-average-time satisfiability problems
- Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
- Resolution vs. cutting plane solution of inference problems: Some computational experience
- Solving propositional satisfiability problems
- Some results and experiments in programming techniques for propositional logic
- The complexity of theorem-proving procedures
- The pivot and probe algorithm for solving a linear program
Cited in
(24)- Computational experience with an interior point algorithm on the satisfiability problem
- MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
- Recognition of \(q\)-Horn formulae in linear time
- scientific article; zbMATH DE number 1113999 (Why is no real title available?)
- Learning from conflicts in propositional satisfiability
- Branching rules for satisfiability
- New methods for computing inferences in first order logic
- The \(Multi\)-SAT algorithm
- Resolution vs. cutting plane solution of inference problems: Some computational experience
- Running time experiments on some algorithms for solving propositional satisfiability problems
- A complete adaptive algorithm for propositional satisfiability
- Testing heuristics: We have it all wrong
- An exact algorithm for the constraint satisfaction problem: Application to logical inference
- A new algorithm for the propositional satisfiability problem
- Optimization methods in logic
- Generating hard satisfiability problems
- The satisfiability constraint gap
- MaxSAT-based cutting planes for learning graphical models
- Many-valued logic and mixed integer programming
- A linear-time transformation of linear inequalities into conjunctive normal form
- What we can learn from conflicts in propositional satisfiability
- GD-SAT model and crossover line
- Easy problems are sometimes hard
- Simplifying clausal satisfiability problems
This page was built for publication: Branch-and-cut solution of inference problems in propositional logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1356213)
