Skip to search formSkip to main contentSkip to account menu

Subsumption lattice

A subsumption lattice is a mathematical structure used in theoretical background of automated theorem proving and other symbolic computation… 
Wikipedia (opens in a new tab)

Related topics

Related topics

5 relations
Automated theorem provingSubstitution (logic)Symbolic computationTerm (logic)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Logic-based machine learning using a bounded hypothesis space : the lattice structure, refinement operators and a genetic algorithm approach
Rich representation inherited from computational logic makes logic-based machine learning a competent method for application… 
2003
2003
Speeding Up Relational Data Mining by Learning to Estimate Candidate Hypothesis Scores
The motivation behind multi-relational data mining is knowledge discovery in relational databases containing multiple related… 
2003
2003
Which First-Order Logic Clauses Can Be Learned Using Genetic Algorithms?
In this paper we present and prove both negative and positive theoretical results concerning the representation and evaluation of… 
1997
1997
Induction of Feature Terms With INDIE
The aim of relational learning is to develop methods for the induction of descriptions in representation formalisms that are more… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)