Optimal satisfiability for propositional calculi and constraint satisfaction problems

DOI10.1007/3-540-44612-5_59MaRDI QIDQ4536400zbMATH OpenFDO

Authors Heribert Vollmer, S. Reith

Publication date 25 June 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44612-5_59

Mathematics Subject Classification ID

Classical propositional logic (03B05) Mechanization of proofs and logical operations (03B35) Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Optimal satisfiability for propositional calculi and constraint satisfaction problems.
• optsat: A Tool for Solving SAT Related Optimization Problems
• A dichotomy theorem for maximum generalized satisfiability problems.
• Minimal distance of propositional models
• The complexity of minimal satisfiability problems

Cited in

(15)

• Optimal satisfiability for propositional calculi and constraint satisfaction problems.
• Optimizing with minimum satisfiability
• The complexity of Boolean constraint satisfaction local search problems
• The complexity of minimal satisfiability problems
• The \texttt{ksmt} calculus is a \(\delta \)-complete decision procedure for non-linear constraints
• Evaluating optimised decision procedures for propositional modal \({\mathbf K}_{({\mathbf m})}\) satisfiability
• Polynomial threshold reoptimization of generalized satisfiability problems with bounded arity predicates
• optsat: A Tool for Solving SAT Related Optimization Problems
• scientific article; zbMATH DE number 1059312 (Why is no real title available?)
• Evaluating search heuristics and optimization techniques in propositional satisfiability
• Guarantees and limits of preprocessing in constraint satisfaction and reasoning
• Efficient solution of a class of quantified constraints with quantifier prefix exists-forall
• Automata, Languages and Programming
• The next whisky bar
• Generalized satisfiability problems via operator assignments

This page was built for publication: Optimal satisfiability for propositional calculi and constraint satisfaction problems

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