scientific article; zbMATH DE number 1420878

MaRDI QIDQ4944947zbMATH OpenFDO

Authors Daniele Mundici

Publication date 22 March 2000

Mathematics Subject Classification ID

Many-valued logic (03B50) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial games (91A46) Applications of game theory (91A80)

Recommendations

• Resolution for Max-SAT
• scientific article; zbMATH DE number 7591
• scientific article; zbMATH DE number 57852
• Investigation of maximum and minimum satisfiability problems using \(L\)-partition
• A Complete Calculus for Max-SAT

Cited in

(4)

• scientific article; zbMATH DE number 991699 (Why is no real title available?)
• Searching games with errors -- fifty years of coping with liars
• The MaxSAT problem in the real-valued MV-algebra
• Polyhedral semantics and the tractable approximation of Łukasiewicz infinitely-valued logic

This page was built for publication:

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