Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable ..."

Maher N. Mneimneh et al. (2005)

> Home

Details and statistics

DOI: 10.1007/11499107_40

access: closed

type: Conference or Workshop Paper

metadata version: 2023-04-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/sat/MneimnehLASS05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sat/MneimnehLASS05
Maher N. Mneimneh, Inês Lynce, Zaher S. Andraus, João Marques-Silva, Karem A. Sakallah:
A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas. SAT 2005: 467-474

a service of

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.