When incorporating the environment into mental processing (cf., cognitive offloading), one creates novel cognitive strategies that have the potential to improve task performance. Improved performance can, for example, mean faster problem solving, more accurate solutions, or even higher grades at university.1 Although cognitive offloading has frequently been associated with improved performance, it is yet unclear how flexible problem solvers are at matching their offloading habits with their current performance goals (can people improve goal‐related instead of generic performance, e.g., when being (...) in a hurry and aiming for a “quick and dirty” solution?). Here, we asked participants to solve a cognitive task, provided them with different goals—maximizing speed (SPD) or accuracy (ACC), respectively—and measured how frequently (Experiment 1) and how proficiently (Experiment 2) they made use of a novel external resource to support their cognitive processing. Experiment 1 showed that offloading behavior varied with goals: Participants offloaded less in the SPD than in the ACC condition. Experiment 2 showed that this differential offloading behavior was associated with high goal‐related performance: fast answers in the SPD, accurate answers in the ACC condition. Simultaneously, goal‐unrelated performance was sacrificed: inaccurate answers in the SPD, slow answers in the ACC condition. The findings support the notion of humans as canny offloaders who are able to successfully incorporate their environment in pursuit of their current cognitive goals. Future efforts should be focused on the finding's generalizability, for example, to settings without feedback or with high mental workload. (shrink)

Straipsnyjc svarstornas Algio Micklino atsakas huscrliSkosios fcnorncnologijos kritikarns. Autorius iSrySkina tris svarbiausius IJusscrlio kritikq argurnen- tus: 1 .IHusscrlio fcnorncnologija yra toli graiu nc "rnohlas bc jokiq ikankstiniy prielaidq", ji suponuo- ja dckartiSkqj teiginj, jog bliti rciSkia "hliti paiintu". 2.1-Tusserlio tciginj apic fcnorncnologines duotics apo- diktiSkurnq susilpnina jo patics patcikiarni tokios duo- tics apra5yrnai. IS ju, prieSingai Husserlio ketinirnarns. i6aiSkcja fenorncnologincs rcflcksijos ncpajcgurnas "susidoroti" tiek su retencine 1;iikines patirties di- rncnsija, tiek su radikalia Kito patirtics kitokybe. 3.Husscrlio rnctodui ir rnqstyrnui apskritai (...) budingas eurocentrizrnas ir episterninis irnpcrializrnas - visus kultlirinius ir istorinills skirturnus jis susurnuojn savo fenornenologijoje, kuriy traktuoja kaip slaptq graiko- curopictiSko.jo irnogaus llikcsi.iij iksipildyrnn. Algiui Micktinui svarbiausias klausirnns yra Sis: Koclkl reiketq intcrpretuoti Husserli blitent iitaip? Micktinas, Husscrlio rnokiniy Eugcno Finko ir Lud- wigo Landgrebe's rnokinys, gcrai suvokc, jog ypa- tingas Husscrlio raSyrno stilius nesyk yra veikiau su- trrlkdes nei pacle,jysvisu radikalurnu atsiskleisti svar- biausiorns Mol\qto.jo @valgorns ir atradirnarns. Tatiau jam Sis triikurnas visuornct atrodes ncrciksrningas ly- ginant su rniliiniiku potcncialu, kuris Siuosc atradi- rnuose gltidi. laukdarnas tolcsnio iiplctojirno. Hus- scrlio filosofija Micktinui yra tarsi jminirno laukiantis rnjsliy rinkinps, ir Si jrninirnq jis laiko prasrningesniu uidaviniu ui pastangas padcrnonstruoti huserliSkos fenornenologijos nenuoscklurnus ir silpnqsiasvietas. Savo darbuose Micktinas parodo. jog, ncpaisant kri- tikq iipuoliu, Husscrlio fcnorncnologinio rnctodo vi- suotinurnas ir fundamentalurnas iilicka ncpancigti. Raktiniai iodiiai: fi.nornenologija, refleksijn, skirtis, jk~~orner~ns, ~~~~enntnn.spn.snrrli.s, pntirtis. (shrink)

The use of forward models is well established in cognitive and computational neuroscience. We compare and contrast two recent, but interestingly divergent, accounts of the place of forward models in the human cognitive architecture. On the Auxiliary Forward Model account, forward models are special-purpose prediction mechanisms implemented by additional circuitry distinct from core mechanisms of perception and action. On the Integral Forward Model account, forward models lie at the heart of all forms of perception and action. We compare these neighbouring (...) but importantly different visions and consider their implications for the cognitive sciences. We end by asking what kinds of empirical research might offer evidence favouring one or the other of these approaches. (shrink)

