Backjumping is Exception Handling

DOI10.1017/S1471068420000435zbMath1472.68028arXiv2008.04720OpenAlexW3048632796MaRDI QIDQ4957217

No author found.

Publication date: 3 September 2021

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

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

zbMATH Keywords

backjumpingSATexception handlingconflict-driven clause learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Coloring of graphs and hypergraphs (05C15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)

Uses Software

• Chaff
• SICStus
• SWI-Prolog

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A pearl on SAT and SMT solving in Prolog
• Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
• A theoretical evaluation of selected backtracking algorithms.
• SICStus Prolog—The first 25 years
• SWI-Prolog
• A Pearl on SAT Solving in Prolog
• Algorithm = logic + control
• Logic + control: On program construction and verification
• PROGRAMMING PEARL: Enhancing a search algorithm to perform intelligent backtracking

This page was built for publication: Backjumping is Exception Handling