Theory and Applications of Satisfiability Testing
From MaRDI portal
Publication:5325854
DOI10.1007/b95238zbMath1204.68208OpenAlexW2494235144WikidataQ56039662 ScholiaQ56039662MaRDI QIDQ5325854
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
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
The state of SAT, Modelling and solving temporal reasoning as propositional satisfiability, Clause weighting local search for SAT, Solving non-Boolean satisfiability problems with stochastic local search: A comparison of encodings, Automated reformulation of specifications by safe delay of constraints, Generalised graph colouring by a hybrid of local search and constraint programming, Programming for modular reconfigurable robots, An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems
Uses Software
