Publication:2701980
From MaRDI portal
zbMath0966.03033MaRDI QIDQ2701980
Bernhard Beckert, Reiner Hähnle, Felip Manyà
Publication date: 5 July 2001
algorithms; satisfiability; logical language for knowledge representation; signed conjunctive normal form; signed literal
68Q25: Analysis of algorithms and problem complexity
68T30: Knowledge representation
03B70: Logic in computer science
Related Items
A first polynomial non-clausal class in many-valued logic, Learning general constraints in CSP, Binary resolution over Boolean lattices, On the refutational completeness of signed binary resolution and hyperresolution, Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers, Analytic tableaux for non-deterministic semantics, New complexity results for Łukasiewicz logic, Exploiting multivalued knowledge in variable selection heuristics for SAT solvers, An algorithm for random signed 3-SAT with intervals, Regular-SAT: A many-valued approach to solving combinatorial problems