Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(Probabilistic logic). Showing records 1 – 30 of 49 total matches.

[1] [2]

Search Limiters

Last 2 Years | English Only

▼ Search Limiters


Université de Neuchâtel

1. Cotofrei, Paul. Methodology for mining meta rules from sequential data.

Degree: 2005, Université de Neuchâtel

 The purpose of this thesis is to respond to an actual necessity - the need to discover knowledge from huge data collection comprising multiple sequences… (more)

Subjects/Keywords: probabilistic temporal logic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Cotofrei, P. (2005). Methodology for mining meta rules from sequential data. (Thesis). Université de Neuchâtel. Retrieved from http://doc.rero.ch/record/4850

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Cotofrei, Paul. “Methodology for mining meta rules from sequential data.” 2005. Thesis, Université de Neuchâtel. Accessed June 26, 2019. http://doc.rero.ch/record/4850.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Cotofrei, Paul. “Methodology for mining meta rules from sequential data.” 2005. Web. 26 Jun 2019.

Vancouver:

Cotofrei P. Methodology for mining meta rules from sequential data. [Internet] [Thesis]. Université de Neuchâtel; 2005. [cited 2019 Jun 26]. Available from: http://doc.rero.ch/record/4850.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Cotofrei P. Methodology for mining meta rules from sequential data. [Thesis]. Université de Neuchâtel; 2005. Available from: http://doc.rero.ch/record/4850

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Illinois – Urbana-Champaign

2. Shirazi, Afsaneh H. Reasoning with models of probabilistic knowledge over probabilistic knowledge.

Degree: PhD, 0112, 2011, University of Illinois – Urbana-Champaign

 In multi-agent systems, the knowledge of agents about other agents??? knowledge often plays a pivotal role in their decisions. In many applications, this knowledge involves… (more)

Subjects/Keywords: Probabilistic Knowledge; Bayesian Networks; Modal Logic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Shirazi, A. H. (2011). Reasoning with models of probabilistic knowledge over probabilistic knowledge. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/24239

Chicago Manual of Style (16th Edition):

Shirazi, Afsaneh H. “Reasoning with models of probabilistic knowledge over probabilistic knowledge.” 2011. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed June 26, 2019. http://hdl.handle.net/2142/24239.

MLA Handbook (7th Edition):

Shirazi, Afsaneh H. “Reasoning with models of probabilistic knowledge over probabilistic knowledge.” 2011. Web. 26 Jun 2019.

Vancouver:

Shirazi AH. Reasoning with models of probabilistic knowledge over probabilistic knowledge. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2011. [cited 2019 Jun 26]. Available from: http://hdl.handle.net/2142/24239.

Council of Science Editors:

Shirazi AH. Reasoning with models of probabilistic knowledge over probabilistic knowledge. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2011. Available from: http://hdl.handle.net/2142/24239


University of Illinois – Urbana-Champaign

3. Chang, Shiyu. Structured concept recycling by probabilistic logic ontology tree.

Degree: MS, 1200, 2014, University of Illinois – Urbana-Champaign

 Recent advances in multimedia research have generated a large collection of concept models, e.g., LSCOM and Mediamill 101, which have become accessible to other researchers.… (more)

Subjects/Keywords: Multimedia LEarning structured model by probabilistic loGic Ontology (LEGO); Concept recycling; Model warehouse; Probabilistic logic ontology tree; Logical operations

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Chang, S. (2014). Structured concept recycling by probabilistic logic ontology tree. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/46848

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Chang, Shiyu. “Structured concept recycling by probabilistic logic ontology tree.” 2014. Thesis, University of Illinois – Urbana-Champaign. Accessed June 26, 2019. http://hdl.handle.net/2142/46848.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Chang, Shiyu. “Structured concept recycling by probabilistic logic ontology tree.” 2014. Web. 26 Jun 2019.

Vancouver:

Chang S. Structured concept recycling by probabilistic logic ontology tree. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2014. [cited 2019 Jun 26]. Available from: http://hdl.handle.net/2142/46848.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chang S. Structured concept recycling by probabilistic logic ontology tree. [Thesis]. University of Illinois – Urbana-Champaign; 2014. Available from: http://hdl.handle.net/2142/46848

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Universiteit Utrecht

4. Beek, L.L.A.M. van. Object Classification through Probabilistic Common Sense Knowledge Reasoning.

Degree: 2013, Universiteit Utrecht

 This thesis presents a manner for object classification by the use of semantic knowledge and probabilistic reasoning with such knowledge. An ontology of object classes… (more)

Subjects/Keywords: object classification; ontology; markov logic; probabilistic reasoning; hierarchical object classification; semantic knowledge; description logic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Beek, L. L. A. M. v. (2013). Object Classification through Probabilistic Common Sense Knowledge Reasoning. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/268192

Chicago Manual of Style (16th Edition):

Beek, L L A M van. “Object Classification through Probabilistic Common Sense Knowledge Reasoning.” 2013. Masters Thesis, Universiteit Utrecht. Accessed June 26, 2019. http://dspace.library.uu.nl:8080/handle/1874/268192.

MLA Handbook (7th Edition):

Beek, L L A M van. “Object Classification through Probabilistic Common Sense Knowledge Reasoning.” 2013. Web. 26 Jun 2019.

Vancouver:

Beek LLAMv. Object Classification through Probabilistic Common Sense Knowledge Reasoning. [Internet] [Masters thesis]. Universiteit Utrecht; 2013. [cited 2019 Jun 26]. Available from: http://dspace.library.uu.nl:8080/handle/1874/268192.

Council of Science Editors:

Beek LLAMv. Object Classification through Probabilistic Common Sense Knowledge Reasoning. [Masters Thesis]. Universiteit Utrecht; 2013. Available from: http://dspace.library.uu.nl:8080/handle/1874/268192


University of Manchester

5. Al Shekaili, Dhahi Khalifa Dhahi. Integrating Linked Data Search Results Using Statistical Relational Learning Approaches.

Degree: 2017, University of Manchester

 Linked Data (LD) follows the web in providing low barriers to publication, and in deploying web-scale keyword search as a central way of identifying relevant… (more)

