The journal of problem solving最新文献

{"title":"Artificial Intelligence","authors":"H. Eisner","doi":"10.1201/9781003160618-8","DOIUrl":"https://doi.org/10.1201/9781003160618-8","url":null,"abstract":"","PeriodicalId":90070,"journal":{"name":"The journal of problem solving","volume":"22 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88850852","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Group Problem-Solving","authors":"H. Eisner","doi":"10.1007/978-1-4614-6170-8_100163","DOIUrl":"https://doi.org/10.1007/978-1-4614-6170-8_100163","url":null,"abstract":"","PeriodicalId":90070,"journal":{"name":"The journal of problem solving","volume":"41 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82903321","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Deep Analogical Inference as the Origin of Hypotheses","authors":"Mark Blokpoel, T. Wareham, W. Haselager, I. Toni, I.J.E.I. van Rooij","doi":"10.7771/1932-6246.1197","DOIUrl":"https://doi.org/10.7771/1932-6246.1197","url":null,"abstract":"The ability to generate novel hypotheses is an important problem-solving capacity of humans. This ability is vital for making sense of the complex and unfamiliar world we live in. Often, this capacity is characterized as an inference to the best explanation - selecting the \"best\" explanation from a given set of candidate hypotheses. However, it remains unclear where these candidate hypotheses originate from. In this paper we contribute to computationally explaining these origins by providing the contours of the computational problem solved when humans generate hypotheses. The origin of hypotheses, otherwise known as abduction proper, is hallmarked by seven properties: (1) isotropy, (2) open-endedness, (3) novelty, (4) groundedness, (5) sensibility, (6) psychological realism, and (7) computational tractability. In this paper we provide a computational-level theory of abduction proper that unifies the first six of these properties and lays the groundwork for the seventh property of computational tractability. We conjecture that abduction proper is best seen as a process of deep analogical inference.","PeriodicalId":90070,"journal":{"name":"The journal of problem solving","volume":"175 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82963772","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"The Role of Problem Representation in Producing Near-Optimal TSP Tours","authors":"Pierson J. Fleischer, S. Hélie, Z. Pizlo","doi":"10.7771/1932-6246.1212","DOIUrl":"https://doi.org/10.7771/1932-6246.1212","url":null,"abstract":"","PeriodicalId":90070,"journal":{"name":"The journal of problem solving","volume":"12 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2018-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85926460","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"The Role of the Goal in Solving Hard Computational Problems: Do People Really Optimize?","authors":"Sarah Carruthers, U. Stege, M. Masson","doi":"10.7771/1932-6246.1200","DOIUrl":"https://doi.org/10.7771/1932-6246.1200","url":null,"abstract":"The role that the mental, or internal, representation plays when people are solving hard computational problems has largely been overlooked to date, despite the reality that this internal representation drives problem solving. In this work we investigate how performance on versions of two hard computational problems differs based on what internal representations can be generated. Our findings suggest that problem solving performance depends not only on the objective difficulty of the problem, and of course the particular problem instance at hand, but also on how feasible it is to encode the goal of the given problem. A further implication of these findings is that previous human performance studies using NP-hard problems may have, surprisingly, underestimated human performance on instances of problems of this class. We suggest ways to meaningfully frame human performance results on instances of computationally hard problems in terms of these problems’ computational complexity, and present a novel framework for interpreting results on problems of this type. The framework takes into account the limitations of the human cognitive system, in particular as it applies to the generation of internal representations of problems of this class.","PeriodicalId":90070,"journal":{"name":"The journal of problem solving","volume":"55 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2018-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79126822","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Heuristics for Comparing the Lengths of Completed E-TSP Tours: Crossings and Areas","authors":"J. MacGregor","doi":"10.7771/1932-6246.1193","DOIUrl":"https://doi.org/10.7771/1932-6246.1193","url":null,"abstract":"The article reports three experiments designed to explore heuristics used in comparing the lengths of completed Euclidean Traveling Salesman Problem (E-TSP) tours. The experiments used paired comparisons in which participants judged which of two completed tours of the same point set was shorter. The first experiment manipulated two factors, the presence/absence of crossed arcs, and the relative areas of the enclosed polygons. Both factors significantly influenced judgments, with the absence of crossings and smaller areas being associated with shorter tours. The second experiment examined the effects of crossings only, and compared stimulus pairs using all possible combinations of no, one, and more than one crossing. The results showed a significant tendency for tours with one or more crossings to be judged longer than tours with none, while tours with more crossings were not judged to be longer than tours with only one. Apparently the mere presence of a crossing is sufficient to cause a tour to be judged as longer. The third experiment examined the effects of area only, and consisted of two parts. In the first part, participants judged which of two tours that differed in area was shorter. The results supported those of the first experiment, by finding that tours with smaller areas tended to be judged as shorter. In the second part of the experiment, participants judged the relative areas of each pair, to determine whether people can reliably differentiate the areas of such complex polygons. The results confirmed that they can, thereby supporting the feasibility of using differences in area as a heuristic to judge relative lengths. The results were discussed in terms of Carruthers’s (2015) proposal of goal modification and the suggestion is made that applying heuristics of the type identified may represent a specific form of goal modification.","PeriodicalId":90070,"journal":{"name":"The journal of problem solving","volume":"57 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2018-01-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78057498","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"The Roles of Internal Representation and Processing in Problem Solving Involving Insight: A Computational Complexity Perspective","authors":"T. Wareham","doi":"10.7771/1932-6246.1201","DOIUrl":"https://doi.org/10.7771/1932-6246.1201","url":null,"abstract":"In human problem solving, there is a wide variation between individuals in problem solution time and success rate, regardless of whether or not this problem solving involves insight. In this paper, we apply computational and parameterized analysis to a plausible formalization of extended representation change theory (eRCT), an integration of problem solving by problem space search and insight as problem restructuring which proposes that this variation may be explainable by individuals having different problem representations and search heuristic choices. Our analyses establish not only the intractability of eRCT in general, but also sets of restrictions under which eRCT-based problem solving can and cannot be done quickly. As such, our analyses both prove that several conjectures about what makes problem solving under eRCT possible in practice are incomplete, in the sense that not all factors in the model whose restriction is responsible for efficient solvability are part of the explanation, and provide several new explanations that are complete.","PeriodicalId":90070,"journal":{"name":"The journal of problem solving","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2018-01-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74842837","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Algorithmic Puzzles: History, Taxonomies, and Applications in Human Problem Solving","authors":"A. Levitin","doi":"10.7771/1932-6246.1194","DOIUrl":"https://doi.org/10.7771/1932-6246.1194","url":null,"abstract":"The paper concerns an important but underappreciated genre of algorithmic puzzles, explaining what these puzzles are, reviewing milestones in their long history, and giving two different ways to classify them. Also covered are major applications of algorithmic puzzles in cognitive science research, with an emphasis on insight problem solving, and the advantages of algorithmic puzzles over some other classes of problems used in insight research. The author proposes adding algorithmic puzzles as a separate category of insight problems, suggests 12 specific puzzles that could be useful for research in insight problem solving, and outlines several experiments dealing with other cognitive aspects of solving algorithmic puzzles. Correspondence: Correspondence concerning this article should be addressed to Anany Levitin, via email to alevitin@villanova.edu.","PeriodicalId":90070,"journal":{"name":"The journal of problem solving","volume":"57 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90457359","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Guest Editors’ Introduction","authors":"Sarah Carruthers, U. Stege","doi":"10.7771/1932-6246.1211","DOIUrl":"https://doi.org/10.7771/1932-6246.1211","url":null,"abstract":"","PeriodicalId":90070,"journal":{"name":"The journal of problem solving","volume":"9 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73589100","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Problem Solving as an Encoding Task: A Special Case of the Generation Effect","authors":"Jasmin M. Kizilirmak, Berit Wiegmann, A. Richardson-Klavehn","doi":"10.7771/1932-6246.1182","DOIUrl":"https://doi.org/10.7771/1932-6246.1182","url":null,"abstract":"Recent evidence suggests that solving problems through insight can enhance long-term memory for the problem and its solution. Previous findings have shown that generation of the solution as well as experiencing a feeling of Aha! can have a beneficial relationship to later memory. These findings lead to the question of how learning in problem-solving tasks in which a novel solution needs to be generated—such as in tasks used to study insight— differs from the classical generation effect. Because previous studies on learning from insight on one hand and the generation effect on the other hand have measured different types of memory, the present study examined two kinds of memory measures: indirect (solving old and new problems at test) and direct (recognition memory). At encoding, we manipulated whether participants had the chance to solve Compound Remote Associates Task items and compared later memory for generated solutions (generate condition) to solutions that were presented after failing to generate one (fail-to-generate condition), and to solutions that were presented without a chance at generation (read condition). Participants also reported if they had an Aha! experience for each problem. While both Aha! experiences and generated solutions were associated with more positive emotional responses, only the generation variable was associated with differences in later memory performance. While attempts to generate had an advantage over the read condition in recognition memory performance (generate > fail-to-generate > read), only when generation was successful did it enhance the solution rate of old items during testing (generate > read > fail-to-generate). Contrary to generation effects with other verbal stimuli, these results suggest that the generation effect in problem-solving tasks in which a novel solution needs to be found differs from the classical generation effect. Seeing a correct solution for a longer time (read) seems in the current case to be more helpful for solving the same problem later on, compared to being presented with the solution after a failed attempt at problem solving. Correspondence: Correspondence concerning this article should be addressed to Jasmin M. Kizilirmak, via email to kizilirmak@uni-hildesheim.de.","PeriodicalId":90070,"journal":{"name":"The journal of problem solving","volume":"7 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82696642","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}