To find more information on Rowman & Littlefield titles, please visit us at www.rowmanlittlefield.com.

We are all problem-solvers of some sort. We solve problems to earn a living, get promoted, show that we are smart and deserve colleagues’ respect, and contribute to human progress. Yes, problem-solving is important; the better solution-maker we are, the brighter future we expect. But we are not such good problem solvers for simple reasons: it is hard to define a genuine problem.

This paper presents some modern and interdisciplinary concepts about creativity and creative processes specially related to problem solving. Central publications related to the theme are briefly reviewed. Creative tools and approaches suitable to support problem solving are also presented. Finally, the paper outlines the author’s experiences using creative tools and approaches to: Facilitation of problem solving processes, strategy development in organisations, design of optimisation systems for large scale and complex logistic systems, and creative design of software optimisation for complex non-linear (...) systems. (shrink)

By introducing and extending description logic (DLs) and growing up their application in knowledge representation and especially in OWLs and semantic web scope, many shortcomings and bugs were identified that weren’t resolvable in classical DLs and so logicians and computer scientists intended to non-classical and non-monotonic reasoning tools. In this paper, I discuses about abduction problem solvers, and by introducing A-Box abduction in description logics (DLs), such as ALC, discuss about decidability and complexity in different introduced algorithms, and report shortly (...) our team’s advantages in developing and implementation of ΑBox abduction in DLs. (shrink)

The primary goal of ethics consultation should be to provide effective assistance to patients and families in obtaining care that is duly responsive to their rights and their needs. The consultation reported by Mark Bliton fails in this regard because it never ascertains why the consultation was called; makes little attempt to ascertain the motives of those involved; avoids exploration of the ethical concerns of family, attending or staff; makes no connection with institutional policies or practices; uncritically adopts and serves (...) the medical treatment ethos; and substitutes fellowfeeling for compassionate action. (shrink)

This paper aims to contribute to recent critical work on the current parenting culture. It does so by a critical reading of the individual words/parts of the sentence ?Parents need to become independent problem solvers? ? a characteristic phrase of ?Triple P?, a parenting programme that has recently been implemented as a form of parenting support in a number of countries. The paper aims (1) to bring out and expose some of the worrying features of the current parenting culture, (2) (...) criticise its narrow conceptions of what a parent is and what childrearing is, (3) by doing so give a sense of the oddness of implementing Triple P as a form of parenting support and, finally, (4) tentatively suggest alternative routes of thinking for and about childrearing as well as ?grafting points? to start reconstructing parenting support practices. (shrink)

Our proposed cognitive distance learning problem solver generates sequence of actions from initial state to goal states in problem state space. This problem solver learns cognitive distance of arbitrary combination of two states. Action generation at each state is selection of next state that has minimum cognitive distance to the goal, like Q-learning agent. In this paper, first, we show that our proposed method reduces search cost than conventional search method by analytical simulation in spherical state space. Second, (...) we show that an average search cost is more reduced more the prior learning term is long and our problem solver is familiar to the environment, by a computer simulation in a tile world state space. Third, we showed that proposed problem solver is superior to the reinforcement learning techniques when goal is changed by a computer simulation. Forth, we found that our simulation result consist with psychological experimental results. (shrink)

A geometric constraint solver for finding legal configurations for an under-constrained set of geometric components is proposed. While making drawings interactively, the user usually specifies few geometric constraints explicitly because some constraints are not clear to him- or her-self, or it is not practical to specify all constraints at any early design stage. Theoretically, the full geometric constraints are necessary to define a unique layout of every geometric components, but it is naturally not given throughout the process. Therefore, in (...) such an under-constrained situation, the lack of constraints must be supplemented properly to determine the final layout of components remaining undefined. For this purpose, we propose a geometric constraint solver that works in two phases: the former is to satisfy all the explicit constraints imposed by the user, and the latter is to choose appropriate value instances for every geometric component whose layout is not yet determined. We implemented a constraint-based interactive system for designing line drawings which is composed of the solver and the interactive module to let the user input geometric modi.cation commands incrementally, and proved its effectiveness by some experiments. (shrink)

There has been considerable discussion in the past about the assumptions and basis of different ethical rules. For instance, it is commonplace to say that ethical rules are defaults rules, which means that they tolerate exceptions. Some authors argue that morality can only be grounded in particular cases while others defend the existence of general principles related to ethical rules. Our purpose here is not to justify either position, but to try to model general ethical rules with artificial intelligence formalisms (...) and to compute logical consequences of different ethical theories. More precisely, this is an attempt to show that progress in non-monotonic logics, which simulates default reasoning, could provide a way to formalize different ethical conceptions. From a technical point of view, the model developed in this paper makes use of the Answer Set Programming (ASP) formalism. It is applied comparatively to different ethical systems with respect to their attitude towards lying. The advantages of such formalization are two-fold: firstly, to clarify ideas and assumptions, and, secondly, to use solvers to derive consequences of different ethical conceptions automatically, which can help in a rigorous comparison of ethical theories. (shrink)