Subjects/Keywords: Linked Data Search; Markov Logic Networks; Probabilistic Soft Logic; Statistical Relational Learning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Al Shekaili, D. K. D. (2017). Integrating Linked Data Search Results Using Statistical Relational Learning Approaches. (Doctoral Dissertation). University of Manchester. Retrieved from http://www.manchester.ac.uk/escholar/uk-ac-man-scw:307430

Chicago Manual of Style (16th Edition):

Al Shekaili, Dhahi Khalifa Dhahi. “Integrating Linked Data Search Results Using Statistical Relational Learning Approaches.” 2017. Doctoral Dissertation, University of Manchester. Accessed June 26, 2019. http://www.manchester.ac.uk/escholar/uk-ac-man-scw:307430.

MLA Handbook (7th Edition):

Al Shekaili, Dhahi Khalifa Dhahi. “Integrating Linked Data Search Results Using Statistical Relational Learning Approaches.” 2017. Web. 26 Jun 2019.

Vancouver:

Al Shekaili DKD. Integrating Linked Data Search Results Using Statistical Relational Learning Approaches. [Internet] [Doctoral dissertation]. University of Manchester; 2017. [cited 2019 Jun 26]. Available from: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:307430.

Council of Science Editors:

Al Shekaili DKD. Integrating Linked Data Search Results Using Statistical Relational Learning Approaches. [Doctoral Dissertation]. University of Manchester; 2017. Available from: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:307430

6. Beltagy, Islam Kamel Ahmed. Natural language semantics using probabilistic logic.

Degree: Computer Sciences, 2016, University of Texas – Austin

 With better natural language semantic representations, computers can do more applications more efficiently as a result of better understanding of natural text. However, no single… (more)

Subjects/Keywords: NLP; Machine learning; Probabilistic logic; MLNs; PSL; Markov Logic Network; QA; RTE; STS

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Beltagy, I. K. A. (2016). Natural language semantics using probabilistic logic. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/46617

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Beltagy, Islam Kamel Ahmed. “Natural language semantics using probabilistic logic.” 2016. Thesis, University of Texas – Austin. Accessed June 26, 2019. http://hdl.handle.net/2152/46617.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Beltagy, Islam Kamel Ahmed. “Natural language semantics using probabilistic logic.” 2016. Web. 26 Jun 2019.

Vancouver:

Beltagy IKA. Natural language semantics using probabilistic logic. [Internet] [Thesis]. University of Texas – Austin; 2016. [cited 2019 Jun 26]. Available from: http://hdl.handle.net/2152/46617.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Beltagy IKA. Natural language semantics using probabilistic logic. [Thesis]. University of Texas – Austin; 2016. Available from: http://hdl.handle.net/2152/46617

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Minnesota

7. Qian, Weikang. Digital yet deliberately random: synthesizing logical computation on stochastic bit streams.

Degree: PhD, Electrical engineering, 2011, University of Minnesota

 Most digital circuits process information that is encoded as zeros and ones deterministically. For example, the arithmetic unit of a modern computer performs calculations on… (more)

Subjects/Keywords: Cube; Logic Synthesis; Minterm; Probabilistic Logic; Stochastic Bit Streams; Stochastic Computation; Electrical Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Qian, W. (2011). Digital yet deliberately random: synthesizing logical computation on stochastic bit streams. (Doctoral Dissertation). University of Minnesota. Retrieved from http://purl.umn.edu/113525

Chicago Manual of Style (16th Edition):

Qian, Weikang. “Digital yet deliberately random: synthesizing logical computation on stochastic bit streams.” 2011. Doctoral Dissertation, University of Minnesota. Accessed June 26, 2019. http://purl.umn.edu/113525.

MLA Handbook (7th Edition):

Qian, Weikang. “Digital yet deliberately random: synthesizing logical computation on stochastic bit streams.” 2011. Web. 26 Jun 2019.

Vancouver:

Qian W. Digital yet deliberately random: synthesizing logical computation on stochastic bit streams. [Internet] [Doctoral dissertation]. University of Minnesota; 2011. [cited 2019 Jun 26]. Available from: http://purl.umn.edu/113525.

Council of Science Editors:

Qian W. Digital yet deliberately random: synthesizing logical computation on stochastic bit streams. [Doctoral Dissertation]. University of Minnesota; 2011. Available from: http://purl.umn.edu/113525


University of Manchester

8. Al Shekaili, Dhahi. Integrating Linked Data search results using statistical relational learning approaches.

Degree: PhD, 2017, University of Manchester

 Linked Data (LD) follows the web in providing low barriers to publication, and in deploying web-scale keyword search as a central way of identifying relevant… (more)

Subjects/Keywords: 005.7; Statistical Relational Learning; Probabilistic Soft Logic; Linked Data Search; Markov Logic Networks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Al Shekaili, D. (2017). Integrating Linked Data search results using statistical relational learning approaches. (Doctoral Dissertation). University of Manchester. Retrieved from 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 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.728176

Chicago Manual of Style (16th Edition):

Al Shekaili, Dhahi. “Integrating Linked Data search results using statistical relational learning approaches.” 2017. Doctoral Dissertation, University of Manchester. Accessed June 26, 2019. 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 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.728176.

MLA Handbook (7th Edition):

Al Shekaili, Dhahi. “Integrating Linked Data search results using statistical relational learning approaches.” 2017. Web. 26 Jun 2019.

Vancouver:

Al Shekaili D. Integrating Linked Data search results using statistical relational learning approaches. [Internet] [Doctoral dissertation]. University of Manchester; 2017. [cited 2019 Jun 26]. Available from: 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 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.728176.

Council of Science Editors:

Al Shekaili D. Integrating Linked Data search results using statistical relational learning approaches. [Doctoral Dissertation]. University of Manchester; 2017. Available from: 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 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.728176


Virginia Tech

9. Mahendiran, Aravindan. Automated Vocabulary Building for Characterizing and Forecasting Elections using Social Media Analytics.

Degree: MS, Computer Science, 2014, Virginia Tech

 Twitter has become a popular data source in the recent decade and garnered a significant amount of attention as a surrogate data source for many… (more)

Subjects/Keywords: Election Forecasting; Twitter; Query Expansion; Social Group Modeling; Probabilistic Soft Logic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Mahendiran, A. (2014). Automated Vocabulary Building for Characterizing and Forecasting Elections using Social Media Analytics. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/25430

