Theory and Applications of Satisfiability Testing

DOI10.1007/b95238zbMath1204.68184OpenAlexW2494235144WikidataQ56039662 ScholiaQ56039662MaRDI QIDQ5325869

Emmanuel Hebrard, Toby Walsh, Christian Bessiere

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)

Related Items (5)

The state of SAT ⋮ Modelling and solving temporal reasoning as propositional satisfiability ⋮ Modelling Max-CSP as Partial Max-SAT ⋮ Dealing with satisfiability and \(n\)-ary CSPs in a logical framework ⋮ Set constraint model and automated encoding into SAT: application to the social golfer problem

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