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:(First order logic). Showing records 1 – 30 of 80 total matches.

[1] [2] [3]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Country

▼ Search Limiters


University of Johannesburg

1. Schamm, Rainer Franz. Zero-one laws and almost sure validities on finite structures.

Degree: 2012, University of Johannesburg

M.Sc.

This short dissertation is intended to give a brief account of the history and current state of affairs in the field of study called… (more)

Subjects/Keywords: First-order logic; Logic, Symbolic and mathematical

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Schamm, R. F. (2012). Zero-one laws and almost sure validities on finite structures. (Thesis). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/7511

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):

Schamm, Rainer Franz. “Zero-one laws and almost sure validities on finite structures.” 2012. Thesis, University of Johannesburg. Accessed September 26, 2020. http://hdl.handle.net/10210/7511.

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

MLA Handbook (7th Edition):

Schamm, Rainer Franz. “Zero-one laws and almost sure validities on finite structures.” 2012. Web. 26 Sep 2020.

Vancouver:

Schamm RF. Zero-one laws and almost sure validities on finite structures. [Internet] [Thesis]. University of Johannesburg; 2012. [cited 2020 Sep 26]. Available from: http://hdl.handle.net/10210/7511.

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

Council of Science Editors:

Schamm RF. Zero-one laws and almost sure validities on finite structures. [Thesis]. University of Johannesburg; 2012. Available from: http://hdl.handle.net/10210/7511

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


University of Oxford

2. Quick, David Arthur. !-Logic : first order reasoning for families of non-commutative string diagrams.

Degree: PhD, 2015, University of Oxford

 Equational reasoning with string diagrams provides an intuitive method for proving equations between morphisms in various forms of monoidal category. !-Graphs were introduced with the… (more)

Subjects/Keywords: 160; First-order logic; Reasoning – Graphic methods

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Quick, D. A. (2015). !-Logic : first order reasoning for families of non-commutative string diagrams. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:baf2d50d-8c5f-419d-9b3d-f2f700f8acbd ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.712511

Chicago Manual of Style (16th Edition):

Quick, David Arthur. “!-Logic : first order reasoning for families of non-commutative string diagrams.” 2015. Doctoral Dissertation, University of Oxford. Accessed September 26, 2020. http://ora.ox.ac.uk/objects/uuid:baf2d50d-8c5f-419d-9b3d-f2f700f8acbd ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.712511.

MLA Handbook (7th Edition):

Quick, David Arthur. “!-Logic : first order reasoning for families of non-commutative string diagrams.” 2015. Web. 26 Sep 2020.

Vancouver:

Quick DA. !-Logic : first order reasoning for families of non-commutative string diagrams. [Internet] [Doctoral dissertation]. University of Oxford; 2015. [cited 2020 Sep 26]. Available from: http://ora.ox.ac.uk/objects/uuid:baf2d50d-8c5f-419d-9b3d-f2f700f8acbd ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.712511.

Council of Science Editors:

Quick DA. !-Logic : first order reasoning for families of non-commutative string diagrams. [Doctoral Dissertation]. University of Oxford; 2015. Available from: http://ora.ox.ac.uk/objects/uuid:baf2d50d-8c5f-419d-9b3d-f2f700f8acbd ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.712511

3. Naziazeno Galvão, Eudes. A class of QFA rings .

Degree: 2011, Universidade Federal de Pernambuco

 Nesta tese, provamos que todo domínio infinito finitamente gerado é bi-interpretável com a estrutura dos números naturais. Usando este argumento, demonstramos que todo anel f.g.… (more)

Subjects/Keywords: Mathematical Logic; Model Theory First Order Logic; QFA Rings

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Naziazeno Galvão, E. (2011). A class of QFA rings . (Thesis). Universidade Federal de Pernambuco. Retrieved from http://repositorio.ufpe.br/handle/123456789/1291

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):

Naziazeno Galvão, Eudes. “A class of QFA rings .” 2011. Thesis, Universidade Federal de Pernambuco. Accessed September 26, 2020. http://repositorio.ufpe.br/handle/123456789/1291.

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

MLA Handbook (7th Edition):

Naziazeno Galvão, Eudes. “A class of QFA rings .” 2011. Web. 26 Sep 2020.

Vancouver:

Naziazeno Galvão E. A class of QFA rings . [Internet] [Thesis]. Universidade Federal de Pernambuco; 2011. [cited 2020 Sep 26]. Available from: http://repositorio.ufpe.br/handle/123456789/1291.

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

Council of Science Editors:

Naziazeno Galvão E. A class of QFA rings . [Thesis]. Universidade Federal de Pernambuco; 2011. Available from: http://repositorio.ufpe.br/handle/123456789/1291

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


University of Waterloo

4. Ashmore, Rylo. Local Reasoning for Parameterized First Order Protocols.

Degree: 2019, University of Waterloo

First Order Logic (FOL) is a powerful reasoning tool for program verification. Recent work on Ivy shows that FOL is well suited for verification of… (more)

Subjects/Keywords: formal methods; verification; local reasoning; Ivy; distributed systems; first order logic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ashmore, R. (2019). Local Reasoning for Parameterized First Order Protocols. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/14886

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):

Ashmore, Rylo. “Local Reasoning for Parameterized First Order Protocols.” 2019. Thesis, University of Waterloo. Accessed September 26, 2020. http://hdl.handle.net/10012/14886.

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

MLA Handbook (7th Edition):

Ashmore, Rylo. “Local Reasoning for Parameterized First Order Protocols.” 2019. Web. 26 Sep 2020.

Vancouver:

Ashmore R. Local Reasoning for Parameterized First Order Protocols. [Internet] [Thesis]. University of Waterloo; 2019. [cited 2020 Sep 26]. Available from: http://hdl.handle.net/10012/14886.

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

Council of Science Editors:

Ashmore R. Local Reasoning for Parameterized First Order Protocols. [Thesis]. University of Waterloo; 2019. Available from: http://hdl.handle.net/10012/14886

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


University of Toronto

5. Katsumi, Megan. A Methodology for the Development and Verification of Expressive Ontologies.

Degree: 2011, University of Toronto

This work focuses on the presentation of a methodology for the development and verification of expressive ontologies. Motivated by experiences with the development of first-order(more)

