scientific article; zbMATH DE number 3870637
From MaRDI portal
Publication:3336732
zbMATH Open0546.68074MaRDI QIDQ3336732FDOQ3336732
Publication date: 1984
Title of this publication is not available (Why is that?)
Recommendations
- A satisfiability tester for non-clausal propositional calculus
- Algorithms for testing the satisfiability of propositional formulae
- Algorithms for testing satisfiability formulas
- Solving satisfiability in less than \(2^ n\) steps
- An algorithm for the satisfiability problem of formulas in conjunctive normal form
Learning and adaptive systems in artificial intelligence (68T05) Classical propositional logic (03B05) Mechanization of proofs and logical operations (03B35)
Cited In (7)
- A satisfiability tester for non-clausal propositional calculus
- Satisfiability Checking of Non-clausal Formulas Using General Matings
- FUNCTIONAL PEARL Functional satisfaction
- Simplification in a satisfiability checker for VLSI applications
- Title not available (Why is that?)
- Boolean unification - the story so far
- An optimality result for clause form translation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3336732)
