Model Checking Algorithm for Repairing Inference between Conjunctive Forms
GD Ita, P Bello - Computación y Sistemas, 2022 - scielo.org.mx
GD Ita, P Bello
Computación y Sistemas, 2022•scielo.org.mxLet K be a propositional formula and let ϕ be a query, the propositional inference problem
K⊨ ϕ 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 K and
ϕ that are different from the already known case of Horn formulas. For example, in the case
that K is a formula in the fragment Krom or Horn or Monotone, then K⊨ ϕ can be decided in
polynomial-time for any CNF ϕ.
K⊨ ϕ 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 K and
ϕ that are different from the already known case of Horn formulas. For example, in the case
that K is a formula in the fragment Krom or Horn or Monotone, then K⊨ ϕ can be decided in
polynomial-time for any CNF ϕ.
Abstract
Let K be a propositional formula and let ϕ be a query, the propositional inference problem K⊨ ϕ 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 K and ϕ that are different from the already known case of Horn formulas. For example, in the case that K is a formula in the fragment Krom or Horn or Monotone, then K⊨ ϕ can be decided in polynomial-time for any CNF ϕ.
scielo.org.mx
Showing the best result for this search. See all results