Subjects/Keywords: industrial engineering; ontology; development lifecycle; verification; first-order logic; 0546; 0800

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Katsumi, M. (2011). A Methodology for the Development and Verification of Expressive Ontologies. (Masters Thesis). University of Toronto. Retrieved from http://hdl.handle.net/1807/31274

Chicago Manual of Style (16th Edition):

Katsumi, Megan. “A Methodology for the Development and Verification of Expressive Ontologies.” 2011. Masters Thesis, University of Toronto. Accessed September 26, 2020. http://hdl.handle.net/1807/31274.

MLA Handbook (7th Edition):

Katsumi, Megan. “A Methodology for the Development and Verification of Expressive Ontologies.” 2011. Web. 26 Sep 2020.

Vancouver:

Katsumi M. A Methodology for the Development and Verification of Expressive Ontologies. [Internet] [Masters thesis]. University of Toronto; 2011. [cited 2020 Sep 26]. Available from: http://hdl.handle.net/1807/31274.

Council of Science Editors:

Katsumi M. A Methodology for the Development and Verification of Expressive Ontologies. [Masters Thesis]. University of Toronto; 2011. Available from: http://hdl.handle.net/1807/31274


University of Toronto

6. Ong, Darren. Semantic Integration of Time Ontologies.

Degree: 2011, University of Toronto

Here we consider the verification and semantic integration for the set of first-order time ontologies by Allen-Hayes, Ladkin, and van Benthem that axiomatize time as… (more)

Subjects/Keywords: Time Ontologies; First Order Logic; Semantic Integration; Ontology Verification; 0546

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ong, D. (2011). Semantic Integration of Time Ontologies. (Masters Thesis). University of Toronto. Retrieved from http://hdl.handle.net/1807/31373

Chicago Manual of Style (16th Edition):

Ong, Darren. “Semantic Integration of Time Ontologies.” 2011. Masters Thesis, University of Toronto. Accessed September 26, 2020. http://hdl.handle.net/1807/31373.

MLA Handbook (7th Edition):

Ong, Darren. “Semantic Integration of Time Ontologies.” 2011. Web. 26 Sep 2020.

Vancouver:

Ong D. Semantic Integration of Time Ontologies. [Internet] [Masters thesis]. University of Toronto; 2011. [cited 2020 Sep 26]. Available from: http://hdl.handle.net/1807/31373.

Council of Science Editors:

Ong D. Semantic Integration of Time Ontologies. [Masters Thesis]. University of Toronto; 2011. Available from: http://hdl.handle.net/1807/31373


University of Manchester

7. Sticksel, Christoph. Efficient Equational Reasoning for the Inst-Gen Framework.

Degree: 2011, University of Manchester

We can classify several quite different calculi for automated reasoning in first-order logic as instantiation-based methods (IMs). Broadly speaking, unlike in traditional calculi such as… (more)

Subjects/Keywords: automated reasoning; first-order logic; equational reasoning; instantiation-based methods

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sticksel, C. (2011). Efficient Equational Reasoning for the Inst-Gen Framework. (Doctoral Dissertation). University of Manchester. Retrieved from http://www.manchester.ac.uk/escholar/uk-ac-man-scw:124674

Chicago Manual of Style (16th Edition):

Sticksel, Christoph. “Efficient Equational Reasoning for the Inst-Gen Framework.” 2011. Doctoral Dissertation, University of Manchester. Accessed September 26, 2020. http://www.manchester.ac.uk/escholar/uk-ac-man-scw:124674.

MLA Handbook (7th Edition):

Sticksel, Christoph. “Efficient Equational Reasoning for the Inst-Gen Framework.” 2011. Web. 26 Sep 2020.

Vancouver:

Sticksel C. Efficient Equational Reasoning for the Inst-Gen Framework. [Internet] [Doctoral dissertation]. University of Manchester; 2011. [cited 2020 Sep 26]. Available from: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:124674.

Council of Science Editors:

Sticksel C. Efficient Equational Reasoning for the Inst-Gen Framework. [Doctoral Dissertation]. University of Manchester; 2011. Available from: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:124674


University of Ottawa

8. Newell, Sarah. Building an Ontology of Community Resilience .

Degree: 2014, University of Ottawa

 Background: Community resilience to a disaster is a complex phenomenon studied using a variety of research lenses, such as psychological and ecological, resulting in a… (more)

Subjects/Keywords: Community resilience; Disaster; Ecological; Psychological; Ontology; First Order Logic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Newell, S. (2014). Building an Ontology of Community Resilience . (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/31755

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):

Newell, Sarah. “Building an Ontology of Community Resilience .” 2014. Thesis, University of Ottawa. Accessed September 26, 2020. http://hdl.handle.net/10393/31755.

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

MLA Handbook (7th Edition):

Newell, Sarah. “Building an Ontology of Community Resilience .” 2014. Web. 26 Sep 2020.

Vancouver:

Newell S. Building an Ontology of Community Resilience . [Internet] [Thesis]. University of Ottawa; 2014. [cited 2020 Sep 26]. Available from: http://hdl.handle.net/10393/31755.

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

Council of Science Editors:

Newell S. Building an Ontology of Community Resilience . [Thesis]. University of Ottawa; 2014. Available from: http://hdl.handle.net/10393/31755

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


University of Manchester

9. Sticksel, Christoph. Efficient equational reasoning for the Inst-Gen Framework.

Degree: PhD, 2011, University of Manchester

 We can classify several quite different calculi for automated reasoning in first-order logic as instantiation-based methods (IMs). Broadly speaking, unlike in traditional calculi such as… (more)

Subjects/Keywords: 511.3; automated reasoning; first-order logic; equational reasoning; instantiation-based methods

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sticksel, C. (2011). Efficient equational reasoning for the Inst-Gen Framework. (Doctoral Dissertation). University of Manchester. Retrieved from https://www.research.manchester.ac.uk/portal/en/theses/efficient-equational-reasoning-for-the-instgen-framework(67ead780-3ec9-4897-ac17-48d3de011b4b).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.548998

Chicago Manual of Style (16th Edition):

