A simple test improves checking satisfiability

DOI10.1016/0743-1066(93)90015-9zbMATH Open0787.68052OpenAlexW1968917402WikidataQ127363420 ScholiaQ127363420MaRDI QIDQ4036283FDOQ4036283

Authors: Eliezer L. Lozinskii 

Publication date: 16 May 1993

Published in: The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0743-1066(93)90015-9

Recommendations

• Solving the incremental satisfiability problem
• Algorithms for testing the satisfiability of propositional formulae
• scientific article; zbMATH DE number 956858
• scientific article; zbMATH DE number 956865
• Solving propositional satisfiability problems

zbMATH Keywords

NP-completesatisfiability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)

Cited In (6)

• Title not available (Why is that?)
• Simplify: a theorem prover for program checking
• Simplification in a satisfiability checker for VLSI applications
• Testing satisfiability
• Approximate reasoning with credible subsets
• Explaining by evidence

This page was built for publication: A simple test improves checking satisfiability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4036283)