Дисертації з теми "Probabilistic logics"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 дисертацій для дослідження на тему "Probabilistic logics".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
Potyka, Nico [Verfasser]. "Solving Reasoning Problems for Probabilistic Conditional Logics with Consistent and Inconsistent Information / Nico Potyka." Hagen : Fernuniversität Hagen, 2016. http://d-nb.info/1082048402/34.
Повний текст джерелаWeidner, Thomas. "Probabilistic Logic, Probabilistic Regular Expressions, and Constraint Temporal Logic." Doctoral thesis, Universitätsbibliothek Leipzig, 2016. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-208732.
Повний текст джерелаBarbosa, Fábio Daniel Moreira. "Probabilistic propositional logic." Master's thesis, Universidade de Aveiro, 2016. http://hdl.handle.net/10773/22198.
Повний текст джерелаO termo Lógica Probabilística, em geral, designa qualquer lógica que incorpore conceitos probabilísticos num sistema lógico formal. Nesta dissertacção o principal foco de estudo e uma lógica probabilística (designada por Lógica Proposicional Probabilística Exógena), que tem por base a Lógica Proposicional Clássica. São trabalhados sobre essa lógica probabilística a síntaxe, a semântica e um cálculo de Hilbert, provando-se diversos resultados clássicos de Teoria de Probabilidade no contexto da EPPL. São também estudadas duas propriedades muito importantes de um sistema lógico - correcção e completude. Prova-se a correcção da EPPL da forma usual, e a completude fraca recorrendo a um algoritmo de satisfazibilidade de uma fórmula da EPPL. Serão também considerados na EPPL conceitos de outras lógicas probabilísticas (incerteza e probabilidades intervalares) e Teoria de Probabilidades (condicionais e independência).
The term Probabilistic Logic generally refers to any logic that incorporates probabilistic concepts in a formal logic system. In this dissertation, the main focus of study is a probabilistic logic (called Exogenous Probabilistic Propo- sitional Logic), which is based in the Classical Propositional Logic. There will be introduced, for this probabilistic logic, its syntax, semantics and a Hilbert calculus, proving some classical results of Probability Theory in the context of EPPL. Moreover, there will also be studied two important properties of a logic system - soundness and completeness. We prove the EPPL soundness in a standard way, and weak completeness using a satis ability algorithm for a formula of EPPL. It will be considered in EPPL concepts of other probabilistic logics (uncertainty and intervalar probability) and of Probability Theory (independence and conditional).
Klinov, Pavel. "Practical reasoning in probabilistic description logic." Thesis, University of Manchester, 2011. https://www.research.manchester.ac.uk/portal/en/theses/practical-reasoning-in-probabilistic-description-logic(6aff2ad0-dc76-44cf-909b-2134f580f29b).html.
Повний текст джерелаChakrapani, Lakshmi Narasimhan. "Probabilistic boolean logic, arithmetic and architectures." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/26706.
Повний текст джерелаCommittee Chair: Palem, Krishna V.; Committee Member: Lim, Sung Kyu; Committee Member: Loh, Gabriel H.; Committee Member: Mudge, Trevor; Committee Member: Yalamanchili, Sudhakar. Part of the SMARTech Electronic Thesis and Dissertation Collection.
Blakely, Scott. "Probabilistic Analysis for Reliable Logic Circuits." PDXScholar, 2014. https://pdxscholar.library.pdx.edu/open_access_etds/1860.
Повний текст джерелаFaria, Francisco Henrique Otte Vieira de. "Learning acyclic probabilistic logic programs from data." Universidade de São Paulo, 2017. http://www.teses.usp.br/teses/disponiveis/3/3141/tde-27022018-090821/.
Повний текст джерелаO aprendizado de um programa lógico probabilístico consiste em encontrar um conjunto de regras lógico-probabilísticas que melhor se adequem aos dados, a fim de explicar de que forma estão relacionados os atributos observados e predizer a ocorrência de novas instanciações destes atributos. Neste trabalho focamos em programas acíclicos, cujo significado é bastante claro e fácil de interpretar. Propõe-se que o processo de aprendizado de programas lógicos probabilísticos acíclicos deve ser guiado por funções de avaliação importadas da literatura de aprendizado de redes Bayesianas. Neste trabalho s~ao sugeridas novas técnicas para aprendizado de parâmetros que contribuem para uma melhora significativa na eficiência computacional do estado da arte representado pelo pacote ProbLog. Além disto, apresentamos novas técnicas para aprendizado da estrutura de programas lógicos probabilísticos acíclicos.
Misino, Eleonora. "Deep Generative Models with Probabilistic Logic Priors." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2021. http://amslaurea.unibo.it/24058/.
Повний текст джерелаWeidner, Thomas [Verfasser], Manfred [Akademischer Betreuer] Droste, Manfred [Gutachter] Droste, and Benedikt [Gutachter] Bollig. "Probabilistic Logic, Probabilistic Regular Expressions, and Constraint Temporal Logic / Thomas Weidner ; Gutachter: Manfred Droste, Benedikt Bollig ; Betreuer: Manfred Droste." Leipzig : Universitätsbibliothek Leipzig, 2016. http://d-nb.info/1240627777/34.
Повний текст джерелаForst, Jan Frederik. "POLIS : a probabilistic summarisation logic for structured documents." Thesis, Queen Mary, University of London, 2009. http://qmro.qmul.ac.uk/xmlui/handle/123456789/467.
Повний текст джерелаWagner, Daniel. "Finite-state abstractions for probabilistic computation tree logic." Thesis, Imperial College London, 2011. http://hdl.handle.net/10044/1/6348.
Повний текст джерелаMaksimović, Petar. "Développement et vérification des logiques probabilistes et des cadres logiques." Phd thesis, Université Nice Sophia Antipolis, 2013. http://tel.archives-ouvertes.fr/tel-00907854.
Повний текст джерелаMio, Matteo. "Game semantics for probabilistic modal μ-calculi". Thesis, University of Edinburgh, 2012. http://hdl.handle.net/1842/6223.
Повний текст джерелаCizelj, Igor. "Vehicle control from temporal logic specifications with probabilistic satisfaction guarantees." Thesis, Boston University, 2014. https://hdl.handle.net/2144/10967.
Повний текст джерелаTemporal logics, such as Linear Temporal Logic (LTL) and Computation Tree Logic (CTL), have become increasingly popular for specifying complex mission specifications in motion planning and control synthesis problems. This dissertation proposes and evaluates methods and algorithms for synthesizing control strategies for different vehicle models from temporal logic specifications. Complex vehicle models that involve systems of differential equations evolving over continuous domains are considered. The goal is to synthesize control strategies that maximize the probability that the behavior of the system, in the presence of sensing and actuation noise, satisfies a given temporal logic specification. The first part of this dissertation proposes an approach for designing a vehicle control strategy that maximizes the probability of accomplishing a motion specification given as a Probabilistic CTL (PCTL) formula. Two scenarios are examined. First, a threat-rich environment is considered when the motion of a vehicle in the environment is given as a finite transition system. Second, a noisy Dubins vehicle is considered. For both scenarios, the motion of the vehicle in the environment is modeled as a Markov Decision Process (MDP) and an approach for generating an optimal MDP control policy that maximizes the probability of satisfying the PCTL formula is introduced. The second part of this dissertation introduces a human-supervised control synthesis method for a noisy Dubins vehicle such that the expected time to satisfy a PCTL formula is minimized, while maintaining the satisfaction probability above a given probability threshold. A method for abstracting the motion of the vehicle in the environment in the form of an MDP is presented. An algorithm for synthesizing an optimal MDP control policy is proposed. If the probability threshold cannot be satisfied with the initial specification, the presented framework revises the specifica- tion until the supervisor is satisfied with the revised specification and the satisfaction probability is above the threshold. The third part of this dissertation focuses on the problem of stochastic control of a noisy differential drive mobile robot such that the probability of satisfying a time constrained specification, given as a Bounded LTL (BLTL) formula, is maximized. A method for mapping noisy sensor measurements to an MDP is introduced. Due to the size of the MDP, finding the exact solution is computationally too expensive. Correctness is traded for scalability, and an MDP control synthesis method based on Statistical Model Checking is introduced.
Hinojosa, William. "Probabilistic fuzzy logic framework in reinforcement learning for decision making." Thesis, University of Salford, 2010. http://usir.salford.ac.uk/26716/.
Повний текст джерелаFaix, Marvin. "Conception de machines probabilistes dédiées aux inférences bayésiennes." Thesis, Université Grenoble Alpes (ComUE), 2016. http://www.theses.fr/2016GREAM079/document.
Повний текст джерелаThe aim of this research is to design computers best suited to do probabilistic reasoning. The focus of the research is on the processing of uncertain data and on the computation of probabilistic distribution. For this, new machine architectures are presented. The concept they are designed on is different to the one proposed by Von Neumann, without any fixed or floating point arithmetic. These architectures could replace the current processors in sensor processing and robotic fields.In this thesis, two types of probabilistic machines are presented. Their designs are radically different, but both are dedicated to Bayesian inferences and use stochastic computing. The first deals with small-dimension inference problems and uses stochastic computing to perform the necessary operations to calculate the inference. This machine is based on the concept of probabilistic bus and has a strong parallelism.The second machine can deal with intractable inference problems. It implements a particular MCMC method: the Gibbs algorithm at the binary level. In this case, stochastic computing is used for sampling the distribution of interest. An important feature of this machine is the ability to circumvent the convergence problems generally attributed to stochastic computing. Finally, an extension of this second type of machine is presented. It consists of a generic and programmable machine designed to approximate solution to any inference problem
Roberts, Lesley. "Towards a probabilistic semantics for natural language /." [St. Lucia, Qld.], 2003. http://www.library.uq.edu.au/pdfserve.php?image=thesisabs/absthe18482.pdf.
Повний текст джерелаMyers, Catherine E. "Learning with delayed reinforcement in an exploratory probabilistic logic neural network." Thesis, Imperial College London, 1990. http://hdl.handle.net/10044/1/46462.
Повний текст джерелаPandya, Rashmibala. "A multi-layered framework for higher order probabilistic reasoning." Thesis, University of Exeter, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.364432.
Повний текст джерелаMartiny, Karsten [Verfasser]. "PDT logic : a probabilistic doxastic temporal logic for reasoning about beliefs in multi-agent systems / Karsten Martiny." Lübeck : Zentrale Hochschulbibliothek Lübeck, 2018. http://d-nb.info/1152030132/34.
Повний текст джерелаKucik, Paul D. "Probabilistic modeling of insurgency /." May be available electronically:, 2007. http://proquest.umi.com/login?COPT=REJTPTU1MTUmSU5UPTAmVkVSPTI=&clientId=12498.
Повний текст джерелаBona, Glauber De. "Measuring inconsistency in probabilistic knowledge bases." Universidade de São Paulo, 2016. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-04042016-045006/.
Повний текст джерелаEm termos de raciocínio probabilístico clássico, para se realizar inferências de uma base de conhecimento, normalmente é necessário garantir a consistência de tal base. Quando nos deparamos com um conjunto de probabilidades que são inconsistentes entre si, interessa-nos saber onde está a inconsistência, quão grave esta é, e como corrigi-la. Medidas de inconsistência têm sido recentemente propostas como uma ferramenta para endereçar essas questões na comunidade de Inteligência Artificial. Este trabalho investiga o problema da medição de inconsistência em bases de conhecimento probabilístico. Postulados básicos de racionalidade têm guiado a formulação de medidas de inconsistência na lógica clássica proposicional. No caso probabilístico, o carácter quantitativo da probabilidade levou a uma propriedade desejável adicional: medidas de inconsistência devem ser contínuas. Para atender a essa exigência, a inconsistência em bases de conhecimento probabilístico tem sido medida através da minimização de distâncias. Nesta tese, demonstramos que o postulado da continuidade é incompatível com propriedades desejáveis herdadas da lógica clássica. Como algumas dessas propriedades são baseadas em conjuntos inconsistentes minimais, nós procuramos por maneiras mais adequadas de localizar a inconsistência em lógica probabilística, analisando os processos de consolidação subjacentes. A teoria AGM de revisão de crenças é estendida para englobar a consolidação pelo ajuste de probabilidades. As novas formas de caracterizar a inconsistência que propomos são empregadas para enfraquecer alguns postulados, restaurando a compatibilidade de todo o conjunto de propriedades desejáveis. Investigações em estatística Bayesiana e em epistemologia formal têm se interessado pela medição do grau de incoerência de um agente. Nesses campos, probabilidades são geralmente interpretadas como graus de crença de um agente, determinando seu comportamento em apostas. Agentes incoerentes possuem graus de crença inconsistentes, que o expõem a transações de apostas desvantajosas - conhecidas como Dutch books. Estatísticos e filósofos sugerem medir a incoerência de um agente através do prejuízo garantido a qual ele está vulnerável. Nós provamos que estas medidas de incoerência via Dutch books são equivalentes a medidas de inconsistência via minimização de distâncias da comunidade de IA.
Kane, Thomas Brett. "Reasoning with uncertainty using Nilsson's probabilistic logic and the maximum entropy formalism." Thesis, Heriot-Watt University, 1992. http://hdl.handle.net/10399/789.
Повний текст джерелаGhahremani, Azghandi Nargess. "Petri nets, probability and event structures." Thesis, University of Edinburgh, 2014. http://hdl.handle.net/1842/9936.
Повний текст джерелаDellaluce, Jason. "Enhancing symbolic AI ecosystems with Probabilistic Logic Programming: a Kotlin multi-platform case study." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2021. http://amslaurea.unibo.it/23856/.
Повний текст джерелаSekar, Sanjana. "Logic Encryption Methods for Hardware Security." University of Cincinnati / OhioLINK, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1505124923353686.
Повний текст джерелаCeylan, Ismail Ilkan. "Query Answering in Probabilistic Data and Knowledge Bases." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2018. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-235238.
Повний текст джерелаMaksimovic, Petar. "Développement et Vérification des Logiques Probabilistes et des Cadres Logiques." Phd thesis, Université Nice Sophia Antipolis, 2013. http://tel.archives-ouvertes.fr/tel-00911547.
Повний текст джерелаChakraborty, Souymodip Verfasser], Joost-Pieter [Akademischer Betreuer] [Katoen, and Lijun [Akademischer Betreuer] Zhang. "New results on probabilistic verification : automata, logic and satisfiability / Souymodip Chakraborty ; Joost-Pieter Katoen, Lijun Zhang." Aachen : Universitätsbibliothek der RWTH Aachen, 2019. http://d-nb.info/119418426X/34.
Повний текст джерелаChakraborty, Souymodip [Verfasser], Joost-Pieter [Akademischer Betreuer] Katoen, and Lijun [Akademischer Betreuer] Zhang. "New results on probabilistic verification : automata, logic and satisfiability / Souymodip Chakraborty ; Joost-Pieter Katoen, Lijun Zhang." Aachen : Universitätsbibliothek der RWTH Aachen, 2019. http://d-nb.info/119418426X/34.
Повний текст джерелаGao, Xiaoxu. "Exploring declarative rule-based probabilistic frameworks for link prediction in Knowledge Graphs." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-210650.
Повний текст джерелаThe knowledge graph stores factual information from the web in form of relationships between entities. The quality of a knowledge graph is determined by its completeness and accuracy. However, most current knowledge graphs often miss facts or have incorrect information. Current link prediction solutions have problems of scalability and high labor costs. This thesis proposed a declarative rule-based probabilistic framework to perform link prediction. The system incorporates a rule-mining model into a hingeloss Markov random fields to infer links. Moreover, three rule optimization strategies were developed to improve the quality of rules. Compared with previous solutions, this work dramatically reduces manual costs and provides a more tractable model. Each proposed method has been evaluated with Average Precision or F-score on NELL and Freebase15k. It turns out that the rule optimization strategy performs the best. The MAP of the best model on NELL is 0.754, better than a state-of-the-art graphical model (0.306). The F-score of the best model on Freebase15k is 0.709.
Al, Shekaili Dhahi. "Integrating Linked Data search results using statistical relational learning approaches." Thesis, University of Manchester, 2017. https://www.research.manchester.ac.uk/portal/en/theses/integrating-linked-data-search-results-using-statistical-relational-learning-approaches(3f77386b-a38a-4110-8ce1-bda6340e6f0b).html.
Повний текст джерелаMorettin, Paolo. "Learning and Reasoning in Hybrid Structured Spaces." Doctoral thesis, Università degli studi di Trento, 2020. http://hdl.handle.net/11572/264203.
Повний текст джерелаArruda, Alexandre Matos. "Abdução clássica e abdução probabilística: a busca pela explicação de dados reais." Universidade de São Paulo, 2014. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-20102015-170210/.
Повний текст джерелаThe search for explanations of facts or phenomena is something that has always permeated human reasoning. Since antiquity, the human being usually observes facts and, according to them and his knowledge, create hypotheses that can explain them. A classic example is when we have medical consultation and the doctor, after checking all the symptoms, discovers what is the disease and the ways to treat it. This construction of explanations, given a set of evidence, we call \\textit. In traditional abduction methods it is assumed that the goal data has not yet been explained, that is, given a background knowledge base $\\Gamma$ and a goal data $A$ we have $\\Gamma ot \\vdash A$. Classical methods want to generate a new datum $H$ in such way that with the background knowledge base $\\Gamma$, we can infer $A$ ($\\Gamma \\cup H \\vdash A$). Some traditional methods use the analytical tableaux (see \\cite) for the generation of $H$. Here we deal with a cut-based abduction, with the KE-tableaux, which do not need to assume that the goal data is not derived from the knowledge base, and, moreover, with probabilistic logic (PSAT), rediscovered in \\cite, where we have probabilistic assignments to logical formulas. A PSAT instance is consistent if there is a probabilistic distribution over the assignments. The aim of our work is to define and establish what is an abduction in Probabilistic Logic (abduction for PSAT) and, moreover, provide methods for PSAT abduction: given a PSAT instance $\\left\\langle \\Gamma, \\Psi ightangle$ in atomic normal form \\cite and a formula $A$ such that there is a probabilistic distribution $\\pi$ that satisfies $\\left\\langle \\Gamma, \\Psi ightangle$ and $\\pi(A)=0$, each method is able to generate a formula $H$ such that $\\left\\langle \\Gamma \\cup H , \\Psi ightangle \\!\\!|\\!\\!\\!\\approx A$ where $\\pi(A) > 0$ for all distribution $\\pi$ that satisfies $\\left\\langle \\Gamma \\cup H , \\Psi ightangle$. We demonstrated that some of the our methods, shown in this work, are correct and complete for the generation of $H$.
Diebel, James Richard. "Bayesian image vectorization : the probabilistic inversion of vector image rasterization /." May be available electronically:, 2008. http://proquest.umi.com/login?COPT=REJTPTU1MTUmSU5UPTAmVkVSPTI=&clientId=12498.
Повний текст джерелаPalermo, Angela Giovanna. "Logique juridique et logique probabiliste à l'époque moderne." Thesis, Besançon, 2013. http://www.theses.fr/2013BESA1027/document.
Повний текст джерелаWhen I started to study the relationship between legal logic and probabilistic logic, I immediately realized that this relationship could not really be understood without investigating more specifically the link logic-rhetoric included in it. A long philosophical tradition has accustomed us to consider the legal logic as essentially tied to the rhetoric and the latter as completely detached from the logic.With the word "rhetoric" we usually refers to the '"art of speaking well." But ρητορική τέχνη (retoriké tekne) that arises in the fifth century BC on empirical grounds of the art court has, from its birth, a practical purpose : it wants to be an instrument of persuasion, and the medium he uses is the εικός (eikόs), the plausible. One of the foundations of Greek logic is thus to be found on the empirical grounds of judicial logic. But even if the rhetoric was born with practical and not theoretical purposes, however, this fact requires a study of argumentation theory and its evidence, apart from the prejudice that, even if logic and rhetoric are both related to the argument, the logic should deal with the correct arguments while rhetoric deals with only persuasive arguments.Through historical and logical analysis drawn from Aristotle and which comes to consider the positions of prominent contemporary scholars such as Giuliani, Taruffo, Capozzi, Cellucci, Spranzi, etc., in this article I will show that, instead, logic and rhetoric have a strong bond which should be rethought so as to better understand the essence of legal logic, but also because the break of dualism logical-rhetoric can open much wider perspectives of reflection. Particularly I refer to the reflection of logical and moral relationship that, in turn, would lead us to reflect on the opposition between mind and body. In fact, when we turn a look at the history of logic, we will realize that, since ancient times, there were no sharp and radicals divisions between logical and rhetorical field and that, even in modern times, it is possible to draw a line of continuity between the field of rigorous proof and the field of demonstration of rhetoric, thanks to the recognizable theoretical role of metaphor
Fares, George E. "Probabilistic fault location in combinational logic networks by multistage binary tree classifier algorith development, implementation results and efficiency." Thesis, University of Ottawa (Canada), 1989. http://hdl.handle.net/10393/5937.
Повний текст джерелаSpikes, Kyle Thomas. "Probabilistic seismic inversion based on rock-physics models for reservoir characterization /." May be available electronically:, 2008. http://proquest.umi.com/login?COPT=REJTPTU1MTUmSU5UPTAmVkVSPTI=&clientId=12498.
Повний текст джерелаOzdemir, Mustafa. "A Probabilistic Schedule Delay Analysis In Construction Projects By Using Fuzzy Logic Incorporated With Relative Importance Index (rii) Method." Master's thesis, METU, 2010. http://etd.lib.metu.edu.tr/upload/12612169/index.pdf.
Повний текст джерелаHager, Johann. "The application of probabilistic logic to identify, quantify and mitigate the uncertainty inherent to a large surface mining budget." Diss., University of Pretoria, 2014. http://hdl.handle.net/2263/79708.
Повний текст джерелаDissertation (MSc)--University of Pretoria, 2014.
Mining Engineering
MEng
Unrestricted
Mahendiran, Aravindan. "Automated Vocabulary Building for Characterizing and Forecasting Elections using Social Media Analytics." Thesis, Virginia Tech, 2014. http://hdl.handle.net/10919/25430.
Повний текст джерелаMaster of Science
Wong, Vicky W. "Characterizing the parallel performance and soft error resilience of probabilistic inference algorithms /." May be available electronically:, 2007. http://proquest.umi.com/login?COPT=REJTPTU1MTUmSU5UPTAmVkVSPTI=&clientId=12498.
Повний текст джерелаGiusti, Giulia. "Sui Tipi Sessione, le Scelte Probabilistiche e il Tempo Polinomiale." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2021. http://amslaurea.unibo.it/24922/.
Повний текст джерелаVaccari, Giulio. "Dal Paradigma Funzionale a Quello Logico in Presenza di Scelte Probabilistiche: un Approccio Basato sulla Geometria dell'Interazione." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2018. http://amslaurea.unibo.it/16726/.
Повний текст джерелаMyers, Andrew T. "Testing and probabilistic simulation of ductile fracture initiation in structural steel components and weldments /." May be available electronically:, 2009. http://proquest.umi.com/login?COPT=REJTPTU1MTUmSU5UPTAmVkVSPTI=&clientId=12498.
Повний текст джерелаMorais, Eduardo Menezes de. "Answer set programming probabilístico." Universidade de São Paulo, 2012. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-20022013-001051/.
Повний текст джерелаThis dissertation introduces a technique called Probabilistic Answer Set Programming (PASP), that allows modeling complex theories and check its consistence with respect to a set of statistical data. We propose a method of resolution based in the reduction to the probabilistic satisfiability problem (PSAT) and a Turing reduction method to ASP.
Torres, Parra Jimena Cecilia. "A Perception Based Question-Answering Architecture Derived from Computing with Words." Available to subscribers only, 2009. http://proquest.umi.com/pqdweb?did=1967797581&sid=1&Fmt=2&clientId=1509&RQT=309&VName=PQD.
Повний текст джерелаTothong, Polsak. "Probabilistic seismic demand analysis using advanced ground motion intensity measures, attenuation relationships, and near-fault effects /." May be available electronically:, 2007. http://proquest.umi.com/login?COPT=REJTPTU1MTUmSU5UPTAmVkVSPTI=&clientId=12498.
Повний текст джерелаKobayashi, H. "An application of probabilistic life-cycle cost analysis to the construction and maintenance of reinforced concrete bridges /." May be available electronically:, 2008. http://proquest.umi.com/login?COPT=REJTPTU1MTUmSU5UPTAmVkVSPTI=&clientId=12498.
Повний текст джерелаBaier, Christel, Marcus Daum, Benjamin Engel, Hermann Härtig, Joachim Klein, Sascha Klüppelholz, Steffen Märcker, Hendrik Tews, and Marcus Völp. "Chiefly Symmetric: Results on the Scalability of Probabilistic Model Checking for Operating-System Code." Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2013. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-121319.
Повний текст джерела