Chicago Manual of Style (16th Edition):

Mahendiran, Aravindan. “Automated Vocabulary Building for Characterizing and Forecasting Elections using Social Media Analytics.” 2014. Masters Thesis, Virginia Tech. Accessed June 26, 2019. http://hdl.handle.net/10919/25430.

MLA Handbook (7th Edition):

Mahendiran, Aravindan. “Automated Vocabulary Building for Characterizing and Forecasting Elections using Social Media Analytics.” 2014. Web. 26 Jun 2019.

Vancouver:

Mahendiran A. Automated Vocabulary Building for Characterizing and Forecasting Elections using Social Media Analytics. [Internet] [Masters thesis]. Virginia Tech; 2014. [cited 2019 Jun 26]. Available from: http://hdl.handle.net/10919/25430.

Council of Science Editors:

Mahendiran A. Automated Vocabulary Building for Characterizing and Forecasting Elections using Social Media Analytics. [Masters Thesis]. Virginia Tech; 2014. Available from: http://hdl.handle.net/10919/25430


University of Illinois – Urbana-Champaign

10. Kini, Dileep Raghunath. Verification of linear-time properties for finite probabilistic systems.

Degree: PhD, Computer Science, 2017, University of Illinois – Urbana-Champaign

 With computers becoming ubiquitous there is an ever growing necessity to ensure that they are programmed to behave correctly. Formal verification is a discipline within… (more)

Subjects/Keywords: Probabilistic model checking; Markov decision processes; Linear temporal logic; Automata theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kini, D. R. (2017). Verification of linear-time properties for finite probabilistic systems. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/99357

Chicago Manual of Style (16th Edition):

Kini, Dileep Raghunath. “Verification of linear-time properties for finite probabilistic systems.” 2017. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed June 26, 2019. http://hdl.handle.net/2142/99357.

MLA Handbook (7th Edition):

Kini, Dileep Raghunath. “Verification of linear-time properties for finite probabilistic systems.” 2017. Web. 26 Jun 2019.

Vancouver:

Kini DR. Verification of linear-time properties for finite probabilistic systems. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2017. [cited 2019 Jun 26]. Available from: http://hdl.handle.net/2142/99357.

Council of Science Editors:

Kini DR. Verification of linear-time properties for finite probabilistic systems. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/99357


University of Waterloo

11. Zawawy, Hamzeh. Requirement-based Root Cause Analysis Using Log Data.

Degree: 2012, University of Waterloo

 Root Cause Analysis for software systems is a challenging diagnostic task due to complexity emanating from the interactions between system components. Furthermore, the sheer size… (more)

Subjects/Keywords: Root cause analysis; Log data; Probabilistic reasoning; Markov Logic Network

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Zawawy, H. (2012). Requirement-based Root Cause Analysis Using Log Data. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/6851

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Zawawy, Hamzeh. “Requirement-based Root Cause Analysis Using Log Data.” 2012. Thesis, University of Waterloo. Accessed June 26, 2019. http://hdl.handle.net/10012/6851.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Zawawy, Hamzeh. “Requirement-based Root Cause Analysis Using Log Data.” 2012. Web. 26 Jun 2019.

Vancouver:

Zawawy H. Requirement-based Root Cause Analysis Using Log Data. [Internet] [Thesis]. University of Waterloo; 2012. [cited 2019 Jun 26]. Available from: http://hdl.handle.net/10012/6851.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zawawy H. Requirement-based Root Cause Analysis Using Log Data. [Thesis]. University of Waterloo; 2012. Available from: http://hdl.handle.net/10012/6851

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Illinois – Urbana-Champaign

12. Choi, Jaesik. Lifted Inference for Relational Hybrid Models.

Degree: PhD, 0112, 2012, University of Illinois – Urbana-Champaign

Probabilistic Graphical Models (PGMs) promise to play a prominent role in many complex real-world systems. Probabilistic Relational Graphical Models (PRGMs) scale the representation and learning… (more)

Subjects/Keywords: Probabilistic Graphical Models; Relational Hybrid Models; Lifted Inference; First-Order Probabilistic Models; Probabilistic Logic; Kalman filter; Relational Kalman filter; Variational Learning, Markov Logic Networks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Choi, J. (2012). Lifted Inference for Relational Hybrid Models. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/32004

Chicago Manual of Style (16th Edition):

Choi, Jaesik. “Lifted Inference for Relational Hybrid Models.” 2012. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed June 26, 2019. http://hdl.handle.net/2142/32004.

MLA Handbook (7th Edition):

Choi, Jaesik. “Lifted Inference for Relational Hybrid Models.” 2012. Web. 26 Jun 2019.

Vancouver:

Choi J. Lifted Inference for Relational Hybrid Models. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2012. [cited 2019 Jun 26]. Available from: http://hdl.handle.net/2142/32004.

Council of Science Editors:

Choi J. Lifted Inference for Relational Hybrid Models. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2012. Available from: http://hdl.handle.net/2142/32004

13. Arruda, Alexandre Matos. Abdução clássica e abdução probabilística: a busca pela explicação de dados reais.

Degree: PhD, Ciência da Computação, 2014, University of São Paulo

A busca por explicações de fatos ou fenômenos é algo que sempre permeou o raciocínio humano. Desde a antiguidade, o ser humano costuma observar fatos… (more)

Subjects/Keywords: Abdução; Abdução para PSAT; Abdução probabilística; Abduction; Abduction for PSAT; Lógica probabilística; Probabilistic abduction; Probabilistic logic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Arruda, A. M. (2014). Abdução clássica e abdução probabilística: a busca pela explicação de dados reais. (Doctoral Dissertation). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/45/45134/tde-20102015-170210/ ;

Chicago Manual of Style (16th Edition):

Arruda, Alexandre Matos. “Abdução clássica e abdução probabilística: a busca pela explicação de dados reais.” 2014. Doctoral Dissertation, University of São Paulo. Accessed June 26, 2019. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-20102015-170210/ ;.

MLA Handbook (7th Edition):

Arruda, Alexandre Matos. “Abdução clássica e abdução probabilística: a busca pela explicação de dados reais.” 2014. Web. 26 Jun 2019.

Vancouver:

