On some tractable classes in deduction and abduction
type: Item
instance of: scholarly article
title: On some tractable classes in deduction and abduction
zbMATH Open document ID: 0940.03016
DOI: 10.1016/S0004-3702(99)00088-0
published in: Artificial Intelligence
publication date: 2000-06-04T00:00:00Z
Mathematics Subject Classification ID: 03B35
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 03B05
zbMATH DE Number: 1454127
zbMATH Keywords: deduction
zbMATH Keywords: entailment
zbMATH Keywords: abduction
zbMATH Keywords: tractable inference
zbMATH Keywords: propositional logic
zbMATH Keywords: automated reasoning
zbMATH Keywords: tractability of entailment
author: Alvaro del Val
MaRDI profile type: Publication
cites work: Polynomial-time inference of all valid implications for Horn and related formulae
cites work: Extended Horn sets in propositional logic
cites work: Q4228441
cites work: On the Relationship Between Abduction and Deduction
cites work: A hierarchy of tractable satisfiability problems
cites work: Recognizing renamable generalized propositional Horn formulas is NP- complete
cites work: The complexity of logic-based abduction
cites work: Unit Refutations and Horn Sets
cites work: Abduction versus closure in causal theories.
cites work: Renaming a Set of Clauses as a Horn Set
cites work: Q3221403
cites work: Hierarchies of polynomially solvable satisfiability problems
cites work: Support set selection for abductive and default reasoning
description: scientific article; zbMATH DE number 1454127