"Compressing UNSAT Search Trees with Caching."

Anthony Blomme et al. (2023)

> Home

Details and statistics

DOI: 10.5220/0011671800003393

access: closed

type: Conference or Workshop Paper

metadata version: 2024-10-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/icaart/BlommeBPR23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icaart/BlommeBPR23
Anthony Blomme, Daniel Le Berre, Anne Parrain, Olivier Roussel:
Compressing UNSAT Search Trees with Caching. ICAART (3) 2023: 358-365

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.