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