A proof procedure for regular CNF-formulas

• Felip Manyà ^[1] ; Gonzalo Escalada Imaz ^[2]
  1. [1] Universitat de Lleida

     Universitat de Lleida

     Lérida, España

     
  2. [2] CSIC
• Localización: CAEPIA'97: actas / coord. por Asociación Española de Inteligencia Artificial, Vicente J. Botti Navarro, 1997, ISBN 84-8498-765-5, págs. 285-295
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • In this paper we deal with the propositional satisfiability problem for a kind of multiple-valued clausal forms known as regular cnf-formulas. We present a Davis-Putnam-style satisfiability checking procedure for regular cnf-formulas and prove its completeness. Then, we propose improved regular branching rule is applied and some deletion strategies for eliminating irrelevant or redundant clauses.