The incremental satisfiability problem for a two conjunctive normal form
From MaRDI portal
Publication:1744433
DOI10.1016/j.entcs.2016.11.004zbMath1401.68119OpenAlexW2561127804WikidataQ113317622 ScholiaQ113317622MaRDI QIDQ1744433
José A. Hernández, J. Raymundo Marcial-Romero, Guillermo de Ita Luna
Publication date: 23 April 2018
Full work available at URL: https://doi.org/10.1016/j.entcs.2016.11.004
satisfiability problem2-SATefficient satisfiability instancesentail propositional problemincremental satisfiability problem
Analysis of algorithms and problem complexity (68Q25) Classical propositional logic (03B05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Belief revision within fragments of propositional logic
- Prime forms and minimal change in propositional belief bases
- A bounded approximation for the minimum cost 2-sat problem
- Counting the number of solutions for instances of satisfiability
- Reasoning with models
- Ultimately Incremental SAT
- Minimum 2CNF Resolution Refutations in Polynomial Time
- Solving the incremental satisfiability problem
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing