The Complexity of Restricted Consequence Finding and Abduction

@inproceedings{Val2000TheCO,
  title={The Complexity of Restricted Consequence Finding and Abduction},
  author={Alvaro del Val},
  booktitle={AAAI/IAAI},
  year={2000}
}
We analyze the complexity of propositional kernel resolution (del Val 1999), a general method for obtaining logical consequences in restricted target languages. Different choices of target are relevant to important AI tasks, e.g. prime implicates, satisfiability, abduction and non-monotonic reasoning, and polynomial-size knowl- 
Highly Cited
This paper has 23 citations. REVIEW CITATIONS
14 Citations
18 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 18 references

R . Dechter . Bucket elimination : A unifying framework for reasoning

  • A. del Val
  • Artificial Intelligence An analysis of…
  • 2000
Highly Influential
8 Excerpts

Similar Papers

Loading similar papers…