scholar.google.com › citations
While our results are specific to determinations, we believe that the underlying approach can be used to analyze other forms of incomplete theories.
We introduce a new notion of tractability which is called uniform weak tractability. A problem is uniformly weakly tractable if the information complexity ...
On the Tractability of Learning from Incomplete Theories · S. Mahadevan, Prasad Tadepalli · Published in ML Workshop 12 June 1988 · Computer Science, Philosophy.
BibSLEIGH — On the Tractability of Learning from Incomplete ...
bibtex.github.io › ML-1988-MahadevanT
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev. Hosted as a part of SLEBOK on ...
This technique is based on the idea that when the domain theory is intractable, it is possible to learn by generaliz-ing incomplete explanations and ...
A basic reasoning problem in dynamic systems is the projection problem: determine if a formula holds after a sequence of actions has been per- formed.
In this paper, we develop and analyze an algorithm to solve this problem, provided that the dictionary satisfies additional low-dimensional structure. Published ...
A basic reasoning problem in dynamic systems is the projection problem: determine if a formula holds after a sequence of actions has been per- formed.
On the tractability of learning from incomplete theories. In Proceedings of ... Integrated learning with incorrect and incomplete theories. In ...
Oct 30, 2013 · Abstract:Designing algorithms capable of efficiently constructing minimal models of CNFs is an important task in AI. This paper provides new ...