What makes propositional abduction tractable (Q2389658): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.artint.2008.02.001 / rank
Normal rank
 
Property / cites work
 
Property / cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bases for Boolean co-clones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4858040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of abduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preprocessing of intractable problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Default Logic on Generalized Conjunctive Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure identification of Boolean relations and plain bases for co-clones / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Complete Classification of the Complexity of Propositional Abduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some tractable classes in deduction and abduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418672 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of logic-based abduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abduction from logic programs: Semantics and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantics and complexity of abduction from default theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing all abductive explanations from a propositional Horn theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closed systems of functions and predicates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting complexity of propositional abduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning with ordered binary decision diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Horn approximations of empirical data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning with models / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Structure of Polynomial Time Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compilability of propositional abduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abduction in logic programming: A new definition and an abductive procedure based on rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2752124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypothesis generation by machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic for Programming, Artificial Intelligence, and Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Two-Valued Iterative Systems of Mathematical Logic. (AM-5) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3208654 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Cores and Prime Implicants of Truth Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knowledge compilation and theory approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737597 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434165 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ARTINT.2008.02.001 / rank
 
Normal rank

Latest revision as of 08:48, 18 December 2024

scientific article
Language Label Description Also known as
English
What makes propositional abduction tractable
scientific article

    Statements

    What makes propositional abduction tractable (English)
    0 references
    0 references
    0 references
    17 July 2009
    0 references
    abduction
    0 references
    propositional logic
    0 references
    computational complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references