ABSTRACTSkepticism about citizen competence is a core component of Christopher H. Achen and Larry M. Bartels’s call, in Democracy for Realists, for rethinking our model of democracy. In this paper I suggest that the evidence for citizen incompetence is not as clear as we might think; important research shows that we are good group problem solvers even if we are poor solitary truth seekers. I argue that deliberative democracy theory has a better handle on this fundamental fact of human cognition (...) and therefore has a more realistic view of the conditions that might improve citizen competence. (shrink)

An experiment was performed to test the hypothesis that people sometimes take physical actions to make themselves more effective problem solvers. The task was to generate all possible words that could be formed from seven Scrabble letters. In one condition, participants could use their hands to manipulate the letters, and in another condition, they could not. Results show that more words were generated with physical manipulation than without. However, an interaction was obtained between the physical manipulation conditions and the specific (...) letter sets chosen, indicating that physical manipulation helps more for generating words in some circumstances than in others. Overall, our findings can be explained in terms of an interactive search process in which external, physical activity effectively complements internal, cognitive activity. Within this framework, the interaction can be explained in terms of the relative difficulty of generating words from the letters given in the different sets. (shrink)

This paper describes a generative theory of bugs. It claims that all bugs of a procedural skill can be derived by a highly constrained form of problem solving acting on incomplete procedures. These procedures are characterized by formal deletion operations that model incomplete learning and forgetting. The problem solver and the deletion operator have been constrained to make it impossible to derive “star‐bugs”—algorithms that are so absurd that expert diagnosticians agree that the alogorithm will never be observed as a (...) bug. Hence, the theory not only generates the observed bugs, it fails to generate star‐bugs.The theory has been tested on an extensive data base of bugs for multidigit subtraction that was collected with the aid of the diagnostic systems buggy and debuggy. In addition to predicting bug occurrence, by adoption of additional hypotheses, the theory also makes predictions about the frequency and stability of bugs, as well as the occurrence of certain latencies in processing time during testing. Arguments are given that the theory can be applied to domains other than subtraction and that it can be extended to provide a theory of procedural learning that accounts for bug acquisition. Lastly, particular care has been taken to make the theory principled so that it can not be tailored to fit any possible data. (shrink)

Following Marr’s famous three-level distinction between explanations in cognitive science, it is often accepted that focus on modeling cognitive tasks should be on the computational level rather than the algorithmic level. When it comes to mathematical problem solving, this approach suggests that the complexity of the task of solving a problem can be characterized by the computational complexity of that problem. In this paper, I argue that human cognizers use heuristic and didactic tools and thus engage in cognitive processes that (...) make their problem solving algorithms computationally suboptimal, in contrast with the optimal algorithms studied in the computational approach. Therefore, in order to accurately model the human cognitive tasks involved in mathematical problem solving, we need to expand our methodology to also include aspects relevant to the algorithmic level. This allows us to study algorithms that are cognitively optimal for human problem solvers. Since problem solving methods are not universal, I propose that they should be studied in the framework of enculturation, which can explain the expected cultural variance in the humanly optimal algorithms. While mathematical problem solving is used as the case study, the considerations in this paper concern modeling of cognitive tasks in general. (shrink)

The International Competition on Computational Models of Argumentation (ICCMA) focuses on reasoning tasks in abstract argumentation frameworks. Submitted solvers are tested on a selected collection of benchmark instances, including artificially generated argumentation frameworks and some frameworks formalizing real-world problems. This paper presents the novelties introduced in the organization of the Third (2019) and Fourth (2021) editions of the competition. In particular, we proposed new tracks to competitors, one dedicated to dynamic solvers (i.e., solvers that incrementally compute solutions of frameworks obtained (...) by incrementally modifying original ones) in ICCMA’19 and one dedicated to approximate algorithms in ICCMA’21. From the analysis of the results, we noticed that i) dynamic recomputation of solutions leads to significant performance improvements, ii) approximation provides much faster results with satisfactory accuracy, and iii) classical solvers improved with respect to previous editions, thus revealing advancement in state of the art. (shrink)

