scientific article; zbMATH DE number 1775484

zbMath0992.03014MaRDI QIDQ4542611

Felip Manyà

Publication date: 4 August 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

many-valued logicsatisfiabilitydecision procedure2-SAT problemsigned CNF formulas

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35) Complexity of computation (including implicit computational complexity) (03D15) Many-valued logic (03B50)

Related Items (7)

An algorithm for random signed 3-SAT with intervals ⋮ Automated theorem proving by resolution in non-classical logics ⋮ MaxSAT resolution for regular propositional logic ⋮ A first polynomial non-clausal class in many-valued logic ⋮ The Helly property and satisfiability of Boolean formulas defined on set families ⋮ On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT ⋮ New complexity results for Łukasiewicz logic

This page was built for publication: