Servicios Personalizados
Revista
Articulo
Indicadores
- Citado por SciELO
- Accesos
Links relacionados
- Similares en SciELO
Compartir
Computación y Sistemas
versión On-line ISSN 2007-9737versión impresa ISSN 1405-5546
Resumen
ITA, Guillermo De y BELLO, Pedro. Model Checking Algorithm for Repairing Inference between Conjunctive Forms. Comp. y Sist. [online]. 2022, vol.26, n.1, pp.59-70. Epub 08-Ago-2022. ISSN 2007-9737. https://doi.org/10.13053/cys-26-1-4152.
Let be a propositional formula and let be a query, the propositional inference problem is a Co-NP-complete problem for propositional formulas without restrictions. We show the existence of polynomial-time cases for some fragments of propositional formulas and that are different from the already known case of Horn formulas. For example, in the case that is a formula in the fragment Krom or Horn or Monotone, then can be decided in polynomial-time for any CNF .
Given two conjunctive normal forms (CNF’s) and , when , our proposal builds a minimal set of independent clauses . The falsifying assignments of are exactly the subset of models of , which are not models for . In this way, the CNF could extend the initial formula in such a way that repair the inference, it is is held.
Palabras llave : Propositional inference; repairing inference; reasoning s; NP-complete; Co-NP-complete.