21 March 1989 Problem Solving By Proving Satisfiability
Author Affiliations +
Abstract
The satisfiability problem is shown to be a formulation suitable for problems in planning, scheduling, solid modeling, etc. which cannot be solved by the unsatisfiability formulation (logic programming). A reduction procedure is developed, to prove the satisfiability, using a geometrical interpretation of the logical expression to be satified. The procedure is shown to be applicable to the first-order clauses too.
© (1989) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Shashank K. Mehta, "Problem Solving By Proving Satisfiability", Proc. SPIE 1095, Applications of Artificial Intelligence VII, (21 March 1989); doi: 10.1117/12.969353; https://doi.org/10.1117/12.969353
PROCEEDINGS
7 PAGES


SHARE
RELATED CONTENT


Back to Top