Theory and Applications of Satisfiability Testing

DOI10.1007/B95238zbMATH Open1204.68208OpenAlexW2494235144MaRDI QIDQ5325854FDOQ5325854

Steven Prestwich

Publication date: 24 July 2009

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

Full work available at URL: https://doi.org/10.1007/b95238

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Cited In (10)

• Generalised graph colouring by a hybrid of local search and constraint programming
• The state of SAT
• Title not available (Why is that?)
• Modelling and solving temporal reasoning as propositional satisfiability
• Automated reformulation of specifications by safe delay of constraints
• Solving non-Boolean satisfiability problems with stochastic local search: A comparison of encodings
• An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems
• Title not available (Why is that?)
• Programming for modular reconfigurable robots
• Clause weighting local search for SAT

Uses Software

• Chaff

   Recommendations

• Title not available (Why is that?) 👍 👎
• Theory and Applications of Satisfiability Testing 👍 👎
• Title not available (Why is that?) 👍 👎
• Another look at graph coloring via propositional satisfiability 👍 👎
• Local search algorithms for SAT: an empirical evaluation 👍 👎

This page was built for publication: Theory and Applications of Satisfiability Testing

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