Heuristic-based backtracking relaxation for propositional satisfiability
From MaRDI portal
Publication:862398
DOI10.1007/s10817-005-9005-yzbMath1109.68099OpenAlexW1970908002MaRDI QIDQ862398
José T. de Sousa, Inês Lynce, Ateet Bhalla, João P. Marques-Silva
Publication date: 24 January 2007
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://eprints.soton.ac.uk/262056/1/jpms-jar05.pdf
Searching and sorting (68P10) Nonnumerical algorithms (68W05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
- Nonsystematic search and no-good learning
- Local search with constraint propagation and conflict-based heuristics
- Progress in Artificial Intelligence
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
This page was built for publication: Heuristic-based backtracking relaxation for propositional satisfiability