Arruda AM. Abdução clássica e abdução probabilística: a busca pela explicação de dados reais. [Internet] [Doctoral dissertation]. University of São Paulo; 2014. [cited 2019 Jun 26]. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-20102015-170210/ ;.

Council of Science Editors:

Arruda AM. Abdução clássica e abdução probabilística: a busca pela explicação de dados reais. [Doctoral Dissertation]. University of São Paulo; 2014. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-20102015-170210/ ;


Purdue University

14. Ganguly, Samiran. Spintronic device modeling and evaluation using modular approach to spintronics.

Degree: PhD, Electrical and Computer Engineering, 2016, Purdue University

  Spintronics technology finds itself in an exciting stage today. Riding on the backs of rapid growth and impressive advances in materials and phenomena, it… (more)

Subjects/Keywords: Applied sciences; Probabilistic logic; Spin logic; Spin transfer torque mram; Spin-circuit modeling; Spintronic oscillators; Spintronics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ganguly, S. (2016). Spintronic device modeling and evaluation using modular approach to spintronics. (Doctoral Dissertation). Purdue University. Retrieved from http://docs.lib.purdue.edu/open_access_dissertations/924

Chicago Manual of Style (16th Edition):

Ganguly, Samiran. “Spintronic device modeling and evaluation using modular approach to spintronics.” 2016. Doctoral Dissertation, Purdue University. Accessed June 26, 2019. http://docs.lib.purdue.edu/open_access_dissertations/924.

MLA Handbook (7th Edition):

Ganguly, Samiran. “Spintronic device modeling and evaluation using modular approach to spintronics.” 2016. Web. 26 Jun 2019.

Vancouver:

Ganguly S. Spintronic device modeling and evaluation using modular approach to spintronics. [Internet] [Doctoral dissertation]. Purdue University; 2016. [cited 2019 Jun 26]. Available from: http://docs.lib.purdue.edu/open_access_dissertations/924.

Council of Science Editors:

Ganguly S. Spintronic device modeling and evaluation using modular approach to spintronics. [Doctoral Dissertation]. Purdue University; 2016. Available from: http://docs.lib.purdue.edu/open_access_dissertations/924


Georgia Tech

15. Zhang, Xin. Combining logical and probabilistic reasoning in program analysis.

Degree: PhD, Computer Science, 2017, Georgia Tech

 Software is becoming increasingly pervasive and complex. These trends expose masses of users to unintended software failures and deliberate cyber-attacks. A widely adopted solution to… (more)

Subjects/Keywords: Program analysis; Logic; Probability; Combined logical and probabilistic reasoning; Markov logic networks; Datalog; MaxSAT; Verification; Bug finding; Programming languages; Software engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Zhang, X. (2017). Combining logical and probabilistic reasoning in program analysis. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/59200

Chicago Manual of Style (16th Edition):

Zhang, Xin. “Combining logical and probabilistic reasoning in program analysis.” 2017. Doctoral Dissertation, Georgia Tech. Accessed June 26, 2019. http://hdl.handle.net/1853/59200.

MLA Handbook (7th Edition):

Zhang, Xin. “Combining logical and probabilistic reasoning in program analysis.” 2017. Web. 26 Jun 2019.

Vancouver:

Zhang X. Combining logical and probabilistic reasoning in program analysis. [Internet] [Doctoral dissertation]. Georgia Tech; 2017. [cited 2019 Jun 26]. Available from: http://hdl.handle.net/1853/59200.

Council of Science Editors:

Zhang X. Combining logical and probabilistic reasoning in program analysis. [Doctoral Dissertation]. Georgia Tech; 2017. Available from: http://hdl.handle.net/1853/59200

16. Morais, Eduardo Menezes de. Answer set programming probabilístico.

Degree: Mestrado, Ciência da Computação, 2012, University of São Paulo

Este trabalho introduz uma técnica chamada Answer Set Programming Probabilístico (PASP), que permite a modelagem de teorias complexas e a verificação de sua consistência em… (more)

Subjects/Keywords: answer set programming (ASP); answer set programming (ASP); logic programming; lógica probabilística; many-to-one reduction; probabilistic logic; probabilistic satisfiability (PSAT); programação lógica; redução muitos-para-um; satisfazibilidade probabilística (PSAT)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Morais, E. M. d. (2012). Answer set programming probabilístico. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/45/45134/tde-20022013-001051/ ;

Chicago Manual of Style (16th Edition):

Morais, Eduardo Menezes de. “Answer set programming probabilístico.” 2012. Masters Thesis, University of São Paulo. Accessed June 26, 2019. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-20022013-001051/ ;.

MLA Handbook (7th Edition):

Morais, Eduardo Menezes de. “Answer set programming probabilístico.” 2012. Web. 26 Jun 2019.

Vancouver:

Morais EMd. Answer set programming probabilístico. [Internet] [Masters thesis]. University of São Paulo; 2012. [cited 2019 Jun 26]. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-20022013-001051/ ;.

Council of Science Editors:

Morais EMd. Answer set programming probabilístico. [Masters Thesis]. University of São Paulo; 2012. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-20022013-001051/ ;


KTH

17. Gao, Xiaoxu. Exploring declarative rule-based probabilistic frameworks for link prediction in Knowledge Graphs.

Degree: Information and Communication Technology (ICT), 2017, KTH

En kunskapsgraf lagrar information från webben i form av relationer mellan olika entiteter. En kunskapsgrafs kvalité bestäms av hur komplett den är och dess… (more)

Subjects/Keywords: Knowledge Graph; Link Prediction; Probabilistic Soft Logic; Hinge-loss Markov Random Fields; Kunskapsgraf; Länkförutsägelser; Probabilistic Soft Logic; Hinge-loss Markov Random Fields; Computer and Information Sciences; Data- och informationsvetenskap

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Gao, X. (2017). Exploring declarative rule-based probabilistic frameworks for link prediction in Knowledge Graphs. (Thesis). KTH. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-210650

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Gao, Xiaoxu. “Exploring declarative rule-based probabilistic frameworks for link prediction in Knowledge Graphs.” 2017. Thesis, KTH. Accessed June 26, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-210650.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Gao, Xiaoxu. “Exploring declarative rule-based probabilistic frameworks for link prediction in Knowledge Graphs.” 2017. Web. 26 Jun 2019.

