"Extracting (Easily) Checkable Proofs from a Satisfiability Solver that ..."

Allen Van Gelder (2002)

> Home

Details and statistics

DOI: —

access: closed

type: Conference or Workshop Paper

metadata version: 2022-02-08

- view
  - electronic edition @ rutgers.edu (archived)
  - lookup Internet Archive Scholar
- export record
  dblp key:
  - conf/isaim/Gelder02a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaim/Gelder02a
Allen Van Gelder:
Extracting (Easily) Checkable Proofs from a Satisfiability Solver that Employs both Preorder and Postorder Resolution. AI&M 2002

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.