Generalization of Clauses under Implication
P. Idestam-Almquist

TL;DR
This paper introduces T-implication, a decidable form of logical implication for clauses, enabling the generalization of recursive clauses in inductive learning, which was previously infeasible with standard implication.
Contribution
It proposes T-implication as a decidable alternative to implication, and provides methods to reduce generalizations under implication to theta-subsumption of clause expansions.
Findings
Existence of least general generalizations under T-implication for finite clause sets
Reduction of implication generalizations to theta-subsumption of clause expansions
Introduction of T-complete expansions for non-tautological clauses
Abstract
In the area of inductive learning, generalization is a main operation, and the usual definition of induction is based on logical implication. Recently there has been a rising interest in clausal representation of knowledge in machine learning. Almost all inductive learning systems that perform generalization of clauses use the relation theta-subsumption instead of implication. The main reason is that there is a well-known and simple technique to compute least general generalizations under theta-subsumption, but not under implication. However generalization under theta-subsumption is inappropriate for learning recursive clauses, which is a crucial problem since recursion is the basic program structure of logic programs. We note that implication between clauses is undecidable, and we therefore introduce a stronger form of implication, called T-implication, which is decidable between…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, Reasoning, and Knowledge · Advanced Algebra and Logic · Logic, programming, and type systems
