Backward proof search algorithms oblivious to the knowledge base can be modified to learn PAC-supporting rules for a query, with applicability to chaining and resolution.
Investigating a gen- eral hierarchy of polynomially decidable classes of CNF’s based on short tree-like resolution proofs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Query-driven PAC-Learning for Reasoning
Backward proof search algorithms oblivious to the knowledge base can be modified to learn PAC-supporting rules for a query, with applicability to chaining and resolution.