Sticksel, Christoph. “Efficient equational reasoning for the Inst-Gen Framework.” 2011. Doctoral Dissertation, University of Manchester. Accessed September 26, 2020. https://www.research.manchester.ac.uk/portal/en/theses/efficient-equational-reasoning-for-the-instgen-framework(67ead780-3ec9-4897-ac17-48d3de011b4b).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.548998.

MLA Handbook (7th Edition):

Sticksel, Christoph. “Efficient equational reasoning for the Inst-Gen Framework.” 2011. Web. 26 Sep 2020.

Vancouver:

Sticksel C. Efficient equational reasoning for the Inst-Gen Framework. [Internet] [Doctoral dissertation]. University of Manchester; 2011. [cited 2020 Sep 26]. Available from: https://www.research.manchester.ac.uk/portal/en/theses/efficient-equational-reasoning-for-the-instgen-framework(67ead780-3ec9-4897-ac17-48d3de011b4b).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.548998.

Council of Science Editors:

Sticksel C. Efficient equational reasoning for the Inst-Gen Framework. [Doctoral Dissertation]. University of Manchester; 2011. Available from: https://www.research.manchester.ac.uk/portal/en/theses/efficient-equational-reasoning-for-the-instgen-framework(67ead780-3ec9-4897-ac17-48d3de011b4b).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.548998

10. Kuester, Jan-Christoph. Runtime verification on data-carrying traces .

Degree: 2016, Australian National University

 Malfunctioning software systems can cause severe loss of money, sensitive data, or even human life. The ambition is therefore to verify these systems not only… (more)

Subjects/Keywords: Runtime verification; Monitoring; Spawning automata; Temporal logic; First-order logic; Trace-length independence; Android security

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kuester, J. (2016). Runtime verification on data-carrying traces . (Thesis). Australian National University. Retrieved from http://hdl.handle.net/1885/110029

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):

Kuester, Jan-Christoph. “Runtime verification on data-carrying traces .” 2016. Thesis, Australian National University. Accessed September 26, 2020. http://hdl.handle.net/1885/110029.

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

MLA Handbook (7th Edition):

Kuester, Jan-Christoph. “Runtime verification on data-carrying traces .” 2016. Web. 26 Sep 2020.

Vancouver:

Kuester J. Runtime verification on data-carrying traces . [Internet] [Thesis]. Australian National University; 2016. [cited 2020 Sep 26]. Available from: http://hdl.handle.net/1885/110029.

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

Council of Science Editors:

Kuester J. Runtime verification on data-carrying traces . [Thesis]. Australian National University; 2016. Available from: http://hdl.handle.net/1885/110029

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


University of Bath

11. Ralph, Benjamin. Modular normalisation of classical proofs.

Degree: PhD, 2019, University of Bath

 The main contribution of this thesis is to present a study of two normalisation theorems and proofs in classical logic: one propositional, one first-order. For… (more)

Subjects/Keywords: 004; proof theory; deep inference; normalisation; propositional logic; first-order logic; herbrand's theorem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ralph, B. (2019). Modular normalisation of classical proofs. (Doctoral Dissertation). University of Bath. Retrieved from https://researchportal.bath.ac.uk/en/studentthesis/modular-normalisation-of-classical-proofs(ae1dc3d1-c3dd-4101-a975-a15c8253fcac).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.774182

Chicago Manual of Style (16th Edition):

Ralph, Benjamin. “Modular normalisation of classical proofs.” 2019. Doctoral Dissertation, University of Bath. Accessed September 26, 2020. https://researchportal.bath.ac.uk/en/studentthesis/modular-normalisation-of-classical-proofs(ae1dc3d1-c3dd-4101-a975-a15c8253fcac).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.774182.

MLA Handbook (7th Edition):

Ralph, Benjamin. “Modular normalisation of classical proofs.” 2019. Web. 26 Sep 2020.

Vancouver:

Ralph B. Modular normalisation of classical proofs. [Internet] [Doctoral dissertation]. University of Bath; 2019. [cited 2020 Sep 26]. Available from: https://researchportal.bath.ac.uk/en/studentthesis/modular-normalisation-of-classical-proofs(ae1dc3d1-c3dd-4101-a975-a15c8253fcac).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.774182.

Council of Science Editors:

Ralph B. Modular normalisation of classical proofs. [Doctoral Dissertation]. University of Bath; 2019. Available from: https://researchportal.bath.ac.uk/en/studentthesis/modular-normalisation-of-classical-proofs(ae1dc3d1-c3dd-4101-a975-a15c8253fcac).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.774182

12. Saghafi, Salman. A Framework for Exploring Finite Models.

Degree: PhD, 2015, Worcester Polytechnic Institute

  This thesis presents a framework for understanding first-order theories by investigating their models. A common application is to help users, who are not necessarily… (more)

Subjects/Keywords: exploration; finite model-finding; first-order logic; provenance information; Chase; Geometric Logic; Razor; Aluminum

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Saghafi, S. (2015). A Framework for Exploring Finite Models. (Doctoral Dissertation). Worcester Polytechnic Institute. Retrieved from etd-043015-110044 ; https://digitalcommons.wpi.edu/etd-dissertations/458

Chicago Manual of Style (16th Edition):

Saghafi, Salman. “A Framework for Exploring Finite Models.” 2015. Doctoral Dissertation, Worcester Polytechnic Institute. Accessed September 26, 2020. etd-043015-110044 ; https://digitalcommons.wpi.edu/etd-dissertations/458.

MLA Handbook (7th Edition):

Saghafi, Salman. “A Framework for Exploring Finite Models.” 2015. Web. 26 Sep 2020.

Vancouver:

Saghafi S. A Framework for Exploring Finite Models. [Internet] [Doctoral dissertation]. Worcester Polytechnic Institute; 2015. [cited 2020 Sep 26]. Available from: etd-043015-110044 ; https://digitalcommons.wpi.edu/etd-dissertations/458.

Council of Science Editors:

Saghafi S. A Framework for Exploring Finite Models. [Doctoral Dissertation]. Worcester Polytechnic Institute; 2015. Available from: etd-043015-110044 ; https://digitalcommons.wpi.edu/etd-dissertations/458


University of South Florida

13. Mukhopadhyay, Trisha. A Flexible, Natural Deduction, Automated Reasoner for Quick Deployment of Non-Classical Logic.

