Can GProlog produce SAT-like proof?
| Newsgroups | gmane.comp.gnu.prolog.general,gmane.spam.detected |
|---|---|
| Message-ID | <[email protected]> |
Hi, Are there some one knows whether GNU Prolog can produce SAT solver like unsatisfiability core as unsatisfiability proof? If GNU Prolog cannot produce it, are there some one know which CLP solver can produce this? Thanks in advance! tun li _______________________________________________ Users-prolog mailing list [email protected] http://lists.gnu.org/mailman/listinfo/users-prolog