The next section describes this alternative approach and formalizes the
general case of our proof procedure which is an extension of the simplified ver-
sion described in the subsection "Our Proof Procedure."
Formalizing
the
Inference
Rules for
Implicit
Deletions:
The Second
Approach
In this section we first formalize the top-most levels of the resolution (standard
and extended) and the negation as failure rules. Then we formalize the in-
ference rules for implicit deletions. To describe the proof procedure we use
logic as metalanguage. Although our definitions are intended as an abstract and
general description ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month, and much more.