Vancouver:

Gao X. Exploring declarative rule-based probabilistic frameworks for link prediction in Knowledge Graphs. [Internet] [Thesis]. KTH; 2017. [cited 2019 Jun 26]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-210650.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Gao X. Exploring declarative rule-based probabilistic frameworks for link prediction in Knowledge Graphs. [Thesis]. KTH; 2017. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-210650

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

18. Ochoa Luna, José Eduardo. Lógicas probabilísticas com relações de independência: representação de conhecimento e aprendizado de máquina.

Degree: PhD, Engenharia de Controle e Automação Mecânica, 2011, University of São Paulo

A combinação de lógica e probabilidade (lógicas probabilísticas) tem sido um tópico bastante estudado nas últimas décadas. A maioria de propostas para estes formalismos pressupõem… (more)

Subjects/Keywords: Aprendizado de lógica de descrição; Description logic learning; Incerteza; Inductive logic programming; Lógica probabilística; Probabilistic logic; programação em lógica indutiva; Redes Bayesianas relacionais; Relational Bayesian networks; Uncertainty

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ochoa Luna, J. E. (2011). Lógicas probabilísticas com relações de independência: representação de conhecimento e aprendizado de máquina. (Doctoral Dissertation). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/3/3152/tde-17082011-090935/ ;

Chicago Manual of Style (16th Edition):

Ochoa Luna, José Eduardo. “Lógicas probabilísticas com relações de independência: representação de conhecimento e aprendizado de máquina.” 2011. Doctoral Dissertation, University of São Paulo. Accessed June 26, 2019. http://www.teses.usp.br/teses/disponiveis/3/3152/tde-17082011-090935/ ;.

MLA Handbook (7th Edition):

Ochoa Luna, José Eduardo. “Lógicas probabilísticas com relações de independência: representação de conhecimento e aprendizado de máquina.” 2011. Web. 26 Jun 2019.

Vancouver:

Ochoa Luna JE. Lógicas probabilísticas com relações de independência: representação de conhecimento e aprendizado de máquina. [Internet] [Doctoral dissertation]. University of São Paulo; 2011. [cited 2019 Jun 26]. Available from: http://www.teses.usp.br/teses/disponiveis/3/3152/tde-17082011-090935/ ;.

Council of Science Editors:

Ochoa Luna JE. Lógicas probabilísticas com relações de independência: representação de conhecimento e aprendizado de máquina. [Doctoral Dissertation]. University of São Paulo; 2011. Available from: http://www.teses.usp.br/teses/disponiveis/3/3152/tde-17082011-090935/ ;

19. Skarlatidis, Anastasios. Event recognition under uncertainty and incomplete data.

Degree: 2014, University of Piraeus (UNIPI); Πανεπιστήμιο Πειραιώς

Symbolic event recognition systems have been successfully applied to a variety of application domains, extracting useful information in the form of events, allowing experts or… (more)

Subjects/Keywords: Αναγνώριση συμβάντων; Επεξεργασία πολύπλοκων συμβάντων; Λογικά Δύκτια Μάρκοβ; Πιθανοτικός λογικός προγραμματισμός; Λογισμός συμβάντων; Χρονική λογική; Event recognition; Complex event processing; Markov logic networks; Probabilistic logic programming; Event calculus; Temporal logic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Skarlatidis, A. (2014). Event recognition under uncertainty and incomplete data. (Thesis). University of Piraeus (UNIPI); Πανεπιστήμιο Πειραιώς. Retrieved from http://hdl.handle.net/10442/hedi/35692

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Skarlatidis, Anastasios. “Event recognition under uncertainty and incomplete data.” 2014. Thesis, University of Piraeus (UNIPI); Πανεπιστήμιο Πειραιώς. Accessed June 26, 2019. http://hdl.handle.net/10442/hedi/35692.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Skarlatidis, Anastasios. “Event recognition under uncertainty and incomplete data.” 2014. Web. 26 Jun 2019.

Vancouver:

Skarlatidis A. Event recognition under uncertainty and incomplete data. [Internet] [Thesis]. University of Piraeus (UNIPI); Πανεπιστήμιο Πειραιώς; 2014. [cited 2019 Jun 26]. Available from: http://hdl.handle.net/10442/hedi/35692.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Skarlatidis A. Event recognition under uncertainty and incomplete data. [Thesis]. University of Piraeus (UNIPI); Πανεπιστήμιο Πειραιώς; 2014. Available from: http://hdl.handle.net/10442/hedi/35692

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Universidade Nova

20. Moura, João Manuel Gomes. Modular Logic Programming: Full Compositionality and Conflict Handling for Practical Reasoning.

Degree: 2016, Universidade Nova

 With the recent development of a new ubiquitous nature of data and the profusity of available knowledge, there is nowadays the need to reason from… (more)

Subjects/Keywords: Logic Programming; Answer Set Programming; Paracoherence; Paraconsistency; Modular Logic Programming; Probabilistic Logic Programming; Domínio/Área Científica::Engenharia e Tecnologia::Engenharia Eletrotécnica, Eletrónica e Informática

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Moura, J. M. G. (2016). Modular Logic Programming: Full Compositionality and Conflict Handling for Practical Reasoning. (Thesis). Universidade Nova. Retrieved from https://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/30470

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Moura, João Manuel Gomes. “Modular Logic Programming: Full Compositionality and Conflict Handling for Practical Reasoning.” 2016. Thesis, Universidade Nova. Accessed June 26, 2019. https://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/30470.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Moura, João Manuel Gomes. “Modular Logic Programming: Full Compositionality and Conflict Handling for Practical Reasoning.” 2016. Web. 26 Jun 2019.

Vancouver:

Moura JMG. Modular Logic Programming: Full Compositionality and Conflict Handling for Practical Reasoning. [Internet] [Thesis]. Universidade Nova; 2016. [cited 2019 Jun 26]. Available from: https://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/30470.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Moura JMG. Modular Logic Programming: Full Compositionality and Conflict Handling for Practical Reasoning. [Thesis]. Universidade Nova; 2016. Available from: https://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/30470

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Universidade de Brasília

