Hardness Results for Learning First-Order Representations and Programming by Demonstration

ISSN： 0885-6125

Source： Machine Learning, Vol.30, Iss.1, 1998-01, pp. : 57-87

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Applying machine learning to programming by demonstration

By Paynter Gordon W. Witten Ian H.

Journal of Experimental & Theoretical Artificial Intelligence, Vol. 16, Iss. 3, 2004-07 ,pp. : 161-188

Taylor & Francis Ltd

Access to resources Recommend Favorite

Inference of abduction theories for handling incompleteness in first-order learning

By Esposito F. Ferilli S. Basile T. Mauro N.

Knowledge and Information Systems, Vol. 11, Iss. 2, 2007-02 ,pp. : 217-242

Springer Publishing Company

Access to resources Recommend Favorite

Efficient training of high-order hidden Markov models using first-order representations

By du Preez J.A.

Computer Speech & Language, Vol. 12, Iss. 1, 1998-01 ,pp. : 23-39

Academic Press

Access to resources Recommend Favorite

A note on first-order projections and games

By Arratia A.A. Stewart I.A.

Theoretical Computer Science, Vol. 290, Iss. 3, 2003-01 ,pp. : 2085-2093

Elsevier

Access to resources Recommend Favorite

On weighted first-order logics with discounting

By Mandrali Eleni Rahonis George

Acta Informatica, Vol. 51, Iss. 2, 2014-03 ,pp. : 61-106

Springer Publishing Company

Access to resources Recommend Favorite