Degree: 2019, University of South Florida

 Automated Theorem Provers (ATP) are software programs which carry out inferences over logico-mathematical systems, often with the goal of finding proofs to some given theorem.… (more)

Subjects/Keywords: Automated Theorem Prover; Codelets; First-Order Logic; Higher-Order Logic; Speed Up Theorem; Workspace; Computer Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mukhopadhyay, T. (2019). A Flexible, Natural Deduction, Automated Reasoner for Quick Deployment of Non-Classical Logic. (Thesis). University of South Florida. Retrieved from https://scholarcommons.usf.edu/etd/7862

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):

Mukhopadhyay, Trisha. “A Flexible, Natural Deduction, Automated Reasoner for Quick Deployment of Non-Classical Logic.” 2019. Thesis, University of South Florida. Accessed September 26, 2020. https://scholarcommons.usf.edu/etd/7862.

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

MLA Handbook (7th Edition):

Mukhopadhyay, Trisha. “A Flexible, Natural Deduction, Automated Reasoner for Quick Deployment of Non-Classical Logic.” 2019. Web. 26 Sep 2020.

Vancouver:

Mukhopadhyay T. A Flexible, Natural Deduction, Automated Reasoner for Quick Deployment of Non-Classical Logic. [Internet] [Thesis]. University of South Florida; 2019. [cited 2020 Sep 26]. Available from: https://scholarcommons.usf.edu/etd/7862.

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

Council of Science Editors:

Mukhopadhyay T. A Flexible, Natural Deduction, Automated Reasoner for Quick Deployment of Non-Classical Logic. [Thesis]. University of South Florida; 2019. Available from: https://scholarcommons.usf.edu/etd/7862

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

14. Salvatore, Felipe de Souza. Topics in modal quantification theory.

Degree: Mestrado, Filosofia, 2015, University of São Paulo

The modal logic S5 gives us a simple technical tool to analyze some main notions from philosophy (e.g. metaphysical necessity and epistemological concepts such as… (more)

Subjects/Keywords: First-order modal logic; Interpolação; Interpolation; Justification logic; Logic; Lógica; Lógica da justificação; Lógica modal de primeira ordem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Salvatore, F. d. S. (2015). Topics in modal quantification theory. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/8/8133/tde-14122015-122734/ ;

Chicago Manual of Style (16th Edition):

Salvatore, Felipe de Souza. “Topics in modal quantification theory.” 2015. Masters Thesis, University of São Paulo. Accessed September 26, 2020. http://www.teses.usp.br/teses/disponiveis/8/8133/tde-14122015-122734/ ;.

MLA Handbook (7th Edition):

Salvatore, Felipe de Souza. “Topics in modal quantification theory.” 2015. Web. 26 Sep 2020.

Vancouver:

Salvatore FdS. Topics in modal quantification theory. [Internet] [Masters thesis]. University of São Paulo; 2015. [cited 2020 Sep 26]. Available from: http://www.teses.usp.br/teses/disponiveis/8/8133/tde-14122015-122734/ ;.

Council of Science Editors:

Salvatore FdS. Topics in modal quantification theory. [Masters Thesis]. University of São Paulo; 2015. Available from: http://www.teses.usp.br/teses/disponiveis/8/8133/tde-14122015-122734/ ;


McMaster University

15. Khan, Ahmed Jamil. Modelling Fault Tolerance using Deontic Logic: a case study.

Degree: MSc, 2012, McMaster University

Many computer systems in our daily life require highly available applications (such as medical equipment) and some others run on difficult to access places… (more)

Subjects/Keywords: Fault Tolerance; Deontic Logic; Modal Logic; High Level Modelling; First Order Logic; Computational Engineering; Other Computer Engineering; Computational Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Khan, A. J. (2012). Modelling Fault Tolerance using Deontic Logic: a case study. (Masters Thesis). McMaster University. Retrieved from http://hdl.handle.net/11375/12741

Chicago Manual of Style (16th Edition):

Khan, Ahmed Jamil. “Modelling Fault Tolerance using Deontic Logic: a case study.” 2012. Masters Thesis, McMaster University. Accessed September 26, 2020. http://hdl.handle.net/11375/12741.

MLA Handbook (7th Edition):

Khan, Ahmed Jamil. “Modelling Fault Tolerance using Deontic Logic: a case study.” 2012. Web. 26 Sep 2020.

Vancouver:

Khan AJ. Modelling Fault Tolerance using Deontic Logic: a case study. [Internet] [Masters thesis]. McMaster University; 2012. [cited 2020 Sep 26]. Available from: http://hdl.handle.net/11375/12741.

Council of Science Editors:

Khan AJ. Modelling Fault Tolerance using Deontic Logic: a case study. [Masters Thesis]. McMaster University; 2012. Available from: http://hdl.handle.net/11375/12741

16. Lochner, Jan-Hendrik. An Effective and Efficient Inference Control System for Relational Database Queries.

Degree: 2011, Technische Universität Dortmund

 Protecting confidential information in relational databases while ensuring availability of public information at the same time is a demanding task. Unwanted information flows due to… (more)

Subjects/Keywords: confidentiality; controlled query evaluation; first-order logic; inference control; information security; relational databases; 004

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lochner, J. (2011). An Effective and Efficient Inference Control System for Relational Database Queries. (Thesis). Technische Universität Dortmund. Retrieved from http://hdl.handle.net/2003/27625

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):

Lochner, Jan-Hendrik. “An Effective and Efficient Inference Control System for Relational Database Queries.” 2011. Thesis, Technische Universität Dortmund. Accessed September 26, 2020. http://hdl.handle.net/2003/27625.

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

MLA Handbook (7th Edition):

Lochner, Jan-Hendrik. “An Effective and Efficient Inference Control System for Relational Database Queries.” 2011. Web. 26 Sep 2020.

Vancouver:

Lochner J. An Effective and Efficient Inference Control System for Relational Database Queries. [Internet] [Thesis]. Technische Universität Dortmund; 2011. [cited 2020 Sep 26]. Available from: http://hdl.handle.net/2003/27625.

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

Council of Science Editors:

