"Testing satisfiability of CNF formulas by computing a stable set of points."

Eugene Goldberg (2005)

> Home

Details and statistics

DOI: 10.1007/S10472-005-0420-X

access: closed

type: Journal Article

metadata version: 2017-05-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/amai/Goldberg05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/amai/Goldberg05
Eugene Goldberg:
Testing satisfiability of CNF formulas by computing a stable set of points. Ann. Math. Artif. Intell. 43(1): 65-89 (2005)

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.