Rozprawy doktorskie na temat „Raisonnement automatisé”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Sprawdź 29 najlepszych rozpraw doktorskich naukowych na temat „Raisonnement automatisé”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Przeglądaj rozprawy doktorskie z różnych dziedzin i twórz odpowiednie bibliografie.
Barcenas, Patino Ismael. "Raisonnement automatisé sur les arbres avec des contraintes de cardinalité". Phd thesis, Université de Grenoble, 2011. http://tel.archives-ouvertes.fr/tel-00569058.
Pełny tekst źródłaBarcenas, Everardo. "Raisonnement automatisé sur les arbres avec des contraintes de cardinalité". Phd thesis, Université de Grenoble, 2011. http://tel.archives-ouvertes.fr/tel-00578972.
Pełny tekst źródłaSerban, Cristina. "Raisonnement automatisé pour la logique de séparation avec des définitions inductives". Thesis, Université Grenoble Alpes (ComUE), 2018. http://www.theses.fr/2018GREAM030/document.
Pełny tekst źródłaThe main contribution of this thesis is a sound and complete proof system for entailments between inductive predicates, which are frequently encountered when verifying programs that work with dynamically allocated recursive data structures. We introduce a generalized proof system for first-order logic, and then adapt it to separation logic, a framework that addresses many of the difficulties posed by reasoning about dynamically allocated heaps. Soundness and completeness are ensured through four semantic restrictions and we also propose a proof-search semi-algorithm that becomes a decision procedure for the entailment problem when the semantic restrictions hold.This higher-order reasoning about entailments requires first-order decision procedures for the underlying logic when applying inference rules and during proof search. Thus, we provide two decision procedures for separation logic, considering the quantifier-free and the Exists*Forall*-quantified fragments, which were integrated in the open-source, DPLL(T)-based SMT solver CVC4.Finally, we also give an implementation of our proof system for separation logic, which uses these decision procedures. Given some inductive predicate definitions and an entailment query as input, a warning is issued when one or more semantic restrictions are violated. If the entailment is found to be valid, the output is a proof. Otherwise, one or more counterexamples are provided
Bermejo, Das Neves Carlos. "Probabilistic semantic network approach for the study of genotype-phenotype relations in the context of human genetic diseases". Electronic Thesis or Diss., Strasbourg, 2020. http://www.theses.fr/2020STRAJ093.
Pełny tekst źródłaThis thesis is about the development of a method for modeling complex systems using knowledge graphs and automated reasoning algorithms. The modeling method was applied to rare diseases to predict their causes from the genetic to the cellular, physiological, and whole organism levels. For the creation of the knowledge graph, two ontologies, GO and HPO, were used. Since there were no databases with relationships between these ontologies, a machine learning method was developed to infer relationships and applied to both GO and HPO ontologies. The thesis is completed by a machine learning method to infer deleterious effects after a genetic variation called INDEL. Altogether, the artificial intelligence work presented in this doctoral thesis assists rare disease researchers in understanding what happens in the human body at various levels of abstraction, from the occurrence of a genetic variation to the development of a rare disease
Ballout, Ali. "Apprentissage actif pour la découverte d'axiomes". Electronic Thesis or Diss., Université Côte d'Azur, 2024. http://www.theses.fr/2024COAZ4026.
Pełny tekst źródłaThis 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
Gonella, Régine. "Diagnostic de pannes sur avions : mise en œuvre d'un raisonnement révisable". Toulouse, ENSAE, 1989. http://www.theses.fr/1989ESAE0014.
Pełny tekst źródłaBousson, Kouamana. "Raisonnement causal pour la supervision de processus basée sur des modèles". Toulouse, INSA, 1993. http://www.theses.fr/1993ISAT0023.
Pełny tekst źródłaEl, Ouraoui Daniel. "Méthodes pour le raisonnement d'ordre supérieur dans SMT". Electronic Thesis or Diss., Université de Lorraine, 2021. http://www.theses.fr/2021LORR0023.
Pełny tekst źródłaMany applications, notably in the context of verification (for critical systems in transportation, energy, etc.), rely on checking the satisfiability of logic formulas. Satisfiability-modulo-theories (SMT) solvers handle large formulas in expressive languages with built-in and custom operators (e.g. arithmetic and data structure operators). These tools are built using a cooperation of a SAT (propositional satisfiability) solver to handle the Boolean structure of the formula and theory reasoners to tackle the atomic formulas (e.g. « x > y+z » for the theory of arithmetic). Currently, SMT solvers only handle first-order logic. They cannot reason about higher-order expressions, and they generally cannot perform proofs by induction. This is unfortunate, because most interactive verification tools, which use SMT solvers as back-end reasoning engines, offer higher-order languages. This thesis offers solutions to improve interactions between automatic solvers and proof assistants. In particular, we answer two important issues allowing us to improve the use of SMT solvers within proof assistants. Our first contribution consists in providing a suitable architecture to SMT solvers for higher-order logic. The second contribution aims to improve quantifier reasoning inside SMT solvers. For both approaches, we developed a practical implementation and provide a concrete evaluation on a large collection of problems mostly coming from formalization problems. The results obtained during these evaluations are encouraging and show that the developed techniques can provide good improvements for SMT solvers.Many applications, notably in the context of verification (for critical systems in transportation, energy, etc.), rely on checking the satisfiability of logic formulas. Satisfiability-modulo-theories (SMT) solvers handle large formulas in expressive languages with built-in and custom operators (e.g. arithmetic and data structure operators). These tools are built using a cooperation of a SAT (propositional satisfiability) solver to handle the Boolean structure of the formula and theory reasoners to tackle the atomic formulas (e.g. « x > y+z » for the theory of arithmetic). Currently, SMT solvers only handle first-order logic. They cannot reason about higher-order expressions, and they generally cannot perform proofs by induction. This is unfortunate, because most interactive verification tools, which use SMT solvers as back-end reasoning engines, offer higher-order languages. This thesis offers solutions to improve interactions between automatic solvers and proof assistants. In particular, we answer two important issues allowing us to improve the use of SMT solvers within proof assistants. Our first contribution consists in providing a suitable architecture to SMT solvers for higher-order logic. The second contribution aims to improve quantifier reasoning inside SMT solvers. For both approaches, we developed a practical implementation and provide a concrete evaluation on a large collection of problems mostly coming from formalization problems. The results obtained during these evaluations are encouraging and show that the developed techniques can provide good improvements for SMT solvers
Bernard, Denys. "Un système de raisonnement temporel basé sur le calcul d'évènements pour l'ordonnancement en maintenance aéronautique". Toulouse 3, 1992. http://www.theses.fr/1992TOU30162.
Pełny tekst źródłaBen, Rabah Nourhène. "APPROCHE INTELLIGENTE À BASE DE RAISONNEMENT À PARTIR DE CAS POUR LE DIAGNOSTIC EN LIGNE DES SYSTÈMES AUTOMATISÉS DE PRODUCTION". Thesis, Reims, 2018. http://www.theses.fr/2018REIMS036/document.
Pełny tekst źródłaAutomated production systems (APS) represents an important class of industrial systems that are increasingly complex given the large number of interactions and interconnections between their different components. As a result, they are more susceptible to malfunctions, whose consequences can be significant in terms of productivity, safety and quality of production. A major challenge is to develop an intelligent approach that can be used to diagnose these systems to ensure their operational safety. In this thesis, we are only interested in the diagnosis of APS with discrete dynamics. We present in the first chapter these systems, the possible malfunctions and the used terminology for the diagnosis. Then, we present a state of the art of the existing methods for the diagnosis of this class of systems and also a synthesis of these methods. This synthesis motivated us to choose a data-based approach that relies on a machine learning technique, which is Case-Based Reasoning (CBR). For this reason, we presented in the second chapter a state of the art on machine learning and its different methods with a focus mainly on the CBR and its uses for the diagnosis of industrial systems. This study allowed us to propose in Chapter 3 a Case Based Decision Support System for the diagnosis of APS. This system is based on an online block and an offline block. The Offline block is used to define a case representation format and to build a Normal Case Base (NCB) and a Faulty Case Base (FCB) from a historical database. The online block helps human operators of monitoring to make the most appropriate diagnosis decision. The experiments results perform on a sorting system presented the pillars of this approach, which reside in the proposed case representation format and in the used case base. To solve these problems and improve the results, a new case representation format is proposed in chapter 4. According to this format and from the data acquired from the simulated system after its emulation in normal and faulty mode, cases of the initial case base are build. Then, a reasoning and incremental learning phase is presented. This phase allows the system diagnosis and the enrichment of the case base following the appearance of new unknown behaviors. The experiments presented in Chapter 5 and perform on the 'turntable' which is a subsystem of the 'sorting system” allowed to show the improvement of the results and also to evaluate and compare the performances of the proposed approach with some automatic learning approaches and with a model-based approach to turntable diagnosis
Petit, Maxime. "Raisonnement et planification développementale d'un robot via une interaction enactive avec un humain". Phd thesis, Université Claude Bernard - Lyon I, 2014. http://tel.archives-ouvertes.fr/tel-01015288.
Pełny tekst źródłaDUMONT, D'AYOT Gilles. "Coopération et évaluation cognitive d'agents artificiels pour la supervision". Phd thesis, INSA de Toulouse, 2005. http://tel.archives-ouvertes.fr/tel-00009527.
Pełny tekst źródłaDaniel, Lionel. "Définition d'une logique probabiliste tolérante à l'inconsistance : appliquée à la reconnaissance de scénarios et à la théorie du vote". Phd thesis, École Nationale Supérieure des Mines de Paris, 2010. http://pastel.archives-ouvertes.fr/pastel-00537758.
Pełny tekst źródłaTutac, Épouse Branici Adina. "Représentation et raisonnement formels pour le pronostic basé sur l'imagerie médicale microscropique. Application à la graduation du cancer du sein". Phd thesis, Université de Franche-Comté, 2010. http://tel.archives-ouvertes.fr/tel-00560215.
Pełny tekst źródłaRasovska, Ivana. "Contribution à une méthodologie de capitalisation des connaissances basée sur le raisonnement à partir de cas : Application au diagnostic dans une plateforme d'e-maintenance". Phd thesis, Université de Franche-Comté, 2006. http://tel.archives-ouvertes.fr/tel-00257893.
Pełny tekst źródłaChatalic, Philippe. "Raisonnement deductif en presence de connaissances imprecises et incertaines : un systeme base sur la theorie de dempster-shafer". Toulouse 3, 1986. http://www.theses.fr/1986TOU30189.
Pełny tekst źródłaHaouchine, Mohamed Karim. "Remémoration guidée par l'adaptation et maintenance des systèmes de diagnostic industriel par l'approche du raisonnement à partir de cas". Phd thesis, Université de Franche-Comté, 2009. http://tel.archives-ouvertes.fr/tel-00466560.
Pełny tekst źródłaHeim, Bruno. "Approche ensembliste et par logique floue pour le diagnostic causal de procédés de raffinage : application à un pilote de FCC". Phd thesis, Grenoble INPG, 2003. http://tel.archives-ouvertes.fr/tel-00197531.
Pełny tekst źródłaBelard, Nuno. "Reasoning about models: detecting and isolating abnormalities in diagnostic systems". Phd thesis, Université Paul Sabatier - Toulouse III, 2012. http://tel.archives-ouvertes.fr/tel-00719547.
Pełny tekst źródłaMarin-Urias, Luis Felipe. "Planification et contrôle de mouvements en interaction avec l'homme. Reasoning about space for human-robot interaction". Phd thesis, Université Paul Sabatier - Toulouse III, 2009. http://tel.archives-ouvertes.fr/tel-00468918.
Pełny tekst źródłaAyrolles, Laurent. "Abstraction temporelle et interprétation quantitative/qualitative de processus à dynamiques multiples. Application aux processus biologiques". Phd thesis, Université Paul Sabatier - Toulouse III, 1996. http://tel.archives-ouvertes.fr/tel-00139748.
Pełny tekst źródłaLe, Tan. "Intégration de l'inférence abductive et inductive pour la représentation des connaissances dans les réseaux de gènes". Phd thesis, Université Paul Sabatier - Toulouse III, 2014. http://tel.archives-ouvertes.fr/tel-00996894.
Pełny tekst źródłaVidal, Thierry. "Le temps en planification et en ordonnancement : Vers une gestion complète et efficace de contraintes hétérogènes et entachées d'incertitude". Phd thesis, Université Paul Sabatier - Toulouse III, 1995. http://tel.archives-ouvertes.fr/tel-00144272.
Pełny tekst źródłaLe, Tan. "Intégration de l'inférence abductive et inductive pour la représentation des connaissances dans les réseaux de gènes". Phd thesis, Toulouse 3, 2014. http://thesesups.ups-tlse.fr/2337/.
Pełny tekst źródłaDiagnostic reasoning (abductive) and predictive reasoning (inductive) are two methods of reasoning that enable the discovery of new knowledge. When abductive reasoning is the process of finding the best explanation (hypothesis) for a set of observations (Josephson, 1994), the inductive reasoning is the process of predicting, from a set of observations, to find all possible results. These observations may be symptoms of a patient, experiments on genomic and metabolic networks, etc. In this PhD thesis, we are interested in the representation, analysis and synthesis of genomic signaling networks using hypothetical logic. In fact, this thesis focuses on modeling of signaling pathways in response to the DNA double stranded break. To implement the abduction, we use algorithms of production. Then, the default logic is used to build models of minimum representation. These algorithms are proven knowledge discovery on the map of DNA double-strand break. This map is minimal as biological causality graph and allows integrating bio-molecular data
Caulier, Patrice. "Méthodologie de capitalisation et de réutilisation de connaissances pour l'aide à la supervision des procédés automatises complexes : Application à la supervision du trafic téléphonique de l'Ile-de-France". Valenciennes, 1997. https://ged.uphf.fr/nuxeo/site/esupversions/4386115b-a677-4ce2-9612-b54f6ad7cfab.
Pełny tekst źródłaLesbegueries, Julien. "Plate-forme pour l'indexation spatiale multi-niveaux d'un corpus territorialisé". Phd thesis, Université de Pau et des Pays de l'Adour, 2007. http://tel.archives-ouvertes.fr/tel-00258534.
Pełny tekst źródłaNous proposons en effet une méthode de recherche d'information spatiale multi-niveaux indexant un corpus textuel brut. Cette méthode qui extrait l'information d'un corpus et l'interprète, permet d'améliorer l'efficacité de systèmes de recherche d'information à chaque fois que l'interrogation comporte une connotation spatiale. L'interprétation permet en outre de retrouver le contexte dans lequel l'information spatiale a été utilisée. En particulier, elle permet d'indexer des unités de texte en leur associant des contextes de type itinéraire, description locale ou comparaison de lieux.
El, Ayeb Béchir. "Méthodes, langages et outils de spécification et de construction des systèmes de diagnostic". Nancy 1, 1989. http://www.theses.fr/1989NAN10054.
Pełny tekst źródłaMohamed, Firas. "Approche à base de logique floue pour le test et le diagnostic des circuits analogiques". Grenoble INPG, 1997. http://www.theses.fr/1997INPG0082.
Pełny tekst źródłaMir, S. "Heuristic reasoning for an automatic commonsense understanding of logic electronic design specifications (English only)". Phd thesis, 1993. http://tel.archives-ouvertes.fr/tel-00010456.
Pełny tekst źródła