Lochner J. An Effective and Efficient Inference Control System for Relational Database Queries. [Thesis]. Technische Universität Dortmund; 2011. Available from: http://hdl.handle.net/2003/27625

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

17. Lochner, Jan-Hendrik. An Effective and Efficient Inference Control System for Relational Database Queries.

Degree: 2011, Technische Universität Dortmund

 Protecting confidential information in relational databases while ensuring availability of public information at the same time is a demanding task. Unwanted information flows due to… (more)

Subjects/Keywords: confidentiality; controlled query evaluation; first-order logic; inference control; information security; relational databases; 004

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lochner, J. (2011). An Effective and Efficient Inference Control System for Relational Database Queries. (Doctoral Dissertation). Technische Universität Dortmund. Retrieved from http://dx.doi.org/10.17877/DE290R-8779

Chicago Manual of Style (16th Edition):

Lochner, Jan-Hendrik. “An Effective and Efficient Inference Control System for Relational Database Queries.” 2011. Doctoral Dissertation, Technische Universität Dortmund. Accessed September 26, 2020. http://dx.doi.org/10.17877/DE290R-8779.

MLA Handbook (7th Edition):

Lochner, Jan-Hendrik. “An Effective and Efficient Inference Control System for Relational Database Queries.” 2011. Web. 26 Sep 2020.

Vancouver:

Lochner J. An Effective and Efficient Inference Control System for Relational Database Queries. [Internet] [Doctoral dissertation]. Technische Universität Dortmund; 2011. [cited 2020 Sep 26]. Available from: http://dx.doi.org/10.17877/DE290R-8779.

Council of Science Editors:

Lochner J. An Effective and Efficient Inference Control System for Relational Database Queries. [Doctoral Dissertation]. Technische Universität Dortmund; 2011. Available from: http://dx.doi.org/10.17877/DE290R-8779


Universiteit Utrecht

18. Prinse, R.J. Applying first order logic decision tree induction to opponent modelling in No-limit Texas Hold'em Poker.

Degree: 2012, Universiteit Utrecht

 In this thesis methods will be discussed to attempt to improve the decision making for agents involved in playing Texas Hold'em poker. Poker is a… (more)

Subjects/Keywords: poker; tree induction; uncertainty; exploration; exploitation; first order logic; opponent modelling; monte carlo

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Prinse, R. J. (2012). Applying first order logic decision tree induction to opponent modelling in No-limit Texas Hold'em Poker. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/253744

Chicago Manual of Style (16th Edition):

Prinse, R J. “Applying first order logic decision tree induction to opponent modelling in No-limit Texas Hold'em Poker.” 2012. Masters Thesis, Universiteit Utrecht. Accessed September 26, 2020. http://dspace.library.uu.nl:8080/handle/1874/253744.

MLA Handbook (7th Edition):

Prinse, R J. “Applying first order logic decision tree induction to opponent modelling in No-limit Texas Hold'em Poker.” 2012. Web. 26 Sep 2020.

Vancouver:

Prinse RJ. Applying first order logic decision tree induction to opponent modelling in No-limit Texas Hold'em Poker. [Internet] [Masters thesis]. Universiteit Utrecht; 2012. [cited 2020 Sep 26]. Available from: http://dspace.library.uu.nl:8080/handle/1874/253744.

Council of Science Editors:

Prinse RJ. Applying first order logic decision tree induction to opponent modelling in No-limit Texas Hold'em Poker. [Masters Thesis]. Universiteit Utrecht; 2012. Available from: http://dspace.library.uu.nl:8080/handle/1874/253744


University of Oxford

19. Broadbent, Christopher H. On collapsible pushdown automata, their graphs and the power of links.

Degree: PhD, 2011, University of Oxford

 Higher-Order Pushdown Automata (HOPDA) are abstract machines equipped with a nested stacks of stacks ... of stacks of stacks. Collapsible pushdown automata (CPDA) enhance these… (more)

Subjects/Keywords: 004.0151; Computer science (mathematics); collapsible pushdown automata; first-order logic; prefix-rewrite systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Broadbent, C. H. (2011). On collapsible pushdown automata, their graphs and the power of links. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:aaa328fe-60be-4abe-8f84-97dbd9e0a3fe ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.559862

Chicago Manual of Style (16th Edition):

Broadbent, Christopher H. “On collapsible pushdown automata, their graphs and the power of links.” 2011. Doctoral Dissertation, University of Oxford. Accessed September 26, 2020. http://ora.ox.ac.uk/objects/uuid:aaa328fe-60be-4abe-8f84-97dbd9e0a3fe ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.559862.

MLA Handbook (7th Edition):

Broadbent, Christopher H. “On collapsible pushdown automata, their graphs and the power of links.” 2011. Web. 26 Sep 2020.

Vancouver:

Broadbent CH. On collapsible pushdown automata, their graphs and the power of links. [Internet] [Doctoral dissertation]. University of Oxford; 2011. [cited 2020 Sep 26]. Available from: http://ora.ox.ac.uk/objects/uuid:aaa328fe-60be-4abe-8f84-97dbd9e0a3fe ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.559862.

Council of Science Editors:

Broadbent CH. On collapsible pushdown automata, their graphs and the power of links. [Doctoral Dissertation]. University of Oxford; 2011. Available from: http://ora.ox.ac.uk/objects/uuid:aaa328fe-60be-4abe-8f84-97dbd9e0a3fe ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.559862

20. Laurent, Yoann. Alloy4PV : un Framework pour la Vérification de Procédés Métiers : Alloy4PV : a Framework for Business Process Verification.

Degree: Docteur es, Informatique, 2015, Université Pierre et Marie Curie – Paris VI

Dans cette thèse, nous avons tout d'abord fait une étude de l'état de l'art dans les différents domaines des procédés (métier, logiciel, militaire, médical, etc)… (more)

Subjects/Keywords: Procédés; Métiers; Vérification; Model-Checking; Alloy; Logique de premier-Ordre; First-order logic; Business; 004

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Laurent, Y. (2015). Alloy4PV : un Framework pour la Vérification de Procédés Métiers : Alloy4PV : a Framework for Business Process Verification. (Doctoral Dissertation). Université Pierre et Marie Curie – Paris VI. Retrieved from http://www.theses.fr/2015PA066024