Answer-set programming (ASP) has emerged as a declarative programming paradigm where problems are encoded as logic programs, such that the so-called answer sets of theses programs represent the solutions of the encoded problem. The efficiency of the latest ASP solvers reached a state that makes them applicable for problems of practical importance. Consequently, problems from many different areas, including diagnosis, data integration, and graph theory, have been successfully tackled via ASP. In this work, we present such ASP-encodings for problems associated (...) to abstract argumentation frameworks (AFs) and generalisations thereof. Our encodings are formulated as fixed queries, such that the input is the only part depending on the actual AF to process. We illustrate the functioning of this approach, which is underlying a new argumentation system called ASPARTIX in detail and show its adequacy in terms of computational complexity. (shrink)

This study explores the way that belief systems, interactions with social or experimental environments, and skills at the “control” level in decision‐making shape people's behavior as they solve problems. It is argued that problem‐solvers' beliefs (not necessarily consciously held) about what is useful in mathematics may determine the set of “cognitive resources” at their disposal as they do mathematics. Such beliefs may, for example, render inaccessible to them large bodies of information that are stored in long‐term memory and that are (...) easily retrieved in other circumstances. In other cases, individuals' reactions to an experimental setting (fear of failure, or the desire to “look mathematical” while being videotaped) may induce behavior that is almost pathological—and at the same time, so consistent that it can be modeled. In general, such “environmental” factors establish the context within which individuals access and utilize the information potentially at their disposal.Protocols illustrating these points are presented and discussed. A model based on an axiomatization of students' beliefs about plane geometry is outlined, and is shown to correspond closely to their problem‐solving performance. A framework is offered for analyzing problem‐solving performance at three qualitatively different levels: access to cognitive resources stored in LTM, executive or control decision‐making, and belief systems. (shrink)

Psychoanalysis sets out to solve the riddles and enigmas of the psyche. For Adorno, however, psychoanalysis itself is an enigma. Why, he asks, have both the theory and its therapeutic applications become entangled in insoluble contradictions? Adorno identifies to a certain extent with the great psychoanalytic riddle-solvers, Freud and Ferenczi, as he probes these contradictions. He hopes, however, to move beyond the limits of a theory that reduces all phenomena to psychological factors, so he also approaches the problem as a (...) sociologist. This perspective enables him to describe the static and dynamic aspects of the social structure within which psychoanalysis developed in the first half of the 20th century. And it frees him, furthermore, from the misconception that Freud passed on to most of his followers: the belief that they were pursuing a natural science of the soul, which would generate its own rigorously scientific psychological technique. (shrink)

The usual representation of quantum algorithms, limited to the process of solving the problem, is physically incomplete. We complete it in three steps: extending the representation to the process of setting the problem, relativizing the extended representation to the problem solver to whom the problem setting must be concealed, and symmetrizing the relativized representation for time reversal to represent the reversibility of the underlying physical process. The third steps projects the input state of the representation, where the problem (...) class='Hi'>solver is completely ignorant of the setting and thus the solution of the problem, on one where she knows half solution. Completing the physical representation shows that the number of computation steps required to solve any oracle problem in an optimal quantum way should be that of a classical algorithm endowed with the advanced knowledge of half solution. (shrink)

Stereotypically, computation involves intrinsic changes to the medium of representation: writing new symbols, erasing old symbols, turning gears, flipping switches, sliding abacus beads. Perspectival computation leaves the original inscriptions untouched. The problem solver obtains the output by merely alters his orientation toward the input. There is no rewriting or copying of the input inscriptions; the output inscriptions are numerically identical to the input inscriptions. This suggests a loophole through some of the computational limits apparently imposed by physics. There can (...) be symbol manipulation without inscription manipulation because symbols are complex objects that have manipulatable elements besides their inscriptions. Since a written symbol is an ordered pair of consisting of a shape and the reader's orientation to that inscription, the symbol can be changed by changing the orientation rather than inscription. Although there are the usual physical limits associated with reading the answer, the computation is itself instantaneous. This is true even when the sub-calculations are algorithmically complex, exponentially increasing or even infinite. (shrink)

Behavior that solves a problem is distinguished by the fact that it changes another part of the solver's behavior and is strengthened when it does so. Problem solving typically involves the construction of discriminative stimuli. Verbal responses produce especially useful stimuli, because they affect other people. As a culture formulates maxims, laws, grammar, and science, its members behave more effectively without direct or prolonged contact with the contingencies thus formulated. The culture solves problems for its members, and does so (...) by transmitting the verbal discriminative stimuli called rules. Induction, deduction, and the construction of models are ways of producing rules. Behavior that solves a problem may result from direct shaping by contingencies or from rules constructed either by the problem solver or by others. Because different controlling variables are involved, contingency-shaped behavior is never exactly like rule-governed behavior. The distinction must take account of a system which establishes certain contingencies of reinforcement, such as some part of the natural environment, a piece of equipment, or a verbal community; the behavior shaped and maintained by these contingencies; rules, derived from the contingencies, which specify discriminative stimuli, responses, and consequences, and the behavior occasioned by the rules. (shrink)

