"Finding Small Unsatisfiable Cores to Prove Unsatisfiability of QBFs."

Yannet Interian et al. (2006)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2022-02-08

- view
  - electronic edition @ umass.edu (open access)
- export record
  dblp key:
  - conf/isaim/InterianCSW06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaim/InterianCSW06
Yannet Interian, Gabriel Corvera, Bart Selman, Ryan Williams:
Finding Small Unsatisfiable Cores to Prove Unsatisfiability of QBFs. AI&M 2006

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.