Chicago Manual of Style (16th Edition):

Laurent, Yoann. “Alloy4PV : un Framework pour la Vérification de Procédés Métiers : Alloy4PV : a Framework for Business Process Verification.” 2015. Doctoral Dissertation, Université Pierre et Marie Curie – Paris VI. Accessed September 26, 2020. http://www.theses.fr/2015PA066024.

MLA Handbook (7th Edition):

Laurent, Yoann. “Alloy4PV : un Framework pour la Vérification de Procédés Métiers : Alloy4PV : a Framework for Business Process Verification.” 2015. Web. 26 Sep 2020.

Vancouver:

Laurent Y. Alloy4PV : un Framework pour la Vérification de Procédés Métiers : Alloy4PV : a Framework for Business Process Verification. [Internet] [Doctoral dissertation]. Université Pierre et Marie Curie – Paris VI; 2015. [cited 2020 Sep 26]. Available from: http://www.theses.fr/2015PA066024.

Council of Science Editors:

Laurent Y. Alloy4PV : un Framework pour la Vérification de Procédés Métiers : Alloy4PV : a Framework for Business Process Verification. [Doctoral Dissertation]. Université Pierre et Marie Curie – Paris VI; 2015. Available from: http://www.theses.fr/2015PA066024

21. Tourret, Sophie. Prime implicate generation in equational logic : Abduction in first order logic with equality.

Degree: Docteur es, Informatique, 2016, Université Grenoble Alpes (ComUE)

Ce mémoire présente le résultat de mon travail de thèse sur la génération d'impliqués premiers en logique équationnelle fermée, i.e., la génération des conséquences les… (more)

Subjects/Keywords: Abduction; Logique du premier ordre; Impliqués premiers; Abduction; First order logic; Prime implicates; 510; 612

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tourret, S. (2016). Prime implicate generation in equational logic : Abduction in first order logic with equality. (Doctoral Dissertation). Université Grenoble Alpes (ComUE). Retrieved from http://www.theses.fr/2016GREAM006

Chicago Manual of Style (16th Edition):

Tourret, Sophie. “Prime implicate generation in equational logic : Abduction in first order logic with equality.” 2016. Doctoral Dissertation, Université Grenoble Alpes (ComUE). Accessed September 26, 2020. http://www.theses.fr/2016GREAM006.

MLA Handbook (7th Edition):

Tourret, Sophie. “Prime implicate generation in equational logic : Abduction in first order logic with equality.” 2016. Web. 26 Sep 2020.

Vancouver:

Tourret S. Prime implicate generation in equational logic : Abduction in first order logic with equality. [Internet] [Doctoral dissertation]. Université Grenoble Alpes (ComUE); 2016. [cited 2020 Sep 26]. Available from: http://www.theses.fr/2016GREAM006.

Council of Science Editors:

Tourret S. Prime implicate generation in equational logic : Abduction in first order logic with equality. [Doctoral Dissertation]. Université Grenoble Alpes (ComUE); 2016. Available from: http://www.theses.fr/2016GREAM006


Louisiana State University

22. Arab-Khazaeli, Soha. Context Aware Textual Entailment.

Degree: PhD, Engineering Science and Materials, 2015, Louisiana State University

 In conversations, stories, news reporting, and other forms of natural language, understanding requires participants to make assumptions (hypothesis) based on background knowledge, a process called… (more)

Subjects/Keywords: natural language processing; machine learning; textual entailment; first-order-logic; text representation; context identification

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Arab-Khazaeli, S. (2015). Context Aware Textual Entailment. (Doctoral Dissertation). Louisiana State University. Retrieved from etd-11152015-141853 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1188

Chicago Manual of Style (16th Edition):

Arab-Khazaeli, Soha. “Context Aware Textual Entailment.” 2015. Doctoral Dissertation, Louisiana State University. Accessed September 26, 2020. etd-11152015-141853 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1188.

MLA Handbook (7th Edition):

Arab-Khazaeli, Soha. “Context Aware Textual Entailment.” 2015. Web. 26 Sep 2020.

Vancouver:

Arab-Khazaeli S. Context Aware Textual Entailment. [Internet] [Doctoral dissertation]. Louisiana State University; 2015. [cited 2020 Sep 26]. Available from: etd-11152015-141853 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1188.

Council of Science Editors:

Arab-Khazaeli S. Context Aware Textual Entailment. [Doctoral Dissertation]. Louisiana State University; 2015. Available from: etd-11152015-141853 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1188


University of Georgia

23. Zhao, Haibo. Scalable composition of Web services under uncertainty.

Degree: 2014, University of Georgia

 Facilitating the assembly of services to form composite services is an important functionality in Service-oriented architecture (SOA). In this dissertation, we focus on the problem… (more)

Subjects/Keywords: Web service composition; RESTful Web Services; decision-theoretic planning; first-order logic; hierarchy

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhao, H. (2014). Scalable composition of Web services under uncertainty. (Thesis). University of Georgia. Retrieved from http://hdl.handle.net/10724/25986

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):

Zhao, Haibo. “Scalable composition of Web services under uncertainty.” 2014. Thesis, University of Georgia. Accessed September 26, 2020. http://hdl.handle.net/10724/25986.

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

MLA Handbook (7th Edition):

Zhao, Haibo. “Scalable composition of Web services under uncertainty.” 2014. Web. 26 Sep 2020.

Vancouver:

Zhao H. Scalable composition of Web services under uncertainty. [Internet] [Thesis]. University of Georgia; 2014. [cited 2020 Sep 26]. Available from: http://hdl.handle.net/10724/25986.

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

Council of Science Editors:

Zhao H. Scalable composition of Web services under uncertainty. [Thesis]. University of Georgia; 2014. Available from: http://hdl.handle.net/10724/25986

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

24. Μπαγουλή, Αικατερίνη. Μετατροπή εκφράσεων κατηγορηματικής λογικής πρώτης τάξης σε φυσική γλώσσα.

Degree: 2009, University of Patras

Με σκοπό την ενίσχυση του μαθήματος Τεχνητή Νοημοσύνη στο τμήμα Μηχανικών Η/Υ και Πληροφορικής της Πολυτεχνικής σχολής του Πανεπιστημίου Πατρών έχει δημιουργηθεί από την Ομάδα… (more)