21. Rommel Novaes Carvalho. Raciocínio plausível na web semântica através de redes bayesianas multi-entidades - MEBN / Rommel Novaes Carvalho.

Degree: 2008, Universidade de Brasília

 O objetivo geral deste trabalho e pesquisar formalismos para extens~ao de redes bayesianas (BN) e raciocnio plausvel na Web Sem^antica. Dentre os formalismos para raciocnio… (more)

Subjects/Keywords: raciocínio probabilístico, Web Semântica, MEBN, rede bayesiana, UnBBayes, ontologia probabilística, lógica de primeira ordem; OUTROS; probabilistic reasoning, Semantic Web, MEBN, Bayesian network, UnBBayes, probabilistic ontology, rst order logic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Carvalho, R. N. (2008). Raciocínio plausível na web semântica através de redes bayesianas multi-entidades - MEBN / Rommel Novaes Carvalho. (Thesis). Universidade de Brasília. Retrieved from http://bdtd.bce.unb.br/tedesimplificado/tde_busca/arquivo.php?codArquivo=4660

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Carvalho, Rommel Novaes. “Raciocínio plausível na web semântica através de redes bayesianas multi-entidades - MEBN / Rommel Novaes Carvalho.” 2008. Thesis, Universidade de Brasília. Accessed June 26, 2019. http://bdtd.bce.unb.br/tedesimplificado/tde_busca/arquivo.php?codArquivo=4660.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Carvalho, Rommel Novaes. “Raciocínio plausível na web semântica através de redes bayesianas multi-entidades - MEBN / Rommel Novaes Carvalho.” 2008. Web. 26 Jun 2019.

Vancouver:

Carvalho RN. Raciocínio plausível na web semântica através de redes bayesianas multi-entidades - MEBN / Rommel Novaes Carvalho. [Internet] [Thesis]. Universidade de Brasília; 2008. [cited 2019 Jun 26]. Available from: http://bdtd.bce.unb.br/tedesimplificado/tde_busca/arquivo.php?codArquivo=4660.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Carvalho RN. Raciocínio plausível na web semântica através de redes bayesianas multi-entidades - MEBN / Rommel Novaes Carvalho. [Thesis]. Universidade de Brasília; 2008. Available from: http://bdtd.bce.unb.br/tedesimplificado/tde_busca/arquivo.php?codArquivo=4660

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Macquarie University

22. Rabehaja, Mananjanahary Tahiry. Algebraic verification of probabilistic and concurrent systems.

Degree: 2014, Macquarie University

Theoretical thesis.

Bibliography: pages 167-175.

1. Introduction  – 2. Continuity in probabilistic Kleene algebra  – 3. Event structures and concurrent Kleene algebra  – 4. Probabilistic(more)

Subjects/Keywords: Algebraic logic; Kleene algebra; Probabilities; Program semantics; Program verification; Probabilistic systems; Concurrency; Kleene Algebra; automata; simulation; event structures; probabilistic rely/guarantee calculus

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Rabehaja, M. T. (2014). Algebraic verification of probabilistic and concurrent systems. (Doctoral Dissertation). Macquarie University. Retrieved from http://hdl.handle.net/1959.14/1057067

Chicago Manual of Style (16th Edition):

Rabehaja, Mananjanahary Tahiry. “Algebraic verification of probabilistic and concurrent systems.” 2014. Doctoral Dissertation, Macquarie University. Accessed June 26, 2019. http://hdl.handle.net/1959.14/1057067.

MLA Handbook (7th Edition):

Rabehaja, Mananjanahary Tahiry. “Algebraic verification of probabilistic and concurrent systems.” 2014. Web. 26 Jun 2019.

Vancouver:

Rabehaja MT. Algebraic verification of probabilistic and concurrent systems. [Internet] [Doctoral dissertation]. Macquarie University; 2014. [cited 2019 Jun 26]. Available from: http://hdl.handle.net/1959.14/1057067.

Council of Science Editors:

Rabehaja MT. Algebraic verification of probabilistic and concurrent systems. [Doctoral Dissertation]. Macquarie University; 2014. Available from: http://hdl.handle.net/1959.14/1057067

23. Magliacane, S. Logics for causal inference under uncertainty .

Degree: 2017, Vrije Universiteit Amsterdam

Subjects/Keywords: causality; causal discovery; probabilistic logics; structure learning; probabilistic soft logic

Page 1

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Magliacane, S. (2017). Logics for causal inference under uncertainty . (Doctoral Dissertation). Vrije Universiteit Amsterdam. Retrieved from http://hdl.handle.net/1871/55267

Chicago Manual of Style (16th Edition):

Magliacane, S. “Logics for causal inference under uncertainty .” 2017. Doctoral Dissertation, Vrije Universiteit Amsterdam. Accessed June 26, 2019. http://hdl.handle.net/1871/55267.

MLA Handbook (7th Edition):

Magliacane, S. “Logics for causal inference under uncertainty .” 2017. Web. 26 Jun 2019.

Vancouver:

Magliacane S. Logics for causal inference under uncertainty . [Internet] [Doctoral dissertation]. Vrije Universiteit Amsterdam; 2017. [cited 2019 Jun 26]. Available from: http://hdl.handle.net/1871/55267.

Council of Science Editors:

Magliacane S. Logics for causal inference under uncertainty . [Doctoral Dissertation]. Vrije Universiteit Amsterdam; 2017. Available from: http://hdl.handle.net/1871/55267

24. Magliacane, S. Logics for causal inference under uncertainty.

Degree: Faculty of Sciences, 2017, NARCIS

Subjects/Keywords: causality; causal discovery; probabilistic logics; structure learning; probabilistic soft logic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Magliacane, S. (2017). Logics for causal inference under uncertainty. (Doctoral Dissertation). NARCIS. Retrieved from https://research.vu.nl/en/publications/c38c1661-6d62-4e57-99d4-9a5241a73f30 ; urn:nbn:nl:ui:31-1871/55267 ; c38c1661-6d62-4e57-99d4-9a5241a73f30 ; 1871/55267 ; urn:nbn:nl:ui:31-1871/55267 ; https://research.vu.nl/en/publications/c38c1661-6d62-4e57-99d4-9a5241a73f30

Chicago Manual of Style (16th Edition):

