Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,930,385 papers from all fields of science
Search
Sign In
Create Free Account
Subsumption lattice
A subsumption lattice is a mathematical structure used in theoretical background of automated theorem proving and other symbolic computation…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Automated theorem proving
Substitution (logic)
Symbolic computation
Term (logic)
Expand
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
Alireza Tamaddoni-Nezhad
2013
Corpus ID: 44707239
Rich representation inherited from computational logic makes logic-based machine learning a competent method for application…
Expand
2006
2006
Flexible Conversations Using Social Commitments and a Performatives Hierarchy
R. Kremer
,
Roberto A. Flores
Advanced Courses
2006
Corpus ID: 11348117
In this research, we re-arrange FIPA's ACL performatives to form a subsumption lattice (ontology) and apply a theory of social…
Expand
2004
2004
The subsumption lattice and query learning
R. Khardon
,
Marta Arias
Journal of computer and system sciences (Print)
2004
Corpus ID: 2958673
2003
2003
Speeding Up Relational Data Mining by Learning to Estimate Candidate Hypothesis Scores
F. DiMaio
,
J. Shavlik
,
W. Dayton
2003
Corpus ID: 16551039
The motivation behind multi-relational data mining is knowledge discovery in relational databases containing multiple related…
Expand
2003
2003
Which First-Order Logic Clauses Can Be Learned Using Genetic Algorithms?
F. Marginean
International Conference on Inductive Logic…
2003
Corpus ID: 41654941
In this paper we present and prove both negative and positive theoretical results concerning the representation and evaluation of…
Expand
2003
2003
Facts and Fallacies in Using Genetic Algorithms for Learning Clauses in First-Order Logic
F. Marginean
Annual Conference on Genetic and Evolutionary…
2003
Corpus ID: 8006273
Over the last few years, a few approaches have been proposed aiming to combine genetic and evolutionary computation (GECCO) with…
Expand
2002
2002
Resolution and Logic Programming in Algebraic Domains: Negation and Defaults
P. Hitzler
2002
Corpus ID: 8094444
W.C. Rounds and G.-Q. Zhang have recently proposed to study a form of disjunctive logic programming generalized to algebraic…
Expand
2002
2002
Extending Ontology to Behaviour in Communities of Interoperating Information Systems Agents
R. Colomb
2002
Corpus ID: 17103928
This paper argues that a community of interoperating information systems agents requires an ontology not only of the objects in…
Expand
1997
1997
Induction of Feature Terms With INDIE
Eva Armengol
,
E. Plaza
European Conference on Machine Learning
1997
Corpus ID: 29978385
The aim of relational learning is to develop methods for the induction of descriptions in representation formalisms that are more…
Expand
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)
ACCEPT & CONTINUE