Subjects/Keywords: Κατηγορηματική λογική; Φυσική γλώσσα; Κατηγορηματικός λογισμός πρώτης τάξης; 006.3; Predicate logic; Natural language; Predicate calculous; First order logic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Μπαγουλή, . (2009). Μετατροπή εκφράσεων κατηγορηματικής λογικής πρώτης τάξης σε φυσική γλώσσα. (Masters Thesis). University of Patras. Retrieved from http://nemertes.lis.upatras.gr/jspui/handle/10889/2106

Chicago Manual of Style (16th Edition):

Μπαγουλή, Αικατερίνη. “Μετατροπή εκφράσεων κατηγορηματικής λογικής πρώτης τάξης σε φυσική γλώσσα.” 2009. Masters Thesis, University of Patras. Accessed September 26, 2020. http://nemertes.lis.upatras.gr/jspui/handle/10889/2106.

MLA Handbook (7th Edition):

Μπαγουλή, Αικατερίνη. “Μετατροπή εκφράσεων κατηγορηματικής λογικής πρώτης τάξης σε φυσική γλώσσα.” 2009. Web. 26 Sep 2020.

Vancouver:

Μπαγουλή . Μετατροπή εκφράσεων κατηγορηματικής λογικής πρώτης τάξης σε φυσική γλώσσα. [Internet] [Masters thesis]. University of Patras; 2009. [cited 2020 Sep 26]. Available from: http://nemertes.lis.upatras.gr/jspui/handle/10889/2106.

Council of Science Editors:

Μπαγουλή . Μετατροπή εκφράσεων κατηγορηματικής λογικής πρώτης τάξης σε φυσική γλώσσα. [Masters Thesis]. University of Patras; 2009. Available from: http://nemertes.lis.upatras.gr/jspui/handle/10889/2106


Brno University of Technology

25. Mazánek, Martin. Automatický theorem prover: An Automatic Theorem Prover.

Degree: 2020, Brno University of Technology

 This thesis focuses on implementation of resolution-based automatic theorem prover for propositional and first-order logic. The goal of this thesis is to create simple prover… (more)

Subjects/Keywords: Automatické dokazování; rezoluce; výroková logika; predikátová logika prvního řádu; TPTP; Automated Theorem Proving; Resolution; Propositional logic; First-order logic; TPTP

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mazánek, M. (2020). Automatický theorem prover: An Automatic Theorem Prover. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/191505

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):

Mazánek, Martin. “Automatický theorem prover: An Automatic Theorem Prover.” 2020. Thesis, Brno University of Technology. Accessed September 26, 2020. http://hdl.handle.net/11012/191505.

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

MLA Handbook (7th Edition):

Mazánek, Martin. “Automatický theorem prover: An Automatic Theorem Prover.” 2020. Web. 26 Sep 2020.

Vancouver:

Mazánek M. Automatický theorem prover: An Automatic Theorem Prover. [Internet] [Thesis]. Brno University of Technology; 2020. [cited 2020 Sep 26]. Available from: http://hdl.handle.net/11012/191505.

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

Council of Science Editors:

Mazánek M. Automatický theorem prover: An Automatic Theorem Prover. [Thesis]. Brno University of Technology; 2020. Available from: http://hdl.handle.net/11012/191505

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


Uniwersytet im. Adama Mickiewicza w Poznaniu

26. Chlebowski, Szymon. Kanoniczne i dualne rachunki erotetyczne dla logiki I-rzędu .

Degree: 2018, Uniwersytet im. Adama Mickiewicza w Poznaniu

 W swojej książce First-Order Logic and Automated Theorem Proving Fitting wprowadził pojęcie własności niesprzeczności (CP), blisko spokrewnione z pojęciem zbioru Hintikki. Własność niesprzeczności jest rodziną… (more)

Subjects/Keywords: teoria dowodu; inferencyjna logika pytań; logika I-rzędu; proof theory; inferential erotetic logic; first-order logic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chlebowski, S. (2018). Kanoniczne i dualne rachunki erotetyczne dla logiki I-rzędu . (Doctoral Dissertation). Uniwersytet im. Adama Mickiewicza w Poznaniu. Retrieved from http://hdl.handle.net/10593/24268

Chicago Manual of Style (16th Edition):

Chlebowski, Szymon. “Kanoniczne i dualne rachunki erotetyczne dla logiki I-rzędu .” 2018. Doctoral Dissertation, Uniwersytet im. Adama Mickiewicza w Poznaniu. Accessed September 26, 2020. http://hdl.handle.net/10593/24268.

MLA Handbook (7th Edition):

Chlebowski, Szymon. “Kanoniczne i dualne rachunki erotetyczne dla logiki I-rzędu .” 2018. Web. 26 Sep 2020.

Vancouver:

Chlebowski S. Kanoniczne i dualne rachunki erotetyczne dla logiki I-rzędu . [Internet] [Doctoral dissertation]. Uniwersytet im. Adama Mickiewicza w Poznaniu; 2018. [cited 2020 Sep 26]. Available from: http://hdl.handle.net/10593/24268.

Council of Science Editors:

Chlebowski S. Kanoniczne i dualne rachunki erotetyczne dla logiki I-rzędu . [Doctoral Dissertation]. Uniwersytet im. Adama Mickiewicza w Poznaniu; 2018. Available from: http://hdl.handle.net/10593/24268


University of South Carolina

27. Wang, Jingsong. A Framework for Combining Logical and Probabilistic Models.

Degree: PhD, Computer Science and Engineering, 2011, University of South Carolina

  Integrating the expressive power of first-order logic with the probabilistic reasoning power of Bayesian networks has attracted the interest of many researchers. We review… (more)

Subjects/Keywords: Computer Sciences; Electrical and Computer Engineering; Engineering; Physical Sciences and Mathematics; Bayesian network; Classification; First order logic; Inductive logic programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, J. (2011). A Framework for Combining Logical and Probabilistic Models. (Doctoral Dissertation). University of South Carolina. Retrieved from https://scholarcommons.sc.edu/etd/804

Chicago Manual of Style (16th Edition):