Magliacane, S. “Logics for causal inference under uncertainty.” 2017. Doctoral Dissertation, NARCIS. Accessed June 26, 2019. https://research.vu.nl/en/publications/c38c1661-6d62-4e57-99d4-9a5241a73f30 ; urn:nbn:nl:ui:31-1871/55267 ; c38c1661-6d62-4e57-99d4-9a5241a73f30 ; 1871/55267 ; urn:nbn:nl:ui:31-1871/55267 ; https://research.vu.nl/en/publications/c38c1661-6d62-4e57-99d4-9a5241a73f30.

MLA Handbook (7th Edition):

Magliacane, S. “Logics for causal inference under uncertainty.” 2017. Web. 26 Jun 2019.

Vancouver:

Magliacane S. Logics for causal inference under uncertainty. [Internet] [Doctoral dissertation]. NARCIS; 2017. [cited 2019 Jun 26]. Available from: https://research.vu.nl/en/publications/c38c1661-6d62-4e57-99d4-9a5241a73f30 ; urn:nbn:nl:ui:31-1871/55267 ; c38c1661-6d62-4e57-99d4-9a5241a73f30 ; 1871/55267 ; urn:nbn:nl:ui:31-1871/55267 ; https://research.vu.nl/en/publications/c38c1661-6d62-4e57-99d4-9a5241a73f30.

Council of Science Editors:

Magliacane S. Logics for causal inference under uncertainty. [Doctoral Dissertation]. NARCIS; 2017. Available from: https://research.vu.nl/en/publications/c38c1661-6d62-4e57-99d4-9a5241a73f30 ; urn:nbn:nl:ui:31-1871/55267 ; c38c1661-6d62-4e57-99d4-9a5241a73f30 ; 1871/55267 ; urn:nbn:nl:ui:31-1871/55267 ; https://research.vu.nl/en/publications/c38c1661-6d62-4e57-99d4-9a5241a73f30


University of Alberta

25. Sadeghi, Naimeh. Combined Fuzzy and Probabilistic Simulation for Construction Management.

Degree: MS, Department of Civil and Environmental Engineering, 2009, University of Alberta

 Simulation has been used extensively for addressing probabilistic uncertainty in range estimating for construction projects. However, subjective and linguistically expressed information results in added non-probabilistic(more)

Subjects/Keywords: Probabilistic Uncertainty; Discrete event simulation; Fuzzy logic; Pipe spool fabrication; Range estimating; Industrial Construction; Risk analysis; Construction management; Monte Carlo simulation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Sadeghi, N. (2009). Combined Fuzzy and Probabilistic Simulation for Construction Management. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/s4655j31j

Chicago Manual of Style (16th Edition):

Sadeghi, Naimeh. “Combined Fuzzy and Probabilistic Simulation for Construction Management.” 2009. Masters Thesis, University of Alberta. Accessed June 26, 2019. https://era.library.ualberta.ca/files/s4655j31j.

MLA Handbook (7th Edition):

Sadeghi, Naimeh. “Combined Fuzzy and Probabilistic Simulation for Construction Management.” 2009. Web. 26 Jun 2019.

Vancouver:

Sadeghi N. Combined Fuzzy and Probabilistic Simulation for Construction Management. [Internet] [Masters thesis]. University of Alberta; 2009. [cited 2019 Jun 26]. Available from: https://era.library.ualberta.ca/files/s4655j31j.

Council of Science Editors:

Sadeghi N. Combined Fuzzy and Probabilistic Simulation for Construction Management. [Masters Thesis]. University of Alberta; 2009. Available from: https://era.library.ualberta.ca/files/s4655j31j

26. Faix, Marvin. Conception de machines probabilistes dédiées aux inférences bayésiennes : Theory and hardware implementation of probabilistic machines.

Degree: Docteur es, Mathématiques et Informatique, 2016, Grenoble Alpes

Ces travaux de recherche ont pour but de concevoir des ordinateurs baséssur une organisation du calcul mieux adaptée au raisonnement probabiliste.Notre intérêt s’est porté sur… (more)

Subjects/Keywords: Probabilité; Inférence; Bayes; Calcul stochastisque; Machine probabiliste; Inference; Bayes; Stochastic computation; Probabilistic machine; Stochastic logic; 004

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Faix, M. (2016). Conception de machines probabilistes dédiées aux inférences bayésiennes : Theory and hardware implementation of probabilistic machines. (Doctoral Dissertation). Grenoble Alpes. Retrieved from http://www.theses.fr/2016GREAM079

Chicago Manual of Style (16th Edition):

Faix, Marvin. “Conception de machines probabilistes dédiées aux inférences bayésiennes : Theory and hardware implementation of probabilistic machines.” 2016. Doctoral Dissertation, Grenoble Alpes. Accessed June 26, 2019. http://www.theses.fr/2016GREAM079.

MLA Handbook (7th Edition):

Faix, Marvin. “Conception de machines probabilistes dédiées aux inférences bayésiennes : Theory and hardware implementation of probabilistic machines.” 2016. Web. 26 Jun 2019.

Vancouver:

Faix M. Conception de machines probabilistes dédiées aux inférences bayésiennes : Theory and hardware implementation of probabilistic machines. [Internet] [Doctoral dissertation]. Grenoble Alpes; 2016. [cited 2019 Jun 26]. Available from: http://www.theses.fr/2016GREAM079.

Council of Science Editors:

Faix M. Conception de machines probabilistes dédiées aux inférences bayésiennes : Theory and hardware implementation of probabilistic machines. [Doctoral Dissertation]. Grenoble Alpes; 2016. Available from: http://www.theses.fr/2016GREAM079


University of California – Berkeley

27. Puggelli, Alberto. Formal Techniques for the Verification and Optimal Control of Probabilistic Systems in the Presence of Modeling Uncertainties.

Degree: Electrical Engineering, 2014, University of California – Berkeley

 We present a framework to design and verify the behavior of stochastic systems whose parameters are not known with certainty but are instead affected by… (more)

