EKL—a mathematically oriented proof checker
Proc. of the conference on 7th international conference on automated deduction
Journal of the ACM (JACM)
Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Ontic: a knowledge representation system for mathematics
Ontic: a knowledge representation system for mathematics
Terminological reasoning is inherently intractable (research note)
Artificial Intelligence
Towards a theory of access-limited logic for knowledge representation
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Attributive concept descriptions with complements
Artificial Intelligence
Automatic recognition of tractability in inference relations
Journal of the ACM (JACM)
Fast Decision Procedures Based on Congruence Closure
Journal of the ACM (JACM)
Variations on the Common Subexpression Problem
Journal of the ACM (JACM)
A Deduction Model of Belief
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
RRL: A Rewrite Rule Laboratory
Proceedings of the 8th International Conference on Automated Deduction
Complexity of finitely presented algebras
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Automatic recognition of tractability in inference relations
Journal of the ACM (JACM)
Information and Computation
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Interactive Design of Object-Oriented Schema
IDEAS '99 Proceedings of the 1999 International Symposium on Database Engineering & Applications
Learning Control Knowledge for Forward Search Planning
The Journal of Machine Learning Research
Learning measures of progress for planning domains
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Journal of Artificial Intelligence Research
Using learned policies in heuristic-search planning
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Obvious properties of computer programs
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Scaling up heuristic planning with relational decision trees
Journal of Artificial Intelligence Research
Inductive policy selection for first-order MDPs
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
An Ensemble Architecture for Learning Complex Problem-Solving Techniques from Demonstration
ACM Transactions on Intelligent Systems and Technology (TIST)
Studia Logica
| Hi-index | 0.00 |
A new polynomial time decidable fragment of first order logic is identified, and a general method for using polynomial time inference procedures in knowledge representation systems is presented. The results shown in this paper indicate that a nonstandard “taxonomic” syntax is essential in constructing natural and powerful polynomial time inference procedures. The central role of taxonomic syntax in the polynomial time inference procedures provides technical support for the often-expressed intuition that knowledge is better represented in terms of taxonomic relationships than classical first order formulas. To use the procedures in a knowledge representation system, a “Socratic proof system” is defined, which is complete for first order inference and which can be used as a semi-automated interface to a first order knowledge base.