Case-by-case problem solving

7Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.

Abstract

Case-by-case Problem Solving solves each occurrence, or case, of a problem using available knowledge and resources on the case. It is different from the traditional Algorithmic Problem Solving, which applies the same algorithm to all occurrences of all problem instances. Case-by-case Problem Solving is suitable for situations where the system has no applicable algorithm for a problem. This approach gives the system flexibility, originality, and scalability, at the cost of predictability. This paper introduces the basic notion of Case-by-case Problem Solving, as well as its most recent implementation in NARS, an AGI project. Copyright © 2008, The Second Conference on Artificial General Intelligence (AGI-09.org). All rights reserved.

Cite

CITATION STYLE

APA

Wang, P. (2009). Case-by-case problem solving. In Proceedings of the 2nd Conference on Artificial General Intelligence, AGI 2009 (pp. 180–185). Atlantis Press. https://doi.org/10.2991/agi.2009.43

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free