Strong Backdoors to Nested Satisfiability

DOI10.1007/978-3-642-31612-8_7zbMath1273.68169arXiv1202.4331OpenAlexW1874434006MaRDI QIDQ2843323

Serge Gaspers, Stefan Szeider

Publication date: 12 August 2013

Published in: Theory and Applications of Satisfiability Testing – SAT 2012 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1202.4331

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

Backdoors to Satisfaction ⋮ Backdoors to tractable answer set programming

This page was built for publication: Strong Backdoors to Nested Satisfiability