Algorithms for testing the satisfiability of propositional formulae
From MaRDI portal
Publication:3826123
Recommendations
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- A Computational Study of Satisfiability Algorithms for Propositional Logic
- Algorithms for testing satisfiability formulas
- Solving propositional satisfiability problems
- A satisfiability tester for non-clausal propositional calculus
Cited in
(53)- An \(O(n^ 2)\) algorithm for the satisfiability problem of a subset of propositional sentences in CNF that includes all Horn sentences
- Fast algorithms for testing unsatisfiability of ground Horn clauses with equations
- A satisfiability tester for non-clausal propositional calculus
- LTUR: A simplified linear-time unit resolution algorithm for Horn formulae and computer implementation
- Logic applied to integer programming and integer programming applied to logic
- An efficient algorithm for the 3-satisfiability problem
- On consistency in probabilistic logic for logical formulas represented by B-hypertrees
- New methods for computing inferences in first order logic
- Resolving contradictions: A plausible semantics for inconsistent systems
- Recognition of q-Horn formulae in linear time
- Embedding complex decision procedures inside an interactive theorem prover.
- Solving propositional satisfiability problems
- Variable and term removal from Boolean formulae
- A formal grammatical model of the resolution method for the propositional calculus
- Backtracking tactics in the backtrack method for SAT
- Directed hypergraphs and applications
- Partitioning methods for satisfiability testing on large formulas
- Satisfiability testing for Boolean formulas using -trees
- A new algorithm for the propositional satisfiability problem
- Branching rules for satisfiability
- Maximum renamable Horn sub-CNFs
- Some pitfalls for experimenters with random SAT
- The propositional formula checker HeerHugo
- Complexity issues in the Davis and Putnam scheme
- scientific article; zbMATH DE number 991069 (Why is no real title available?)
- scientific article; zbMATH DE number 3870637 (Why is no real title available?)
- A simple functional presentation and an inductive correctness proof of the Horn algorithm
- A note on Dowling and Gallier's top-down algorithm for propositional Horn satisfiability
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- scientific article; zbMATH DE number 4085614 (Why is no real title available?)
- On-line algorithms for polynomially solvable satisfiability problems
- A simple test improves checking satisfiability
- scientific article; zbMATH DE number 702472 (Why is no real title available?)
- A Computational Study of Satisfiability Algorithms for Propositional Logic
- An artificial neural network satisfiability tester
- Approximate reasoning with credible subsets
- scientific article; zbMATH DE number 1098495 (Why is no real title available?)
- scientific article; zbMATH DE number 1113999 (Why is no real title available?)
- Testing satisfiability
- scientific article; zbMATH DE number 1737608 (Why is no real title available?)
- Partitioning methods for satisfiability testing on large formulas
- Explaining by evidence
- Exploiting data dependencies in many-valued logics
- Directed hypergraphs: introduction and fundamental algorithms -- a survey
- Propositional calculus problems in CHIP
- About some UP-based polynomial fragments of SAT
- Towards the Use of Hypergraphs in Multi-adjoint Logic Programming
- scientific article; zbMATH DE number 956865 (Why is no real title available?)
- Algorithms for testing satisfiability formulas
- Determination of the class of validity of logical formulas by directed exhaustive search
- Fuzzy logic programs as hypergraphs. Termination results
- On-line algorithms for satisfiability problems with uncertainty
- On-line algorithms for satisfiability problems with uncertainty
This page was built for publication: Algorithms for testing the satisfiability of propositional formulae
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3826123)