Extends PAC semantics to implicitly learn universally quantified first-order clauses over countably infinite domains via symmetries for query answering.
Title resolution pending
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
-
Implicitly Learning to Reason in First-Order Logic
Extends PAC semantics to implicitly learn universally quantified first-order clauses over countably infinite domains via symmetries for query answering.