Solving Satisfiability with Less Searching

DOI10.1109/TPAMI.1984.4767555MaRDI QIDQ3335000zbMATH OpenWikidataFDO

Authors Paul Walton jun. Purdom

Publication date 1984

Published in IEEE Transactions on Pattern Analysis and Machine Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TPAMI.1984.4767555

zbMATH Keywords

complement searchingconjunctive normal form predicatesconstraint satisfactionDavis-Putnam procedurepure literalssatisfiabilitySearch treessubtrees

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Solving propositional satisfiability problems
• scientific article; zbMATH DE number 956858
• A Computational Study of Satisfiability Algorithms for Propositional Logic
• Theory and Applications of Satisfiability Testing
• scientific article; zbMATH DE number 1008453

Cited in

(24)

• Polynomial-average-time satisfiability problems
• An efficient algorithm for the 3-satisfiability problem
• Ordered model trees: A normal form for disjunctive deductive databases
• Solving propositional satisfiability problems
• Heuristic search and pruning in polynomial constraints satisfaction
• Optimizing with minimum satisfiability
• New methods for 3-SAT decision and worst-case analysis
• On a generalization of extended resolution
• CHAMP: a multipass algorithm for Max Sat based on saver variables
• Solving satisfiability using decomposition and the most constrained subproblem
• Simulating circuit-level simplifications on CNF
• scientific article; zbMATH DE number 5575002 (Why is no real title available?)
• Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences
• scientific article; zbMATH DE number 4049072 (Why is no real title available?)
• Solving the incremental satisfiability problem
• An artificial neural network satisfiability tester
• scientific article; zbMATH DE number 2084724 (Why is no real title available?)
• CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability
• Searching with iterated maps
• Present and Future of Practical SAT Solving
• Theory and Applications of Satisfiability Testing
• A logical framework for depiction and image interpretation
• Solving satisfiability problems with preferences
• New methods for proving the impossibility to solve problems through reduction of problem spaces

This page was built for publication: Solving Satisfiability with Less Searching

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