Subjects/Keywords: Electrical engineering; Computer science; Autonomous Car Driving; Convex uncertainty; Model checking; Probabilistic Computation Tree Logic; Renewable energy; Robust Control

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Puggelli, A. (2014). Formal Techniques for the Verification and Optimal Control of Probabilistic Systems in the Presence of Modeling Uncertainties. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/9hj3m991

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Puggelli, Alberto. “Formal Techniques for the Verification and Optimal Control of Probabilistic Systems in the Presence of Modeling Uncertainties.” 2014. Thesis, University of California – Berkeley. Accessed June 26, 2019. http://www.escholarship.org/uc/item/9hj3m991.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Puggelli, Alberto. “Formal Techniques for the Verification and Optimal Control of Probabilistic Systems in the Presence of Modeling Uncertainties.” 2014. Web. 26 Jun 2019.

Vancouver:

Puggelli A. Formal Techniques for the Verification and Optimal Control of Probabilistic Systems in the Presence of Modeling Uncertainties. [Internet] [Thesis]. University of California – Berkeley; 2014. [cited 2019 Jun 26]. Available from: http://www.escholarship.org/uc/item/9hj3m991.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Puggelli A. Formal Techniques for the Verification and Optimal Control of Probabilistic Systems in the Presence of Modeling Uncertainties. [Thesis]. University of California – Berkeley; 2014. Available from: http://www.escholarship.org/uc/item/9hj3m991

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

28. Sandqvist, Sam. Aspects of Modelling and Simulation of Genetic Algorithms: a Formal Approach.

Degree: 2002, Helsinki University of Technology

Genetic algorithms (GAs) are widely used in solving search and optimisation problems involving very large search spaces, or very many variables where closed form solutions… (more)

Subjects/Keywords: genetic algorithm; temporal logic; probabilistic logic; modelling; simulation; Petri net

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Sandqvist, S. (2002). Aspects of Modelling and Simulation of Genetic Algorithms: a Formal Approach. (Thesis). Helsinki University of Technology. Retrieved from http://lib.tkk.fi/Diss/2002/isbn9512260824/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Sandqvist, Sam. “Aspects of Modelling and Simulation of Genetic Algorithms: a Formal Approach.” 2002. Thesis, Helsinki University of Technology. Accessed June 26, 2019. http://lib.tkk.fi/Diss/2002/isbn9512260824/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Sandqvist, Sam. “Aspects of Modelling and Simulation of Genetic Algorithms: a Formal Approach.” 2002. Web. 26 Jun 2019.

Vancouver:

Sandqvist S. Aspects of Modelling and Simulation of Genetic Algorithms: a Formal Approach. [Internet] [Thesis]. Helsinki University of Technology; 2002. [cited 2019 Jun 26]. Available from: http://lib.tkk.fi/Diss/2002/isbn9512260824/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sandqvist S. Aspects of Modelling and Simulation of Genetic Algorithms: a Formal Approach. [Thesis]. Helsinki University of Technology; 2002. Available from: http://lib.tkk.fi/Diss/2002/isbn9512260824/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Oxford

29. Simaitis, Aistis. Automatic verification of competitive stochastic systems.

Degree: PhD, 2014, University of Oxford

 In this thesis we present a framework for automatic formal analysis of competitive stochastic systems, such as sensor networks, decentralised resource management schemes or distributed… (more)

Subjects/Keywords: 519; Computer science (mathematics); Game theory,economics,social and behavioral sciences (mathematics); Mathematical logic and foundations; Markov chains; stochastic games; probabilistic logic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Simaitis, A. (2014). Automatic verification of competitive stochastic systems. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:68b5e2d8-ba04-419f-8926-4cd542121e2d ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.604538

Chicago Manual of Style (16th Edition):

Simaitis, Aistis. “Automatic verification of competitive stochastic systems.” 2014. Doctoral Dissertation, University of Oxford. Accessed June 26, 2019. http://ora.ox.ac.uk/objects/uuid:68b5e2d8-ba04-419f-8926-4cd542121e2d ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.604538.

MLA Handbook (7th Edition):

Simaitis, Aistis. “Automatic verification of competitive stochastic systems.” 2014. Web. 26 Jun 2019.

Vancouver:

Simaitis A. Automatic verification of competitive stochastic systems. [Internet] [Doctoral dissertation]. University of Oxford; 2014. [cited 2019 Jun 26]. Available from: http://ora.ox.ac.uk/objects/uuid:68b5e2d8-ba04-419f-8926-4cd542121e2d ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.604538.

Council of Science Editors:

Simaitis A. Automatic verification of competitive stochastic systems. [Doctoral Dissertation]. University of Oxford; 2014. Available from: http://ora.ox.ac.uk/objects/uuid:68b5e2d8-ba04-419f-8926-4cd542121e2d ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.604538

30. Lando, Tamar Ariela. Probabilistic Semantics for Modal Logic.

Degree: Philosophy, 2012, University of California – Berkeley

 We develop a probabilistic semantics for modal logic, which was introduced in recent years by Dana Scott. This semantics is intimately related to an older,… (more)

Subjects/Keywords: Philosophy; Logic; Mathematics; Completeness; Modal logic; Probabilistic semantics

…point in the relevant topological 2 For a probabilistic semantics for classical logic, see K… …1.4.2 Topological semantics . . . . . . . . . . 1.5 Measure and probabilistic semantics… …1.5.1 Measure . . . . . . . . . . . . . . . . . . 1.5.2 Probabilistic semantics… …49 50 51 54 55 59 62 63 64 67 74 78 78 81 82 4 Probabilistic Semantics for Dynamic… …Topological Logic 4.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4.2… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lando, T. A. (2012). Probabilistic Semantics for Modal Logic. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/6df2g3xv

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Lando, Tamar Ariela. “Probabilistic Semantics for Modal Logic.” 2012. Thesis, University of California – Berkeley. Accessed June 26, 2019. http://www.escholarship.org/uc/item/6df2g3xv.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Lando, Tamar Ariela. “Probabilistic Semantics for Modal Logic.” 2012. Web. 26 Jun 2019.

Vancouver:

Lando TA. Probabilistic Semantics for Modal Logic. [Internet] [Thesis]. University of California – Berkeley; 2012. [cited 2019 Jun 26]. Available from: http://www.escholarship.org/uc/item/6df2g3xv.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lando TA. Probabilistic Semantics for Modal Logic. [Thesis]. University of California – Berkeley; 2012. Available from: http://www.escholarship.org/uc/item/6df2g3xv

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

[1] [2]

.