Polarized Resolution Modulo

We present a restriction of Resolution modulo where the rewrite rules are such that clauses rewrite to clauses, so that the reduct of a clause needs not be further transformed into clause form. Restricting Resolution modulo in this way requires to extend it in another and distinguish the rules that apply to negative and positive atomic propositions. This method can be seen as a restriction of Equational resolution that mixes clause selection and literal selection restrictions. Unlike many restrictions of Resolution, it is not an instance of Ordered resolution.

• Type: Journal
• Year: 2010
• Where: IFIPTCS
• Authors: Gilles Dowek
• Keywords: Clause Form, IFIPTCS 2010, Literal Selection Restrictions, Resolution Modulo, Theoretical Computer Science