This book stands at the intersection of two topics: the decidability and computational complexity of hybrid logics, and the deductive systems designed for them. Hybrid logics are here divided into two groups: standard hybrid logics involving nominals as expressions of a separate sort, and non-standard hybrid logics, which do not involve nominals but whose expressive power matches the expressive power of binder-free standard hybrid logics.The original results of this book are split into two parts. This division reflects the division of (...) the book itself. The first type of results concern model-theoretic and complexity properties of hybrid logics. Since hybrid logics which we call standard are quite well investigated, the efforts focused on hybrid logics referred to as non-standard in this book. Non-standard hybrid logics are understood as modal logics with global counting operators ) whose expressive power matches the expressive power of binder-free standard hybrid logics. The relevant results comprise: 1. Establishing a sound and complete axiomatization for the modal logic K with global counting operators ), which can be easily extended onto other frame classes, 2. Establishing tight complexity bounds, namely NExpTime-completeness for the modal logic with global counting operators defined over the classes of arbitrary, reflexive, symmetric, serial and transitive frames ), MT), MD), MB), MK4) with numerical subscripts coded in binary. Establishing the exponential-size model property for this logic defined over the classes of Euclidean and equivalential frames ), MS5).Results of the second type consist of designing concrete deductive systems for standard and non-standard hybrid logics. More precisely, they include: 1. Devising a prefixed and an internalized tableau calculi which are sound, complete and terminating for a rich class of binder-free standard hybrid logics. An interesting feature of indicated calculi is the nonbranching character of the rule, 2. Devising a prefixed and an internalized tableau calculi which are sound, complete and terminating for non-standard hybrid logics. The internalization technique applied to a tableau calculus for the modal logic with global counting operators is novel in the literature, 3. Devising the first hybrid algorithm involving an inequality solver for modal logics with global counting operators. Transferring the arithmetical part of reasoning to an inequality solver turned out to be sufficient in ensuring termination.The book is directed to philosophers and logicians working with modal and hybrid logics, as well as to computer scientists interested in deductive systems and decision procedures for logics. Extensive fragments of the first part of the book can also serve as an introduction to hybrid logics for wider audience interested in logic.The content of the book is situated in the areas of formal logic and theoretical computer science with some elements of the theory of computational complexity. (shrink)

A person's cognitive map, or knowledge of large‐scale space, is built up from observations gathered as he travels through the environment. It acts as a problem solver to find routes and relative positions, as well as describing the current location. The TOUR model captures the multiple representations that make up the cognitive map, the problem‐solving strategies it uses, and the mechanisms for assimilating new information. The representations have rich collections of states of partial knowledge, which support many of the (...) performance characteristics of common‐sense knowledge. (shrink)

This paper investigates the Generalized Traveling Salesman Problem (GTSP), which is an extension of the well-known Traveling Salesman Problem (TSP), and it searches for an optimal tour in a clustered graph, such that every cluster is visited exactly once. In this paper, we describe a novel Memetic Algorithm (MA) for solving efficiently the GTSP. Our proposed MA has at its core a genetic algorithm (GA), completed by a Chromosome Enhancement Procedure (CEP), which is based on a TSP solver and (...) the Shortest Path (SP) algorithm and for improving the convergence characteristics of the GA, a Local Search (LS) operation is applied for the best chromosomes in each generation. We tested our algorithm on a set of well-known instances from the literature and the achieved results prove that our novel memetic algorithm is highly competitive against the existing solution approaches from the specialized literature. (shrink)

This paper aims to provide a unifying approach to the analysis of understanding coherencies and understanding subject matters by highlighting the contextualist nature of understanding. Inspired by the relevant alternatives contextualism about knowledge, I will argue that understanding inherently has context-sensitive features and that a theory of understanding that highlights those features can incorporate our intuitions towards understanding as well as consolidate the different accounts of how to analyse understanding. In developing a contextualist account of understanding, I will argue that (...) an account of the features commonly taken to be central to understanding greatly benefits from a contextualist framework. Central to my analysis will be the claim that a person has to fulfill the function of a competent problem solver in order to qualify for the ascription of understanding. In addition to the theoretical elucidation of my contextualist approach to understanding, a demanding hypothetical scenario will be developed to function as a test case. (shrink)