The incremental satisfiability problem for a two conjunctive normal form

DOI10.1016/J.ENTCS.2016.11.004MaRDI QIDQ1744433zbMATH OpenOpenAlexWikidataFDO

Authors J. Raymundo Marcial-Romero, José Hernández, Guillermo de Ita Luna

Publication date 23 April 2018

Full work available at URL https://doi.org/10.1016/j.entcs.2016.11.004

zbMATH Keywords

satisfiability problem2-SATefficient satisfiability instancesentail propositional problemincremental satisfiability problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Classical propositional logic (03B05)

Recommendations

• Solving the incremental satisfiability problem
• scientific article; zbMATH DE number 1775484
• Artificial Intelligence and Symbolic Computation
• An Incremental Branch-and-Bound Method for the Satisfiability Problem
• On-line algorithms for polynomially solvable satisfiability problems

Cites work

• scientific article; zbMATH DE number 3976991 (Why is no real title available?)
• scientific article; zbMATH DE number 140403 (Why is no real title available?)
• A bounded approximation for the minimum cost 2-sat problem
• Belief revision within fragments of propositional logic
• Counting the number of solutions for instances of satisfiability
• Minimum 2CNF Resolution Refutations in Polynomial Time
• Prime forms and minimal change in propositional belief bases
• Reasoning with models
• Solving the incremental satisfiability problem
• Temporal induction by incremental SAT solving
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Ultimately incremental SAT

Cited in

(3)

• scientific article; zbMATH DE number 4049072 (Why is no real title available?)
• Solving the incremental satisfiability problem
• An Incremental Branch-and-Bound Method for the Satisfiability Problem

Describes a project that uses

Uses Software

• MiniSat
• Zchaff2004
• SMT-LIB
• SATIRE

This page was built for publication: The incremental satisfiability problem for a two conjunctive normal form

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