Tesis sobre el tema "Computational reasoning"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte los 50 mejores tesis para su investigación sobre el tema "Computational reasoning".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Explore tesis sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.
Zanuttini, Bruno. "Computational Aspects of Learning, Reasoning, and Deciding". Habilitation à diriger des recherches, Université de Caen, 2011. http://tel.archives-ouvertes.fr/tel-00995250.
Texto completoPease, Alison. "A computational model of Lakatos-style reasoning". Thesis, University of Edinburgh, 2007. http://hdl.handle.net/1842/2113.
Texto completoSanchez, Roberto. "Improving Computational Efficiency in Context-Based Reasoning Simulations". Honors in the Major Thesis, University of Central Florida, 2003. http://digital.library.ucf.edu/cdm/ref/collection/ETH/id/416.
Texto completoBachelors
Engineering and Computer Science
Computer Engineering
Broxvall, Mathias. "A Study in the Computational Complexity of Temporal Reasoning". Doctoral thesis, Linköping : Univ, 2002. http://www.ep.liu.se/diss/science_technology/07/79/index.html.
Texto completoGriffith, Todd W. "A computational theory of generative modeling in scientific reasoning". Diss., Georgia Institute of Technology, 1999. http://hdl.handle.net/1853/8177.
Texto completoWong, Yiu Kwong. "Application of computational models and qualitative reasoning to economics". Thesis, Heriot-Watt University, 1996. http://hdl.handle.net/10399/688.
Texto completoSchoter, Andreas. "The computational application of bilattice logic to natural reasoning". Thesis, University of Edinburgh, 1996. http://hdl.handle.net/1842/434.
Texto completoHatzilygeroudis, Ioannis. "Integrating logic and objects for knowledge representation and reasoning". Thesis, University of Nottingham, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.334808.
Texto completoAronoff, Caroline Bradley. "A computational characterization of domain-based causal reasoning development in children". Thesis, Massachusetts Institute of Technology, 2018. http://hdl.handle.net/1721.1/119744.
Texto completoThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 71-72).
To better understand human intelligence, we must first understand how humans use and learn from stories. One important aspect of how humans learn from stories is our ability to reason about cause and eect. Psychological evidence suggests that when children develop the ability to learn cause-and-eect relationships from stories, they do so in discrete stages where each new stage enables the child to incorporate new kinds of information. In this thesis, I attempt to shed light on the mechanisms that underlie the development of causal reasoning in children. I create a behavior-level model, an explanatory theory, and an explanation-level model that account for the developmental stages. I implement these models on top of the Genesis Story Understanding System. The result is a psychologically plausible explanation-level model that captures the observed causal reasoning behaviors of children at dierent stages of developments. The model also takes the observations from psychological evidence to another level by proposing mechanisms that enable such development in children.
by Caroline Bradley Aronoff.
M. Eng.
Fischer, Olivier. "Cognitively plausible heuristics to tackle the computational complexity of abductive reasoning /". The Ohio State University, 1991. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487694389394369.
Texto completoVyshemirsky, Vladislav. "Probabilistic reasoning and inference for systems biology". Thesis, Connect to e-thesis. Move to record for print version, 2007. http://theses.gla.ac.uk/47/.
Texto completoPh.D. thesis submitted to the Information and Mathematical Sciences Faculty, Department of Computing Science, University of Glasgow, 2007. Includes bibliographical references. Print version also available.
Roberts, David L. "Computational techniques for reasoning about and shaping player experiences in interactive narratives". Diss., Georgia Institute of Technology, 2010. http://hdl.handle.net/1853/33910.
Texto completoMultmeier, Jan [Verfasser]. "Representations facilitate Bayesian reasoning : computational facilitation and ecological design revisited / Jan Multmeier". Berlin : Freie Universität Berlin, 2012. http://d-nb.info/1029955263/34.
Texto completoAtkinson, Katie Marie. "What should we do? : computational representation of persuasive argument in practical reasoning". Thesis, University of Liverpool, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.426134.
Texto completoCosta, Leite Manuel da. "Hypothetical reasoning in scientific discovery contexts : a preliminary cognitive science-motivated analysis". Thesis, University of Sussex, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.259709.
Texto completoWilliams, Clive Richard. "ATLAS : a natural language understanding system". Thesis, University of Bristol, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.320139.
Texto completoHarris, M. R. "Computational modelling of transitive inference : a microanalysis of a simple form of reasoning". Thesis, University of Edinburgh, 1988. http://hdl.handle.net/1842/18943.
Texto completoFernández, Gil Oliver. "Adding Threshold Concepts to the Description Logic EL". Doctoral thesis, Universitätsbibliothek Leipzig, 2016. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-204523.
Texto completoCiatto, Giovanni <1992>. "On the role of Computational Logic in Data Science: representing, learning, reasoning, and explaining knowledge". Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2022. http://amsdottorato.unibo.it/10192/1/phd-thesis-1.1.0%2B2022-04-17-10-08.pdf.
Texto completoMeikle, Laura Isabel. "Intuition in formal proof : a novel framework for combining mathematical tools". Thesis, University of Edinburgh, 2014. http://hdl.handle.net/1842/9663.
Texto completoBerreby, Fiona. "Models of Ethical Reasoning". Electronic Thesis or Diss., Sorbonne université, 2018. http://www.theses.fr/2018SORUS137.
Texto completoThis thesis is part of the ANR eThicAa project, which has aimed to define moral autonomous agents, provide a formal representation of ethical conflicts and of their objects (within one artificial moral agent, between an artificial moral agent and the rules of the system it belongs to, between an artificial moral agent and a human operator, between several artificial moral agents), and design explanation algorithms for the human user. The particular focus of the thesis pertains to exploring ethical conflicts within a single agent, as well as designing explanation algorithms. The work presented here investigates the use of high-level action languages for designing such ethically constrained autonomous agents. It proposes a novel and modular logic-based framework for representing and reasoning over a variety of ethical theories, based on a modified version of the event calculus and implemented in Answer Set Programming. The ethical decision-making process is conceived of as a multi-step procedure captured by four types of interdependent models which allow the agent to represent situations, reason over accountability and make ethically informed choices. More precisely, an action model enables the agent to appraise its environment and the changes that take place in it, a causal model tracks agent responsibility, a model of the Good makes a claim about the intrinsic value of goals or events, and a model of the Right considers what an agent should do, or is most justified in doing, given the circumstances of its actions. The causalmodel plays a central role here, because it permits identifying some properties that causal relations assume and that determine how, as well as to what extent, we may ascribe ethical responsibility on their basis. The overarching ambition of the presented research is twofold. First, to allow the systematic representation of an unbounded number of ethical reasoning processes, through a framework that is adaptable and extensible by virtue of its designed hierarchisation and standard syntax. Second, to avoid the pitfall of some works in current computational ethics that too readily embed moralinformation within computational engines, thereby feeding agents with atomic answers that fail to truly represent underlying dynamics. We aim instead to comprehensively displace the burden of moral reasoning from the programmer to the program itself
Lee, Yoonhyoung Gordon Peter C. "Linguistic complexity and working memory structure effect of the computational demands of reasoning on syntactic complexity /". Chapel Hill, N.C. : University of North Carolina at Chapel Hill, 2007. http://dc.lib.unc.edu/u?/etd,797.
Texto completoTitle from electronic title page (viewed Dec. 18, 2007). "... in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the Department of Psychology (Cognitive Psychology)." Discipline: Psychology; Department/School: Psychology.
Kramdi, Seifeddine. "A modal approach to model computational trust". Thesis, Toulouse 3, 2015. http://www.theses.fr/2015TOU30146/document.
Texto completoThe concept of trust is a socio-cognitive concept that plays an important role in representing interactions within concurrent systems. When the complexity of a computational system and its unpredictability makes standard security solutions (commonly called hard security solutions) inapplicable, computational trust is one of the most useful concepts to design protocols of interaction. In this work, our main objective is to present a prospective survey of the field of study of computational trust. We will also present two trust models, based on logical formalisms, and show how they can be studied and used. While trying to stay general in our study, we use service-oriented architecture paradigm as a context of study when examples are needed. Our work is subdivided into three chapters. The first chapter presents a general view of the computational trust studies. Our approach is to present trust studies in three main steps. Introducing trust theories as first attempts to grasp notions linked to the concept of trust, fields of application, that explicit the uses that are traditionally associated to computational trust, and finally trust models, as an instantiation of a trust theory, w.r.t. some formal framework. Our survey ends with a set of issues that we deem important to deal with in priority in order to help the advancement of the field. The next two chapters present two models of trust. Our first model is an instantiation of Castelfranchi & Falcone's socio-cognitive trust theory. Our model is implemented using a Dynamic Epistemic Logic that we propose. The main originality of our solution is the fact that our trust definition extends the original model to complex action (programs, composed services, etc.) and the use of authored assignment as a special kind of atomic actions. The use of our model is then illustrated in a case study related to service-oriented architecture. Our second model extends our socio-cognitive definition to an abductive framework that allows us to associate trust to explanations. Our framework is an adaptation of Bochman's production relations to the epistemic case. Since Bochman approach was initially proposed to study causality, our definition of trust in this second model presents trust as a special case of causal reasoning, applied to a social context. We end our manuscript with a conclusion that presents how we would like to extend our work
Banerjee, Bonny. "Spatial problem solving for diagrammatic reasoning". Columbus, Ohio : Ohio State University, 2007. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1194455860.
Texto completoLiu, Xudong. "MODELING, LEARNING AND REASONING ABOUT PREFERENCE TREES OVER COMBINATORIAL DOMAINS". UKnowledge, 2016. http://uknowledge.uky.edu/cs_etds/43.
Texto completoMiranda, Luís Miguel Gonçalves. "Data fusion with computational intelligence techniques: a case study of fuzzy inference for terrain assessment". Master's thesis, Faculdade de Ciências e Tecnologia, 2014. http://hdl.handle.net/10362/12338.
Texto completoWith the constant technology progression is inherent storage of all kinds of data. Satellites, mobile phones, cameras and other type of electronic equipment, produce on daily basis an amount of data of gigantic proportions. These data alone may not convey any meaning and may even be impossible to interpret them without specific auxiliary measures. Data fusion contributes in this issue giving use of these data, processing them into proper knowledge for whom analyzes. Within data fusion there are numerous processing approaches and methodologies, being given here highlight to the one that most resembles to the imprecise human knowledge, the fuzzy reasoning. These method is applied in several areas, inclusively as inference system for hazard detection and avoidance in unmanned space missions. To this is fundamental the use of fuzzy inference systems, where the problem is modeled through a set of linguistic rules, fuzzy sets, membership functions and other information. In this thesis it was developed a fuzzy inference system, for safe landing sites using fusion of maps, and a data visualization tool. Thus, classification and validation of the information are made easier with such tools.
Abbas, Kaja Moinudeen. "Bayesian Probabilistic Reasoning Applied to Mathematical Epidemiology for Predictive Spatiotemporal Analysis of Infectious Diseases". Thesis, University of North Texas, 2006. https://digital.library.unt.edu/ark:/67531/metadc5302/.
Texto completoGibson, Andrew P. "Reflective writing analytics and transepistemic abduction". Thesis, Queensland University of Technology, 2017. https://eprints.qut.edu.au/106952/1/Andrew_Gibson_Thesis.pdf.
Texto completoLee, Jae Hee [Verfasser], Christian [Akademischer Betreuer] Freksa y Li [Akademischer Betreuer] Sanjiang. "Qualitative Reasoning about Relative Directions : Computational Complexity and Practical Algorithm [[Elektronische Ressource]] / Jae Hee Lee. Gutachter: Christian Freksa ; Li Sanjiang. Betreuer: Christian Freksa". Bremen : Staats- und Universitätsbibliothek Bremen, 2013. http://d-nb.info/1072077922/34.
Texto completoSkone, Gwyn S. "Stratagems for effective function evaluation in computational chemistry". Thesis, University of Oxford, 2010. http://ora.ox.ac.uk/objects/uuid:8843465b-3e5f-45d9-a973-3b27949407ef.
Texto completoAntos, Dimitrios. "Deploying Affect-Inspired Mechanisms to Enhance Agent Decision-Making and Communication". Thesis, Harvard University, 2012. http://dissertations.umi.com/gsas.harvard:10107.
Texto completoEngineering and Applied Sciences
Furno, Domenico. "Hybrid approaches based on computational intelligence and semantic web for distributed situation and context awareness". Doctoral thesis, Universita degli studi di Salerno, 2013. http://hdl.handle.net/10556/927.
Texto completoThe research work focuses on Situation Awareness and Context Awareness topics. Specifically, Situation Awareness involves being aware of what is happening in the vicinity to understand how information, events, and one’s own actions will impact goals and objectives, both immediately and in the near future. Thus, Situation Awareness is especially important in application domains where the information flow can be quite high and poor decisions making may lead to serious consequences. On the other hand Context Awareness is considered a process to support user applications to adapt interfaces, tailor the set of application-relevant data, increase the precision of information retrieval, discover services, make the user interaction implicit, or build smart environments. Despite being slightly different, Situation and Context Awareness involve common problems such as: the lack of a support for the acquisition and aggregation of dynamic environmental information from the field (i.e. sensors, cameras, etc.); the lack of formal approaches to knowledge representation (i.e. contexts, concepts, relations, situations, etc.) and processing (reasoning, classification, retrieval, discovery, etc.); the lack of automated and distributed systems, with considerable computing power, to support the reasoning on a huge quantity of knowledge, extracted by sensor data. So, the thesis researches new approaches for distributed Context and Situation Awareness and proposes to apply them in order to achieve some related research objectives such as knowledge representation, semantic reasoning, pattern recognition and information retrieval. The research work starts from the study and analysis of state of art in terms of techniques, technologies, tools and systems to support Context/Situation Awareness. The main aim is to develop a new contribution in this field by integrating techniques deriving from the fields of Semantic Web, Soft Computing and Computational Intelligence. From an architectural point of view, several frameworks are going to be defined according to the multi-agent paradigm. Furthermore, some preliminary experimental results have been obtained in some application domains such as Airport Security, Traffic Management, Smart Grids and Healthcare. Finally, future challenges is going to the following directions: Semantic Modeling of Fuzzy Control, Temporal Issues, Automatically Ontology Elicitation, Extension to other Application Domains and More Experiments. [edited by author]
XI n.s.
Johansson, Rebecka. "Programmering som verktyg för lärande i matematik : - En empirisk studie av elevers resonemangsförmåga i två olika undervisningsmiljöer". Thesis, Örebro universitet, Institutionen för naturvetenskap och teknik, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:oru:diva-69667.
Texto completoProgramming as a learning tool in mathematics - An empirical study of pupils’ mathematical reasoning in two different educational environments In order to prepare pupils for a more and more digitalised world, programming has been included in the Swedish curriculum for mathematics since July 1, 2018. The purpose of this study was to examine if working in a programming environment, in comparison to an unplugged environment, would offer pupils new opportunities for learning mathematics. This was examined by analysing the mathematical reasoning of the pupils during two different lessons; one where they worked without computers and one where they used computers and worked with block programming. The participating pupils worked in pairs, and the work and process of the pupils was observed and recorded by field notes and audio recordings. The learning opportunities was examined and the pupils' mathematical reasoning during both lessons was analysed. Four questions served as basis for the analysis, and the results showed a difference in the pupils’ mathematical reasoning in the two different learning environments. At an individual level, the results varied as regards which working environment was the most beneficial. At a group level, on the other hand, more of the pupils were able to follow each other’s mathematical reasoning when working in the programming environment. Furthermore, most of the pupils were more perseverant in solving the tasks when working in the programming environment. The possible cause of these differences is discussed in connection to the results of this study as well as to previous research. The conclusion is, a programming environment can offer the pupils new opportunities to learn and should be used as one of many ways to teach mathematics.
Mendes, Daniel Roque. "The role of system dynamics in the promotion of scientific computation literacy an exploration - comprising an analytical study and an empirical survey - of system dynamics' potential for promoting scientific reasoning and computational thinking, and in modifying the science learner's epistemological commitments, respectively /". [S.l.] : [s.n.], 1999. http://deposit.ddb.de/cgi-bin/dokserv?idn=965211339.
Texto completoCarbin, Michael (Michael James). "Logical reasoning for approximate and unreliable computation". Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/99813.
Texto completoCataloged from PDF version of thesis.
Includes bibliographical references (pages 343-350).
Improving program performance and resilience are long-standing goals. Traditional approaches include a variety of transformation, compilation, and runtime techniques that share the common property that the resulting program has the same semantics as the original program. However, researchers have recently proposed a variety of new techniques that set aside this traditional restriction and instead exploit opportunities to change the semantics of programs to improve performance and resilience. Techniques include skipping portions of a program's computation, selecting different implementations of program's subcomputations, executing programs on unreliable hardware, and synthesizing values to enable programs to skip or execute through otherwise fatal errors. A major barrier to the acceptance these techniques in both the broader research community and in industrial practice is the challenge that the resulting programs may exhibit behaviors that differ from that of the original program, potentially jeopardizing the program's resilience, safety, and accuracy. This thesis presents the first general programming systems for precisely verifying and reasoning about the programs that result from these techniques. This thesis presents a programming language and program logic for verifying worst-case properties of a transformed program. Specifically the framework, enables verifying that a transformed program satisfies important assertions about its safety (e.g., that it does not access invalid memory) and accuracy (e.g., that it returns a result within a bounded distance of that of the original program). This thesis also presents a programming language and automated analysis for verifying a program's quantitative reliability - the probability the transformed program returns the same result as the original program - when executed on unreliable hardware. The results of this thesis, which include programming languages, program logics, program analysis, and applications thereof, present the first steps toward reaping the benefits of changing the semantics of programs in a beneficial yet principled way.
by Michael James Carbin.
Ph. D.
Magka, Despoina. "Foundations and applications of knowledge representation for structured entities". Thesis, University of Oxford, 2013. http://ora.ox.ac.uk/objects/uuid:4a3078cc-5770-4a9b-81d4-8bc52b41e294.
Texto completoFeng, Lu. "On learning assumptions for compositional verification of probabilistic systems". Thesis, University of Oxford, 2014. http://ora.ox.ac.uk/objects/uuid:12502ba2-478f-429a-a250-6590c43a8e8a.
Texto completoSmith, Marc L. "View-centric reasoning about parallel and distributed computation". Doctoral diss., University of Central Florida, 2000. http://digital.library.ucf.edu/cdm/ref/collection/RTD/id/1597.
Texto completoThe development of distributed applications has not progressed as rapidly as its enabling technologies. In part, this is due to the difficulty of reasoning about such complex systems. In contrast to sequential systems, parallel systems give rise to parallel events, and the resulting uncertainty of the observed order of these events. Loosely coupled distributed systems complicate this even further by introducing the element of multiple imperfect observers of these parallel events. The goal of this dissertation is to advance parallel and distributed systems development by producing a parameterized model that can be instantiated to reflect the computation and coordination properties of such systems. The result is a model called paraDOS that we show to be general enough to have instantiations of two very distinct distributed computation models, Actors and tuple space. We show how paraDOS allows us to use operational semantics to reason about computation when such reasoning must account for multiple, inconsistent and imperfect views. We then extend the paraDOS model with an abstraction to support composition of communicating computational systems. This extension gives us a tool to reason formally about heterogeneous systems, and about new distributed computing paradigms such as the multiple tuple spaces support seen in Sun's JavaSpaces and IBM's T Spaces.
Ph.D.
Doctorate;
School of Electrical Engineering and Computer Science
Engineering and Computer Science
Electrical Engineering and Computer Science
196 p.
xiv, 196 leaves, bound : ill. ; 28 cm.
Shahwan, Ahmad. "Processing Geometric Models of Assemblies to Structure and Enrich them with Functional Information". Thesis, Grenoble, 2014. http://www.theses.fr/2014GRENM023/document.
Texto completoThe digital mock-up (DMU) of a product has taken a central position in the product development process (PDP). It provides the geometric reference of the product assembly, as it defines the shape of each individual component, as well as the way components are put together. However, observations show that this geometric model is no more than a conventional representation of what the real product is. Additionally, and because of its pivotal role, the DMU is more and more required to provide information beyond mere geometry to be used in different stages of the PDP. An increasingly urging demand is functional information at different levels of the geometric representation of the assembly. This information is shown to be essential in phases such as geometric pre-processing for finite element analysis (FEA) purposes. In this work, an automated method is put forward that enriches a geometric model, which is the product DMU, with function information needed for FEA preparations. To this end, the initial geometry is restructured at different levels according to functional annotation needs. Prevailing industrial practices and representation conventions are taken into account in order to functionally interpret the pure geometric model that provides a start point to the proposed method
Jin, Yi. "Belief Change in Reasoning Agents: Axiomatizations, Semantics and Computations". Doctoral thesis, Technische Universität Dresden, 2006. https://tud.qucosa.de/id/qucosa%3A24983.
Texto completoBush, V. J. "Recursion transformations for run-time control of parallel computations". Thesis, University of Manchester, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.382888.
Texto completoJob, Dominic Edward. "Case-based reasoning and evolutionary computation techniques for FPGA programming". Thesis, Edinburgh Napier University, 2001. http://researchrepository.napier.ac.uk/Output/4272.
Texto completoUlrich, Karl T. "Computation and Pre-Parametric Design". Thesis, Massachusetts Institute of Technology, 1988. http://hdl.handle.net/1721.1/6845.
Texto completoBallout, Ali. "Apprentissage actif pour la découverte d'axiomes". Electronic Thesis or Diss., Université Côte d'Azur, 2024. http://www.theses.fr/2024COAZ4026.
Texto completoThis thesis addresses the challenge of evaluating candidate logical formulas, with a specific focus on axioms, by synergistically combining machine learning with symbolic reasoning. This innovative approach facilitates the automatic discovery of axioms, primarily in the evaluation phase of generated candidate axioms. The research aims to solve the issue of efficiently and accurately validating these candidates in the broader context of knowledge acquisition on the semantic Web.Recognizing the importance of existing generation heuristics for candidate axioms, this research focuses on advancing the evaluation phase of these candidates. Our approach involves utilizing these heuristic-based candidates and then evaluating their compatibility and consistency with existing knowledge bases. The evaluation process, which is typically computationally intensive, is revolutionized by developing a predictive model that effectively assesses the suitability of these axioms as a surrogate for traditional reasoning. This innovative model significantly reduces computational demands, employing reasoning as an occasional "oracle" to classify complex axioms where necessary.Active learning plays a pivotal role in this framework. It allows the machine learning algorithm to select specific data for learning, thereby improving its efficiency and accuracy with minimal labeled data. The thesis demonstrates this approach in the context of the semantic Web, where the reasoner acts as the "oracle," and the potential new axioms represent unlabeled data.This research contributes significantly to the fields of automated reasoning, natural language processing, and beyond, opening up new possibilities in areas like bioinformatics and automated theorem proving. By effectively marrying machine learning with symbolic reasoning, this work paves the way for more sophisticated and autonomous knowledge discovery processes, heralding a paradigm shift in how we approach and leverage the vast expanse of data on the semantic Web
Schwartz, Hansen A. "The acquisition of lexical knowledge from the web for aspects of semantic interpretation". Doctoral diss., University of Central Florida, 2011. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/5028.
Texto completoID: 029808979; System requirements: World Wide Web browser and PDF reader.; Mode of access: World Wide Web.; Thesis (Ph.D.)--University of Central Florida, 2011.; Includes bibliographical references (p. 141-160).
Ph.D.
Doctorate
Electrical Engineering and Computer Science
Engineering and Computer Science
Mroszczyk, Przemyslaw. "Computation with continuous mode CMOS circuits in image processing and probabilistic reasoning". Thesis, University of Manchester, 2014. https://www.research.manchester.ac.uk/portal/en/theses/computation-with-continuous-mode-cmos-circuits-in-image-processing-and-probabilistic-reasoning(57ae58b7-a08c-4a67-ab10-5c3a3cf70c09).html.
Texto completoMorais, Anuar Daian de. "O desenvolvimento do raciocínio condicional a partir do uso de teste no squeak etoys". reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2016. http://hdl.handle.net/10183/164383.
Texto completoThe present thesis presents an investigation into the development of conditional reasoning, considered a key component of logical-deductive thinking, in children and adolescents who participated in a programming experience with the software Squeak Etoys. The development of conditional reasoning is classified into stages related to the composition and reversal of transformations that operate on the implication, culminating in the full reversibility that corresponds, in Piaget’s theory, to the construction and mobilization of the Transformations INRC (Identity, Negation, Reciprocity and Correlation). These steps are identified from interviews conducted according to Piaget’s clinical method, through the application of three programming challenges with increasing complexity, whose solution involved the use of the logical operation of the implication. The interviews were conducted with eight children aged 10-16, who attended the final series of the Elementary School of two public schools. Based on the data, the analysis revealed the importance of combining thinking, which allows teenagers to systematically test all the possibilities for ordering and inclusion of the suggested commands, and to obtain the appropriate logical conclusions, while younger children do not achieve the same results. Moreover, in the thesis a discussion is conducted on the inclusion of the school in a digital culture under a constructivist perspective of building knowledge. In this context, the methodology of learning through projects has been presented as being appropriate and the Squeak Etoys software has appeared as an interesting possibility of developing projects and promoting the learning of mathematics. Finally, in this study a debate is also conducted on the importance of learning to plan in the school.
Santamaria, Daniele Francesco. "Automated Reasoning via a Multi-sorted Fragment of Computable Set Theory with Applications to Semantic Web". Doctoral thesis, Università di Catania, 2019. http://hdl.handle.net/10761/4137.
Texto completoGunes, Baydin Atilim. "Evolut ionary adap tat ion in cas e - bas ed reasoning. An application to cross-domain analogies for mediation". Doctoral thesis, Universitat Autònoma de Barcelona, 2013. http://hdl.handle.net/10803/129294.
Texto completoAnalogy plays a fundamental role in problem solving and it lies behind many processes central to human cognitive capacity, to the point that it has been considered "the core of cognition". Analogical reasoning functions through the process of transfer, the use of knowledge learned in one situation in another for which it was not targeted. The case-based reasoning (CBR) paradigm presents a highly related, but slightly different model of reasoning mainly used in artificial intelligence, different in part because analogical reasoning commonly focuses on cross-domain structural similarity whereas CBR is concerned with transfer of solutions between semantically similar cases within one specific domain. In this dissertation, we join these interrelated approaches from cognitive science, psychology, and artificial intelligence, in a CBR system where case retrieval and adaptation are accomplished by the Structure Mapping Engine (SME) and are supported by commonsense reasoning integrating information from several knowledge bases. For enabling this, we use a case representation structure that is based on semantic networks. This gives us a CBR model capable of recalling and adapting solutions from seemingly different, but structurally very similar domains, forming one of our contributions in this study. A traditional weakness of research on CBR systems has always been about adaptation, where most applications settle for a very simple "reuse" of the solution from the retrieved case, mostly through null adaptation or substitutional adaptation. The difficulty of adaptation is even more obvious for our case of cross-domain CBR using semantic networks. Solving this difficulty paves the way to another contribution of this dissertation, where we introduce a novel generative adaptation technique based on evolutionary computation that enables the spontaneous creation or modification of semantic networks according to the needs of CBR adaptation. For the evaluation of this work, we apply our CBR system to the problem of mediation, an important method in conflict resolution. The mediation problem is non-trivial and presents a very good real world example where we can spot structurally similar problems from domains seemingly as far as international relations, family disputes, and intellectual rights.
Mercier, Chloé. "Modéliser les processus cognitifs dans une tâche de résolution créative de problème : des approches symboliques à neuro-symboliques en sciences computationnelles de l'éducation". Electronic Thesis or Diss., Bordeaux, 2024. http://www.theses.fr/2024BORD0065.
Texto completoIntegrating transversal skills such as creativity, problem solving and computational thinking, into the primary and secondary curricula is a key challenge in today’s educational field. We postulate that teaching and assessing transversal competencies could benefit from a better understanding of the learners’ behaviors in specific activities that require these competencies. To this end, computational learning science is an emerging field that requires the close collaboration of computational neuroscience and educational sciences to enable the assessment of learning processes. We focus on a creative problem-solving task in which the subject is engaged into building a “vehicle” by combining modular robotic cubes. As part of an exploratory research action, we propose several approaches based on symbolic to neuro-symbolic formalisms, in order to specify such a task and model the behavior and underlying cognitive processes of a subject engaged in this task. Despite being at a very preliminary stage, such a formalization seems promising to better understand complex mechanisms involved in creative problem solving at several levels: (i) the specification of the problem and the observables of interest to collect during the task; (ii) the cognitive representation of the problem space, depending on prior knowledge and affordance discovery, allowing to generate creative solution trajectories; (iii) an implementation of reasoning mechanisms within a neuronal substrate