Wang, Jingsong. “A Framework for Combining Logical and Probabilistic Models.” 2011. Doctoral Dissertation, University of South Carolina. Accessed September 26, 2020. https://scholarcommons.sc.edu/etd/804.

MLA Handbook (7th Edition):

Wang, Jingsong. “A Framework for Combining Logical and Probabilistic Models.” 2011. Web. 26 Sep 2020.

Vancouver:

Wang J. A Framework for Combining Logical and Probabilistic Models. [Internet] [Doctoral dissertation]. University of South Carolina; 2011. [cited 2020 Sep 26]. Available from: https://scholarcommons.sc.edu/etd/804.

Council of Science Editors:

Wang J. A Framework for Combining Logical and Probabilistic Models. [Doctoral Dissertation]. University of South Carolina; 2011. Available from: https://scholarcommons.sc.edu/etd/804

28. Καραμουτζογιάννη, Ζωή. Επαγωγικός λογικός προγραμματισμός : μια διδακτική προσέγγιση.

Degree: 2011, University of Patras

Ο Επαγωγικός Λογικός Προγραμματισμός (Inductive Logic Programming ή, σε συντομογραφία ILP) είναι ο ερευνητικός τομέας της Τεχνητής Νοημοσύνης (Artificial Intelligence) που δραστηριοποιείται στη τομή των… (more)

Subjects/Keywords: Προτασιακή λογική; Κατηγορηματική λογική πρώτης τάξης; Επαγωγικός λογικός προγραμματισμός; 005.115; Propositional logic; First order predicate logic; Inductive logic programming; PROGOL; FOIL; LINUS

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Καραμουτζογιάννη, . (2011). Επαγωγικός λογικός προγραμματισμός : μια διδακτική προσέγγιση. (Masters Thesis). University of Patras. Retrieved from http://hdl.handle.net/10889/5311

Chicago Manual of Style (16th Edition):

Καραμουτζογιάννη, Ζωή. “Επαγωγικός λογικός προγραμματισμός : μια διδακτική προσέγγιση.” 2011. Masters Thesis, University of Patras. Accessed September 26, 2020. http://hdl.handle.net/10889/5311.

MLA Handbook (7th Edition):

Καραμουτζογιάννη, Ζωή. “Επαγωγικός λογικός προγραμματισμός : μια διδακτική προσέγγιση.” 2011. Web. 26 Sep 2020.

Vancouver:

Καραμουτζογιάννη . Επαγωγικός λογικός προγραμματισμός : μια διδακτική προσέγγιση. [Internet] [Masters thesis]. University of Patras; 2011. [cited 2020 Sep 26]. Available from: http://hdl.handle.net/10889/5311.

Council of Science Editors:

Καραμουτζογιάννη . Επαγωγικός λογικός προγραμματισμός : μια διδακτική προσέγγιση. [Masters Thesis]. University of Patras; 2011. Available from: http://hdl.handle.net/10889/5311


Universidade do Rio Grande do Sul

29. Cavalheiro, Simone André da Costa. Relational approach of graph grammars.

Degree: 2010, Universidade do Rio Grande do Sul

Gramática de grafos é uma linguagem formal bastante adequada para sistemas cujos estados possuem uma topologia complexa (que envolvem vários tipos de elementos e diferentes… (more)

Subjects/Keywords: Gramatica : Grafos; Graph grammar; Theorem proving; Teoria : Categorias; Grafos; First-order logic; Metodos formais; Formal specification; Formal verification

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cavalheiro, S. A. d. C. (2010). Relational approach of graph grammars. (Thesis). Universidade do Rio Grande do Sul. Retrieved from http://hdl.handle.net/10183/25516

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):

Cavalheiro, Simone André da Costa. “Relational approach of graph grammars.” 2010. Thesis, Universidade do Rio Grande do Sul. Accessed September 26, 2020. http://hdl.handle.net/10183/25516.

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

MLA Handbook (7th Edition):

Cavalheiro, Simone André da Costa. “Relational approach of graph grammars.” 2010. Web. 26 Sep 2020.

Vancouver:

Cavalheiro SAdC. Relational approach of graph grammars. [Internet] [Thesis]. Universidade do Rio Grande do Sul; 2010. [cited 2020 Sep 26]. Available from: http://hdl.handle.net/10183/25516.

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

Council of Science Editors:

Cavalheiro SAdC. Relational approach of graph grammars. [Thesis]. Universidade do Rio Grande do Sul; 2010. Available from: http://hdl.handle.net/10183/25516

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


University of Manchester

30. Lopez Hernandez, Julio Cesar. An Abstraction-Refinement Framework for First-Order Reasoning with Large Theories.

Degree: 2020, University of Manchester

 In this thesis, we investigate an abstraction-refinement framework for first-order reasoning with application to large theories. Efficient reasoning with large theories is one of the… (more)

Subjects/Keywords: abstraction-refinement; large theories; automated reasoning; automated theorem proving; under-approximation; over-approximation; first-order logic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lopez Hernandez, J. C. (2020). An Abstraction-Refinement Framework for First-Order Reasoning with Large Theories. (Doctoral Dissertation). University of Manchester. Retrieved from http://www.manchester.ac.uk/escholar/uk-ac-man-scw:325498

Chicago Manual of Style (16th Edition):

Lopez Hernandez, Julio Cesar. “An Abstraction-Refinement Framework for First-Order Reasoning with Large Theories.” 2020. Doctoral Dissertation, University of Manchester. Accessed September 26, 2020. http://www.manchester.ac.uk/escholar/uk-ac-man-scw:325498.

MLA Handbook (7th Edition):

Lopez Hernandez, Julio Cesar. “An Abstraction-Refinement Framework for First-Order Reasoning with Large Theories.” 2020. Web. 26 Sep 2020.

Vancouver:

Lopez Hernandez JC. An Abstraction-Refinement Framework for First-Order Reasoning with Large Theories. [Internet] [Doctoral dissertation]. University of Manchester; 2020. [cited 2020 Sep 26]. Available from: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:325498.

Council of Science Editors:

Lopez Hernandez JC. An Abstraction-Refinement Framework for First-Order Reasoning with Large Theories. [Doctoral Dissertation]. University of Manchester; 2020. Available from: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:325498

[1] [2] [3]

.