Abstract
This chapter examines how to automate a deductive reasoning procedure. At the knowledge level, the specification for an idealized deductive procedure is optimized. The reasoning procedure that is considered in this chapter works on logical formulas in a special restricted form. The procedure to convert any propositional formula to conjunctive normal form (CNF) is also presented in the chapter. It is convenient to use a shorthand representation for CNF. A clausal formula is a finite set of clauses, where a clause is a finite set of literals. The interpretation of clausal formulas is precisely as formulas in CNF. A clausal formula is understood as the conjunction of its clauses, where each clause is understood as the disjunction of its literals and is understood normally. To discuss reasoning at the symbol level, it is common to posit what are called rules of inference, which are statements of what formulas can be inferred from other formulas. The chapter uses a single rule of inference called (binary) Resolution.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
