Capturing structure with satisfiability

DOI10.1007/3-540-45578-7_10MaRDI QIDQ4475627zbMATH OpenFDO

Authors Ramon Bejar, Alba Cabiscol, Cesar Fernandez, Felip Manya, Carla P. Gomes

Publication date 9 August 2004

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2239/22390137.htm

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Recommendations

• scientific article; zbMATH DE number 956862
• On the structure of Boolean satisfiability
• A constructive investigation of satisfiability
• Tractable structures for constraint satisfaction with truth tables
• Tractable structures for constraint satisfaction with truth tables
• The Structure of Tractable Constraint Satisfaction Problems
• Using Program Schemes to Capture Polynomial-Time Logically on Certain Classes of Structures
• On satisfiability problems with a linear structure

Cited in

(9)

• 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
• A finite state intersection approach to propositional satisfiability
• Variable and clause ordering in an FSA approach to propositional satisfiability
• scientific article; zbMATH DE number 956862 (Why is no real title available?)
• scientific article; zbMATH DE number 2243377 (Why is no real title available?)
• scientific article; zbMATH DE number 2243388 (Why is no real title available?)
• MaxSAT resolution for regular propositional logic

This page was built for publication: Capturing structure with satisfiability

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