Share Email Print
cover

Proceedings Paper

Problem Solving By Proving Satisfiability
Author(s): Shashank K. Mehta
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 21 March 1989
PDF: 7 pages
Proc. SPIE 1095, Applications of Artificial Intelligence VII, (21 March 1989); doi: 10.1117/12.969353
Show Author Affiliations
Shashank K. Mehta, Rensselaer Polytechnic Institute (United States)


Published in SPIE Proceedings Vol. 1095:
Applications of Artificial Intelligence VII
Mohan M. Trivedi, Editor(s)

© SPIE. Terms of Use
Back to Top