Enhancing Zero-Shot Chain-of-Thought Reasoning in Large Language Models through Logic

Recent advancements in large language models have showcased their remarkable generalizability across various domains. However, their reasoning abilities still have significant room for improvement, especially when confronted with scenarios requiring multi-step reasoning. Although large language models possess extensive knowledge, their behavior, particularly in terms of reasoning, often fails to effectively utilize this knowledge to establish a coherent thinking paradigm. Generative language models sometimes show hallucinations as their reasoning procedures are unconstrained by logical principles. Aiming to improve the zero-shot chain-of-thought reasoning ability of large language models, we propose Logical Chain-of-Thought (LogiCoT), a neurosymbolic framework that leverages principles from symbolic logic to verify and revise the reasoning processes accordingly. Experimental evaluations conducted on language tasks in diverse domains, including arithmetic, commonsense, symbolic, causal inference, and social problems, demonstrate the efficacy of the enhanced reasoning paradigm by logic

COGNITIVE PROCESSES IN ENGINEERING DESIGN

Metadata merged with duplicate record (http://hdl.handle.net/10026.1/2519) on 20.12.2016 by CS (TIS).This is a digitised version of a thesis that was deposited in the University Library. If you are the author please contact PEARL Admin ([email protected]) to discuss options.The central aim of the current research programme was to gain an understanding of the cognitive processes involved in engineering design. Since little previous empirical research has investigated this domain, two major exploratory studies were undertaken here. Study One monitored seven final-year students tackling extended design projects. Diary and interview data were used to construct detailed design behaviour graphs that decomposed activities into structured representations reflecting the goals and subgoals that were pursued. Study Two involved individual observation (using video) of six professional engineers "thinking-aloud" as they tackled a small-scale design problem in a laboratory setting. A taxonomic scheme was developed to classify all verbal protocol units and other observable behaviours. In interpreting the data extensive use was made of theoretical concepts (e. g. schemas and mental models) deriving from current research on human problem solving and thinking. Evidence indicated that the engineers studied had many similar methods of working which could be described at a high level of abstraction in terms of a common "design schema". A central aspect of this schema was a problem reduction strategy which was used to break down complex design problems into more manageable subproblems. The data additionally revealed certain differences in design strategy between engineers' solution modelling activities and also showed up tendencies toward error and suboptimal performance. In this latter respect a particularly common tendency was for designers to "satisfice", that is to focus exclusively on initial solution concepts rather than comparing alternatives with the aim of optimising choices. The general implications of the present findings are discussed in relation to both the training of design skills and the development of intelligent computer systems to aid or automate the design process. A final, smaller scale of experimental study is also reported which investigated the possibility of improving design processes via subtle interventions aimed at imposing greater structure on design behaviours.The Department of Computer Science, University of Reading and Plessey Semiconductors, Roboroug

Weakest Pre-Condition and Data Flow Testing

Current data flow testing criteria cannot be applied to test array elements for two reasons: 1. The criteria are defined in terms of graph theory which is insufficiently expressive to investigate array elements. 2. Identifying input data which test a specified array element is an unsolvable problem. We solve the first problem by redefining the criteria without graph theory. We address the second problem with the invention of the wp_du method, which is based on Dijkstra\u27s weakest pre-condition formalism. This method accomplishes the following: Given a program, a def-use pair and a variable (which can be an array element), the method computes a logical expression which characterizes all the input data which test that def-use pair with respect to that variable. Further, for any data flow criterion, this method can be used to construct a logical expression which characterizes all test sets which satisfy that data flow criterion. Although the wp_du method cannot avoid unsolvability, it does confine the presence of unsolvability to the final step in constructing a test set

Spartan Daily, March 11, 1958

Volume 45, Issue 87https://scholarworks.sjsu.edu/spartandaily/12579/thumbnail.jp

Spartan Daily, February 17, 1977

Volume 68, Issue 12https://scholarworks.sjsu.edu/spartandaily/6166/thumbnail.jp