NarrowHighway

A card from a free library — ask anything, no account, works offline. Every card carries its source.

M. Davis 1962 — A machine program for theorem-proving

source

M. Davis, G. Logemann, D. Loveland (1962). A machine program for theorem-proving. Comm. ACM 5 (1962) 394–397. DOI 10.1145/368273.368557. Canonical: https://doi.org/10.1145/368273.368557. No free copy found; cited by its record. License as found: ACM copyright policy (acm.org/publications/policies/copyright_policy) — publisher's copyright, cited. Serves the P versus NP stick (stick_p_versus_np): DPLL — the method for the SAT door the build want asks for; the door itself is not built — a build item's method want_9dbba8ee0e18.

source
M. Davis, G. Logemann, D. Loveland (1962), Comm. ACM 5 (1962) 394–397 ↗
card id
card_src_mill_davis_logemann_loveland_1962
address
SCI.millennium.FCT/a-machine-program-for-theorem-proving/REF.WITNESSED@m-davis-g-logemann-d-lov

related in the keeping ↗ · raw JSON ↗

adjoining cards

Is this card incomplete? Tell the library — it will call out for more ↗