Resource-bounded Relational Reasoning:Induction and Deduction Through Stochastic Matching

Author： Sebag M.  

Publisher： Springer Publishing Company

ISSN： 0885-6125

Source： Machine Learning, Vol.38, Iss.1-2, 2000-01, pp. : 41-62

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

On resource-bounded instance complexity

By Fortnow L.   Kummer M.  

Theoretical Computer Science, Vol. 161, Iss. 1, 1996-07 ,pp. : 123-140

Elsevier

Access to resources Recommend Favorite

Executable specifications of resource-bounded agents

By Fisher Michael  

Autonomous Agents and Multi-Agent Systems, Vol. 21, Iss. 3, 2010-11 ,pp. : 368-396

Springer Publishing Company

Access to resources Recommend Favorite

Co-operative scheduling for a resource-bounded multiagent planning system

By Mouaddib Abdel-illah  

Journal of Experimental & Theoretical Artificial Intelligence, Vol. 16, Iss. 2, 2004-04 ,pp. : 57-71

Taylor & Francis Ltd

Access to resources Recommend Favorite

A stronger Kolmogorov zero-one law for resource-bounded measure

By Dai J.J.  

Theoretical Computer Science, Vol. 292, Iss. 3, 2003-01 ,pp. : 723-732

Elsevier

Access to resources Recommend Favorite

Integrating induction and deduction for finding evidence of discrimination

By Ruggieri Salvatore  

Artificial Intelligence and Law, Vol. 18, Iss. 1, 2010-03 ,pp. : 1-43

Springer Publishing Company

Access to resources Recommend Favorite