A more expressive formulation of many sorted logic
Journal of Automated Reasoning
A many-sorted calculus based on resolution and paramodulation
A many-sorted calculus based on resolution and paramodulation
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Generalized subsumption and its applications to induction and redundancy
Artificial Intelligence
Journal of Symbolic Computation
Automated deduction in nonclassical logics
Automated deduction in nonclassical logics
Computational aspects of an order-sorted logic with term declarations
Computational aspects of an order-sorted logic with term declarations
Hierarchical knowledge bases and efficient disjunctive reasoning
Proceedings of the first international conference on Principles of knowledge representation and reasoning
The substitutional framework for sorted deduction: fundamental results on hybrid reasoning
Artificial Intelligence - Special issue on knowledge representation
Anti-unification in constraint logics: foundations and applications to learnability in first-order logic, to speed-up learning, and to deduction
Learning Conjunctive Concepts in Structural Domains
Machine Learning
A Resolution Calculus for Modal Logics
Proceedings of the 9th International Conference on Automated Deduction
CL '00 Proceedings of the First International Conference on Computational Logic
ILP '99 Proceedings of the 9th International Workshop on Inductive Logic Programming
ILP '00 Proceedings of the 10th International Conference on Inductive Logic Programming
Ilp: a short look back and a longer look forward
The Journal of Machine Learning Research
| Hi-index | 0.00 |
Instantiation orderings over formulas (the relation of one formula being an instance of another) have long been central to the study of automated deduction and logic programming, and are of rapidly-growing importance in the study of database systems and machine learning. A variety of instantiation orderings are now IP use, many of which incorporate some kind of background information in the form of a constraint theory. Even a casual examination of these instantiation orderings reveals that they are somehow related, but in exactly what way? This paper presents a general instantiation ordering of which all these orderings are special cases, as are other instantiation orderings. The paper shows that this general ordering has the semantic properties we desire in an instantiation ordering, implying that the special cases have these properties as well. The extension to this general ordering is useful in applications to inductive logic programming, automated deduction and logic programming, knowledge-base verification, and database systems.