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:( en PROPOSITIONAL LOGIC). Showing records 1 – 30 of 40361 total matches.

[1] [2] [3] [4] [5] … [1346]

Search Limiters

Last 2 Years | English Only

Languages

Country

▼ Search Limiters


Pontifical Catholic University of Rio de Janeiro

1. MARIO H. A. TASCHERI. [en] AN INTERACTIVE TOOL TO HELP THE STUDIES OF FORMAL LOGIC.

Degree: 2009, Pontifical Catholic University of Rio de Janeiro

[pt] Neste trabalho investigou-se o emprego dos recentes algoritmos de minimização de funções não diferenciáveis para a resolução do problema da síntese de filtros digitais… (more)

Subjects/Keywords: [pt] LOGICA PROPOSICIONAL; [en] PROPOSITIONAL LOGIC; [pt] LOGICA DE PREDICADOS

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

TASCHERI, M. H. A. (2009). [en] AN INTERACTIVE TOOL TO HELP THE STUDIES OF FORMAL LOGIC. (Thesis). Pontifical Catholic University of Rio de Janeiro. Retrieved from http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=14259

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

TASCHERI, MARIO H. A.. “[en] AN INTERACTIVE TOOL TO HELP THE STUDIES OF FORMAL LOGIC.” 2009. Thesis, Pontifical Catholic University of Rio de Janeiro. Accessed November 29, 2020. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=14259.

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

MLA Handbook (7th Edition):

TASCHERI, MARIO H. A.. “[en] AN INTERACTIVE TOOL TO HELP THE STUDIES OF FORMAL LOGIC.” 2009. Web. 29 Nov 2020.

Vancouver:

TASCHERI MHA. [en] AN INTERACTIVE TOOL TO HELP THE STUDIES OF FORMAL LOGIC. [Internet] [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2009. [cited 2020 Nov 29]. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=14259.

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

Council of Science Editors:

TASCHERI MHA. [en] AN INTERACTIVE TOOL TO HELP THE STUDIES OF FORMAL LOGIC. [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2009. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=14259

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


Pontifical Catholic University of Rio de Janeiro

2. CECILIA REIS ENGLANDER LUSTOSA. [en] ON SOME RELATIONS BETWEEN NATURAL DEDUCTION AND SEQUENT CALCULUS.

Degree: 2015, Pontifical Catholic University of Rio de Janeiro

[pt] Segerberg apresentou uma prova geral da completude para lógicas proposicionais. Para tal, um sistema de dedução foi definido de forma que suas regras sejam… (more)

Subjects/Keywords: [pt] TEORIA DA PROVA; [en] PROOF THEORY; [pt] DEDUCAO NATURAL; [en] NATURAL DEDUCTION; [pt] CALCULO DE SEQUENTES; [en] SEQUENT CALCULUS; [pt] ISOMORFISMO; [en] ISOMORPHISM; [pt] PROVA GERAL DA COMPLETUDE; [en] GENERAL COMPLETENESS PROOF; [pt] LOGICA PROPOSICIONAL FINITO-VALORADA; [en] FINITE-VALUED PROPOSITIONAL LOGIC

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

LUSTOSA, C. R. E. (2015). [en] ON SOME RELATIONS BETWEEN NATURAL DEDUCTION AND SEQUENT CALCULUS. (Thesis). Pontifical Catholic University of Rio de Janeiro. Retrieved from http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=24302

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

LUSTOSA, CECILIA REIS ENGLANDER. “[en] ON SOME RELATIONS BETWEEN NATURAL DEDUCTION AND SEQUENT CALCULUS.” 2015. Thesis, Pontifical Catholic University of Rio de Janeiro. Accessed November 29, 2020. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=24302.

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

MLA Handbook (7th Edition):

LUSTOSA, CECILIA REIS ENGLANDER. “[en] ON SOME RELATIONS BETWEEN NATURAL DEDUCTION AND SEQUENT CALCULUS.” 2015. Web. 29 Nov 2020.

Vancouver:

LUSTOSA CRE. [en] ON SOME RELATIONS BETWEEN NATURAL DEDUCTION AND SEQUENT CALCULUS. [Internet] [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2015. [cited 2020 Nov 29]. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=24302.

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

Council of Science Editors:

LUSTOSA CRE. [en] ON SOME RELATIONS BETWEEN NATURAL DEDUCTION AND SEQUENT CALCULUS. [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2015. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=24302

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


NSYSU

3. Lin, Yui-Kai. Efficient Mining Approaches for Coherent Association Rules.

Degree: Master, Computer Science and Engineering, 2012, NSYSU

 The goal of data mining is to help market managers find relationships among items from large datasets to increase profits. Among the mining techniques, the… (more)

Subjects/Keywords: projection; coherent rules; propositional logic; association rules; data mining

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lin, Y. (2012). Efficient Mining Approaches for Coherent Association Rules. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0829112-165931

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

Lin, Yui-Kai. “Efficient Mining Approaches for Coherent Association Rules.” 2012. Thesis, NSYSU. Accessed November 29, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0829112-165931.

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

MLA Handbook (7th Edition):

Lin, Yui-Kai. “Efficient Mining Approaches for Coherent Association Rules.” 2012. Web. 29 Nov 2020.

Vancouver:

Lin Y. Efficient Mining Approaches for Coherent Association Rules. [Internet] [Thesis]. NSYSU; 2012. [cited 2020 Nov 29]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0829112-165931.

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

Council of Science Editors:

Lin Y. Efficient Mining Approaches for Coherent Association Rules. [Thesis]. NSYSU; 2012. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0829112-165931

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

4. Al-Saedi, Mohammad Saleh Balasim. Extensions of tractable classes for propositional satisfiability : Extensions de classes polynomiales pour le problème de satisfaisabilité.

Degree: Docteur es, Informatique, 2016, Université d'Artois

La représentation des connaissances et les problèmes d’inférence associés restent à l’heure actuelle une problématique riche et centrale en informatique et plus précisément en intelligence… (more)

Subjects/Keywords: Logique propositionnelle; SAT; Classes polynomiales; Propositional logic; SAT; Tractable classes; 006.3

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Al-Saedi, M. S. B. (2016). Extensions of tractable classes for propositional satisfiability : Extensions de classes polynomiales pour le problème de satisfaisabilité. (Doctoral Dissertation). Université d'Artois. Retrieved from http://www.theses.fr/2016ARTO0405

Chicago Manual of Style (16th Edition):

Al-Saedi, Mohammad Saleh Balasim. “Extensions of tractable classes for propositional satisfiability : Extensions de classes polynomiales pour le problème de satisfaisabilité.” 2016. Doctoral Dissertation, Université d'Artois. Accessed November 29, 2020. http://www.theses.fr/2016ARTO0405.

MLA Handbook (7th Edition):

Al-Saedi, Mohammad Saleh Balasim. “Extensions of tractable classes for propositional satisfiability : Extensions de classes polynomiales pour le problème de satisfaisabilité.” 2016. Web. 29 Nov 2020.

Vancouver:

Al-Saedi MSB. Extensions of tractable classes for propositional satisfiability : Extensions de classes polynomiales pour le problème de satisfaisabilité. [Internet] [Doctoral dissertation]. Université d'Artois; 2016. [cited 2020 Nov 29]. Available from: http://www.theses.fr/2016ARTO0405.

Council of Science Editors:

Al-Saedi MSB. Extensions of tractable classes for propositional satisfiability : Extensions de classes polynomiales pour le problème de satisfaisabilité. [Doctoral Dissertation]. Université d'Artois; 2016. Available from: http://www.theses.fr/2016ARTO0405


University of South Africa

5. Dixon, Scott Walton. The theory and pedagody of semantic inconsistency in critical reasoning .

Degree: 2018, University of South Africa

 One aspect of critical reasoning is the analysis and appraisal of claims and arguments. A typical problem, when analysing and appraising arguments, is inconsistent statements.… (more)

Subjects/Keywords: Inconsistency; Propositional logic; Critical reasoning; Semantic; Antonymic; Pedagogy; Defeasible; Translation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dixon, S. W. (2018). The theory and pedagody of semantic inconsistency in critical reasoning . (Doctoral Dissertation). University of South Africa. Retrieved from http://hdl.handle.net/10500/24927

Chicago Manual of Style (16th Edition):

Dixon, Scott Walton. “The theory and pedagody of semantic inconsistency in critical reasoning .” 2018. Doctoral Dissertation, University of South Africa. Accessed November 29, 2020. http://hdl.handle.net/10500/24927.

MLA Handbook (7th Edition):

Dixon, Scott Walton. “The theory and pedagody of semantic inconsistency in critical reasoning .” 2018. Web. 29 Nov 2020.

Vancouver:

Dixon SW. The theory and pedagody of semantic inconsistency in critical reasoning . [Internet] [Doctoral dissertation]. University of South Africa; 2018. [cited 2020 Nov 29]. Available from: http://hdl.handle.net/10500/24927.

Council of Science Editors:

Dixon SW. The theory and pedagody of semantic inconsistency in critical reasoning . [Doctoral Dissertation]. University of South Africa; 2018. Available from: http://hdl.handle.net/10500/24927

6. Runyon, Christopher R. Individual differences and basic logic ability.

Degree: 2012, James Madison University

 The study of reasoning and information processing in cognitive science has often used problems derived from classical propositional logic inference rules in order to see… (more)

Subjects/Keywords: propositional logic; reasoning; dual process theory; information processing; deduction; Psychology

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Runyon, C. R. (2012). Individual differences and basic logic ability. (Masters Thesis). James Madison University. Retrieved from https://commons.lib.jmu.edu/master201019/308

Chicago Manual of Style (16th Edition):

Runyon, Christopher R. “Individual differences and basic logic ability.” 2012. Masters Thesis, James Madison University. Accessed November 29, 2020. https://commons.lib.jmu.edu/master201019/308.

MLA Handbook (7th Edition):

Runyon, Christopher R. “Individual differences and basic logic ability.” 2012. Web. 29 Nov 2020.

Vancouver:

Runyon CR. Individual differences and basic logic ability. [Internet] [Masters thesis]. James Madison University; 2012. [cited 2020 Nov 29]. Available from: https://commons.lib.jmu.edu/master201019/308.

Council of Science Editors:

Runyon CR. Individual differences and basic logic ability. [Masters Thesis]. James Madison University; 2012. Available from: https://commons.lib.jmu.edu/master201019/308


University of Bath

7. 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 November 29, 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. 29 Nov 2020.

Vancouver:

Ralph B. Modular normalisation of classical proofs. [Internet] [Doctoral dissertation]. University of Bath; 2019. [cited 2020 Nov 29]. 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


Brno University of Technology

8. Troška, Karol. BDD knihovna: A BDD Library.

Degree: 2020, Brno University of Technology

 Binary decision program is a data structure used in many areas of information technology. This thesis describes BDD as a mathematical formalism and proposes possible… (more)

Subjects/Keywords: Binární rozhodovací diagram; logická funkce; logická proměnná; výroková logika.; Binary decision diagram; logic function; logic variable; propositional logic.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Troška, K. (2020). BDD knihovna: A BDD Library. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/189722

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

Troška, Karol. “BDD knihovna: A BDD Library.” 2020. Thesis, Brno University of Technology. Accessed November 29, 2020. http://hdl.handle.net/11012/189722.

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

MLA Handbook (7th Edition):

Troška, Karol. “BDD knihovna: A BDD Library.” 2020. Web. 29 Nov 2020.

Vancouver:

Troška K. BDD knihovna: A BDD Library. [Internet] [Thesis]. Brno University of Technology; 2020. [cited 2020 Nov 29]. Available from: http://hdl.handle.net/11012/189722.

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

Council of Science Editors:

Troška K. BDD knihovna: A BDD Library. [Thesis]. Brno University of Technology; 2020. Available from: http://hdl.handle.net/11012/189722

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


Brno University of Technology

9. Troška, Karol. BDD knihovna: A BDD Library.

Degree: 2018, Brno University of Technology

 Binary decision program is a data structure used in many areas of information technology. This thesis describes BDD as a mathematical formalism and proposes possible… (more)

Subjects/Keywords: Binární rozhodovací diagram; logická funkce; logická proměnná; výroková logika.; Binary decision diagram; logic function; logic variable; propositional logic.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Troška, K. (2018). BDD knihovna: A BDD Library. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/56405

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

Troška, Karol. “BDD knihovna: A BDD Library.” 2018. Thesis, Brno University of Technology. Accessed November 29, 2020. http://hdl.handle.net/11012/56405.

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

MLA Handbook (7th Edition):

Troška, Karol. “BDD knihovna: A BDD Library.” 2018. Web. 29 Nov 2020.

Vancouver:

Troška K. BDD knihovna: A BDD Library. [Internet] [Thesis]. Brno University of Technology; 2018. [cited 2020 Nov 29]. Available from: http://hdl.handle.net/11012/56405.

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

Council of Science Editors:

Troška K. BDD knihovna: A BDD Library. [Thesis]. Brno University of Technology; 2018. Available from: http://hdl.handle.net/11012/56405

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


Brno University of Technology

10. Troška, Karol. BDD knihovna: A BDD Library.

Degree: 2020, Brno University of Technology

 Binary decision program is a data structure used in many areas of information technology. This thesis describes BDD as a mathematical formalism and proposes possible… (more)

Subjects/Keywords: Binární rozhodovací diagram; logická funkce; logická proměnná; výroková logika.; Binary decision diagram; logic function; logic variable; propositional logic.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Troška, K. (2020). BDD knihovna: A BDD Library. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/188363

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

Troška, Karol. “BDD knihovna: A BDD Library.” 2020. Thesis, Brno University of Technology. Accessed November 29, 2020. http://hdl.handle.net/11012/188363.

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

MLA Handbook (7th Edition):

Troška, Karol. “BDD knihovna: A BDD Library.” 2020. Web. 29 Nov 2020.

Vancouver:

Troška K. BDD knihovna: A BDD Library. [Internet] [Thesis]. Brno University of Technology; 2020. [cited 2020 Nov 29]. Available from: http://hdl.handle.net/11012/188363.

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

Council of Science Editors:

Troška K. BDD knihovna: A BDD Library. [Thesis]. Brno University of Technology; 2020. Available from: http://hdl.handle.net/11012/188363

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

11. Rodrigo Costa Ferreira. Semântica proposicional categórica.

Degree: 2010, Universidade Federal da Paraíba

The basic concepts of what later became called category theory were introduced in 1945 by Samuel Eilenberg and Saunders Mac Lane. In 1940s, the main… (more)

Subjects/Keywords: Teoria das Categorias; Lógica Proposicional; Álgebra de Boole; FILOSOFIA; Category Theory; Propositional Logic; Boolean Algebra

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ferreira, R. C. (2010). Semântica proposicional categórica. (Thesis). Universidade Federal da Paraíba. Retrieved from http://bdtd.biblioteca.ufpb.br/tde_busca/arquivo.php?codArquivo=921

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

Ferreira, Rodrigo Costa. “Semântica proposicional categórica.” 2010. Thesis, Universidade Federal da Paraíba. Accessed November 29, 2020. http://bdtd.biblioteca.ufpb.br/tde_busca/arquivo.php?codArquivo=921.

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

MLA Handbook (7th Edition):

Ferreira, Rodrigo Costa. “Semântica proposicional categórica.” 2010. Web. 29 Nov 2020.

Vancouver:

Ferreira RC. Semântica proposicional categórica. [Internet] [Thesis]. Universidade Federal da Paraíba; 2010. [cited 2020 Nov 29]. Available from: http://bdtd.biblioteca.ufpb.br/tde_busca/arquivo.php?codArquivo=921.

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

Council of Science Editors:

Ferreira RC. Semântica proposicional categórica. [Thesis]. Universidade Federal da Paraíba; 2010. Available from: http://bdtd.biblioteca.ufpb.br/tde_busca/arquivo.php?codArquivo=921

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

12. Davies, Jessica. Solving MAXSAT by Decoupling Optimization and Satisfaction.

Degree: 2013, University of Toronto

Many problems that arise in the real world are difficult to solve partly because they present computational challenges. Many of these challenging problems are optimization… (more)

Subjects/Keywords: Combinatorial optimization; Propositional logic; Maximum satisfiability; Weighted constraints; Integer programming; Satisfiability; 0984; 0800; 0796

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Davies, J. (2013). Solving MAXSAT by Decoupling Optimization and Satisfaction. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/43539

Chicago Manual of Style (16th Edition):

Davies, Jessica. “Solving MAXSAT by Decoupling Optimization and Satisfaction.” 2013. Doctoral Dissertation, University of Toronto. Accessed November 29, 2020. http://hdl.handle.net/1807/43539.

MLA Handbook (7th Edition):

Davies, Jessica. “Solving MAXSAT by Decoupling Optimization and Satisfaction.” 2013. Web. 29 Nov 2020.

Vancouver:

Davies J. Solving MAXSAT by Decoupling Optimization and Satisfaction. [Internet] [Doctoral dissertation]. University of Toronto; 2013. [cited 2020 Nov 29]. Available from: http://hdl.handle.net/1807/43539.

Council of Science Editors:

Davies J. Solving MAXSAT by Decoupling Optimization and Satisfaction. [Doctoral Dissertation]. University of Toronto; 2013. Available from: http://hdl.handle.net/1807/43539


Brno University of Technology

13. 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 November 29, 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. 29 Nov 2020.

Vancouver:

Mazánek M. Automatický theorem prover: An Automatic Theorem Prover. [Internet] [Thesis]. Brno University of Technology; 2020. [cited 2020 Nov 29]. 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


Pontifical Catholic University of Rio de Janeiro

14. VASTON GONCALVES DA COSTA. [en] LOGIC PROOFS COMPACTATION.

Degree: 2007, Pontifical Catholic University of Rio de Janeiro

[pt] É um fato conhecido que provas clássicas podem ser demasiadamente grandes. Estudos em teoria da prova descobriram diferenças exponenciais entre provas normais (ou provas… (more)

Subjects/Keywords: [pt] TEORIA DA PROVA; [en] PROOF THEORY; [pt] DEDUCAO NATURAL; [en] NATURAL DEDUCTION; [pt] COMPLEXIDADE DE PROVAS; [en] PROOF COMPLEXITY; [pt] CALCULO DE SEQUENCIAS; [en] SEQUENT CALCULUS; [pt] LOGICA PROPOSICIONAL; [en] PROPOSITIONAL LOGIC

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

COSTA, V. G. D. (2007). [en] LOGIC PROOFS COMPACTATION. (Thesis). Pontifical Catholic University of Rio de Janeiro. Retrieved from http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=10018

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

COSTA, VASTON GONCALVES DA. “[en] LOGIC PROOFS COMPACTATION.” 2007. Thesis, Pontifical Catholic University of Rio de Janeiro. Accessed November 29, 2020. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=10018.

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

MLA Handbook (7th Edition):

COSTA, VASTON GONCALVES DA. “[en] LOGIC PROOFS COMPACTATION.” 2007. Web. 29 Nov 2020.

Vancouver:

COSTA VGD. [en] LOGIC PROOFS COMPACTATION. [Internet] [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2007. [cited 2020 Nov 29]. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=10018.

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

Council of Science Editors:

COSTA VGD. [en] LOGIC PROOFS COMPACTATION. [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2007. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=10018

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

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

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 November 29, 2020. http://hdl.handle.net/10889/5311.

MLA Handbook (7th Edition):

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

Vancouver:

Καραμουτζογιάννη . Επαγωγικός λογικός προγραμματισμός : μια διδακτική προσέγγιση. [Internet] [Masters thesis]. University of Patras; 2011. [cited 2020 Nov 29]. 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

16. Falcão, Pedro Alonso Amaral. Aspectos da teoria de funções modais.

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

Apresentamos alguns aspectos da teoria de funções modais, que é o correlato modal da teoria de funções de verdade. Enquanto as fórmulas da lógica proposicional… (more)

Subjects/Keywords: Completude funcional; Funções modais; Functional completeness; Lógica proposicional modal (S5); Modal functions; Modal propositional logic (S5)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Falcão, P. A. A. (2012). Aspectos da teoria de funções modais. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/8/8133/tde-11042013-104549/ ;

Chicago Manual of Style (16th Edition):

Falcão, Pedro Alonso Amaral. “Aspectos da teoria de funções modais.” 2012. Masters Thesis, University of São Paulo. Accessed November 29, 2020. http://www.teses.usp.br/teses/disponiveis/8/8133/tde-11042013-104549/ ;.

MLA Handbook (7th Edition):

Falcão, Pedro Alonso Amaral. “Aspectos da teoria de funções modais.” 2012. Web. 29 Nov 2020.

Vancouver:

Falcão PAA. Aspectos da teoria de funções modais. [Internet] [Masters thesis]. University of São Paulo; 2012. [cited 2020 Nov 29]. Available from: http://www.teses.usp.br/teses/disponiveis/8/8133/tde-11042013-104549/ ;.

Council of Science Editors:

Falcão PAA. Aspectos da teoria de funções modais. [Masters Thesis]. University of São Paulo; 2012. Available from: http://www.teses.usp.br/teses/disponiveis/8/8133/tde-11042013-104549/ ;


University of South Africa

17. Van der Vyver, Thelma. Proof systems for propositional modal logic .

Degree: 1997, University of South Africa

 In classical propositional logic (CPL) logical reasoning is formalised as logical entailment and can be computed by means of tableau and resolution proof procedures. Unfortunately… (more)

Subjects/Keywords: Classical propositional logic; Propositional modal logic; Resolution proof systems; Tableau proof systems; Local logical entailment; Global logical entailment

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Van der Vyver, T. (1997). Proof systems for propositional modal logic . (Masters Thesis). University of South Africa. Retrieved from http://hdl.handle.net/10500/16280

Chicago Manual of Style (16th Edition):

Van der Vyver, Thelma. “Proof systems for propositional modal logic .” 1997. Masters Thesis, University of South Africa. Accessed November 29, 2020. http://hdl.handle.net/10500/16280.

MLA Handbook (7th Edition):

Van der Vyver, Thelma. “Proof systems for propositional modal logic .” 1997. Web. 29 Nov 2020.

Vancouver:

Van der Vyver T. Proof systems for propositional modal logic . [Internet] [Masters thesis]. University of South Africa; 1997. [cited 2020 Nov 29]. Available from: http://hdl.handle.net/10500/16280.

Council of Science Editors:

Van der Vyver T. Proof systems for propositional modal logic . [Masters Thesis]. University of South Africa; 1997. Available from: http://hdl.handle.net/10500/16280


Univerzitet u Beogradu

18. Boričić, Marija, 1987-. Вероватносни рачуни секвената и класификација некласичних логика заснована на ентропији.

Degree: Matematički fakultet, 2018, Univerzitet u Beogradu

Математика - Математичка логика / Mathematics - Mathematical logic

После кратког уводног прегледа, рад је подељен на два дела. Први део се бави присуством вероватноће… (more)

Subjects/Keywords: probability logic; sequent calculus; model; soundness; completeness; non–classical logics; fuzzy logics; cut–elimination; classical two–valued propositional logic; many– valued propositional logics; Lindenbaum–Tarski algebra; partition; logical system; uncertainty measurement; entropy; classification

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Boričić, Marija, 1. (2018). Вероватносни рачуни секвената и класификација некласичних логика заснована на ентропији. (Thesis). Univerzitet u Beogradu. Retrieved from https://fedorabg.bg.ac.rs/fedora/get/o:15313/bdef:Content/get

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

Boričić, Marija, 1987-. “Вероватносни рачуни секвената и класификација некласичних логика заснована на ентропији.” 2018. Thesis, Univerzitet u Beogradu. Accessed November 29, 2020. https://fedorabg.bg.ac.rs/fedora/get/o:15313/bdef:Content/get.

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

MLA Handbook (7th Edition):

Boričić, Marija, 1987-. “Вероватносни рачуни секвената и класификација некласичних логика заснована на ентропији.” 2018. Web. 29 Nov 2020.

Vancouver:

Boričić, Marija 1. Вероватносни рачуни секвената и класификација некласичних логика заснована на ентропији. [Internet] [Thesis]. Univerzitet u Beogradu; 2018. [cited 2020 Nov 29]. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:15313/bdef:Content/get.

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

Council of Science Editors:

Boričić, Marija 1. Вероватносни рачуни секвената и класификација некласичних логика заснована на ентропији. [Thesis]. Univerzitet u Beogradu; 2018. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:15313/bdef:Content/get

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


Université de Grenoble

19. Abdulahhad, Karam. Information retrieval modeling by logic and lattice : application to conceptual information retrieval : Modélisation de la recherche d'information par la logique et les treillis : application à la recherche d'information conceptuelle.

Degree: Docteur es, Informatique, 2014, Université de Grenoble

 Cette thèse se situe dans le contexte des modèles logique de Recherche d'Information (RI). Le travail présenté dans la thèse est principalement motivé par l'inexactitude… (more)

Subjects/Keywords: Recherche d'Information; Modèles logiques; Logique propositionnelle; Treillis; RI conceptuelle; Exhaustivité et spécificité; Information retrieval; Logic-based models; Propositional logic; Lattice theory; Conceptual IR; Exhaustivity and specificity; 004

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Abdulahhad, K. (2014). Information retrieval modeling by logic and lattice : application to conceptual information retrieval : Modélisation de la recherche d'information par la logique et les treillis : application à la recherche d'information conceptuelle. (Doctoral Dissertation). Université de Grenoble. Retrieved from http://www.theses.fr/2014GRENM014

Chicago Manual of Style (16th Edition):

Abdulahhad, Karam. “Information retrieval modeling by logic and lattice : application to conceptual information retrieval : Modélisation de la recherche d'information par la logique et les treillis : application à la recherche d'information conceptuelle.” 2014. Doctoral Dissertation, Université de Grenoble. Accessed November 29, 2020. http://www.theses.fr/2014GRENM014.

MLA Handbook (7th Edition):

Abdulahhad, Karam. “Information retrieval modeling by logic and lattice : application to conceptual information retrieval : Modélisation de la recherche d'information par la logique et les treillis : application à la recherche d'information conceptuelle.” 2014. Web. 29 Nov 2020.

Vancouver:

Abdulahhad K. Information retrieval modeling by logic and lattice : application to conceptual information retrieval : Modélisation de la recherche d'information par la logique et les treillis : application à la recherche d'information conceptuelle. [Internet] [Doctoral dissertation]. Université de Grenoble; 2014. [cited 2020 Nov 29]. Available from: http://www.theses.fr/2014GRENM014.

Council of Science Editors:

Abdulahhad K. Information retrieval modeling by logic and lattice : application to conceptual information retrieval : Modélisation de la recherche d'information par la logique et les treillis : application à la recherche d'information conceptuelle. [Doctoral Dissertation]. Université de Grenoble; 2014. Available from: http://www.theses.fr/2014GRENM014

20. Cyriac, Aiswarya. Verification of communicating recursive programs via split-width : Vérification de programmes récursifs et communicants via split-width.

Degree: Docteur es, Informatique, 2014, Cachan, Ecole normale supérieure

Cette thèse développe des techniques à base d'automates pour la vérification formelle de systèmes physiquement distribués communiquant via des canaux fiables de tailles non bornées.… (more)

Subjects/Keywords: Systèmes concurrents; Contrôleurs distribués; Vérification; Concurrent systems; Distributed controllers; Model checking; Monadic second-order logic; Propositional dynamic logic; Split-width; Under-approximate verification

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cyriac, A. (2014). Verification of communicating recursive programs via split-width : Vérification de programmes récursifs et communicants via split-width. (Doctoral Dissertation). Cachan, Ecole normale supérieure. Retrieved from http://www.theses.fr/2014DENS0004

Chicago Manual of Style (16th Edition):

Cyriac, Aiswarya. “Verification of communicating recursive programs via split-width : Vérification de programmes récursifs et communicants via split-width.” 2014. Doctoral Dissertation, Cachan, Ecole normale supérieure. Accessed November 29, 2020. http://www.theses.fr/2014DENS0004.

MLA Handbook (7th Edition):

Cyriac, Aiswarya. “Verification of communicating recursive programs via split-width : Vérification de programmes récursifs et communicants via split-width.” 2014. Web. 29 Nov 2020.

Vancouver:

Cyriac A. Verification of communicating recursive programs via split-width : Vérification de programmes récursifs et communicants via split-width. [Internet] [Doctoral dissertation]. Cachan, Ecole normale supérieure; 2014. [cited 2020 Nov 29]. Available from: http://www.theses.fr/2014DENS0004.

Council of Science Editors:

Cyriac A. Verification of communicating recursive programs via split-width : Vérification de programmes récursifs et communicants via split-width. [Doctoral Dissertation]. Cachan, Ecole normale supérieure; 2014. Available from: http://www.theses.fr/2014DENS0004


Australian National University

21. Slater, Andrew. Investigations into Satisfiability Search .

Degree: 2004, Australian National University

 In this dissertation we investigate theoretical aspects of some practical approaches used in solving and understanding search problems. We concentrate on the Satisfiability problem, which… (more)

Subjects/Keywords: search algorithms; satisfiability; SAT; propositional logic; relevant logic; search problems; artificial intelligence; AI

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Slater, A. (2004). Investigations into Satisfiability Search . (Thesis). Australian National University. Retrieved from http://hdl.handle.net/1885/48193

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

Slater, Andrew. “Investigations into Satisfiability Search .” 2004. Thesis, Australian National University. Accessed November 29, 2020. http://hdl.handle.net/1885/48193.

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

MLA Handbook (7th Edition):

Slater, Andrew. “Investigations into Satisfiability Search .” 2004. Web. 29 Nov 2020.

Vancouver:

Slater A. Investigations into Satisfiability Search . [Internet] [Thesis]. Australian National University; 2004. [cited 2020 Nov 29]. Available from: http://hdl.handle.net/1885/48193.

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

Council of Science Editors:

Slater A. Investigations into Satisfiability Search . [Thesis]. Australian National University; 2004. Available from: http://hdl.handle.net/1885/48193

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


University of Melbourne

22. Kubicki, Stephen. A (partial) defense of the possible worlds account of content.

Degree: 2010, University of Melbourne

 I am attracted to the view that the content of a propositional attitude or a speech act is a set of metaphysically possible worlds. This… (more)

Subjects/Keywords: philosophy of language; intentionality; proposition (logic); modality (logic); semantics; pragmatics; propositional attitudes

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kubicki, S. (2010). A (partial) defense of the possible worlds account of content. (Masters Thesis). University of Melbourne. Retrieved from http://hdl.handle.net/11343/35522

Chicago Manual of Style (16th Edition):

Kubicki, Stephen. “A (partial) defense of the possible worlds account of content.” 2010. Masters Thesis, University of Melbourne. Accessed November 29, 2020. http://hdl.handle.net/11343/35522.

MLA Handbook (7th Edition):

Kubicki, Stephen. “A (partial) defense of the possible worlds account of content.” 2010. Web. 29 Nov 2020.

Vancouver:

Kubicki S. A (partial) defense of the possible worlds account of content. [Internet] [Masters thesis]. University of Melbourne; 2010. [cited 2020 Nov 29]. Available from: http://hdl.handle.net/11343/35522.

Council of Science Editors:

Kubicki S. A (partial) defense of the possible worlds account of content. [Masters Thesis]. University of Melbourne; 2010. Available from: http://hdl.handle.net/11343/35522

23. Alves, Carla. Lógica e álgebras booleanas.

Degree: 2002, Instituto Politécnico de Bragança

 O principal objectivo deste trabalho consistiu em investigar e aprofundar os conhecimentos na área da Lógica clássica “booleana” e suas álgebras. Nesse sentido desenvolveu-se um… (more)

Subjects/Keywords: Lógica; Cálculo proposicional; Álgebras booleanas; Logic; Propositional calculus; Boolean algebras

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Alves, C. (2002). Lógica e álgebras booleanas. (Thesis). Instituto Politécnico de Bragança. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:bibliotecadigital.ipb.pt:10198/4537

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

Alves, Carla. “Lógica e álgebras booleanas.” 2002. Thesis, Instituto Politécnico de Bragança. Accessed November 29, 2020. http://www.rcaap.pt/detail.jsp?id=oai:bibliotecadigital.ipb.pt:10198/4537.

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

MLA Handbook (7th Edition):

Alves, Carla. “Lógica e álgebras booleanas.” 2002. Web. 29 Nov 2020.

Vancouver:

Alves C. Lógica e álgebras booleanas. [Internet] [Thesis]. Instituto Politécnico de Bragança; 2002. [cited 2020 Nov 29]. Available from: http://www.rcaap.pt/detail.jsp?id=oai:bibliotecadigital.ipb.pt:10198/4537.

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

Council of Science Editors:

Alves C. Lógica e álgebras booleanas. [Thesis]. Instituto Politécnico de Bragança; 2002. Available from: http://www.rcaap.pt/detail.jsp?id=oai:bibliotecadigital.ipb.pt:10198/4537

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

24. Cintia Carvalho Oliveira. Árvore de Características e Redes de Petri Colorida com Expressões de Lógica Proposicional: Propostas de Modelagem de Requisitos e Fluxo de Navegação.

Degree: 2011, Federal University of Uberlândia

Geralmente, a análise de requisitos é feita por proposições ad hoc de especialistas. O personagem que detém o conhecimento a respeito do domínio a ser… (more)

Subjects/Keywords: CIENCIA DA COMPUTACAO; Elicitação de requisitos; Modelagem de interface; Redes de petri; Lógica proposicional; Interação humano-computador; Requirements elicitation; Modeling interface; Petri net; Propositional logic; Human-computer interaction

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Oliveira, C. C. (2011). Árvore de Características e Redes de Petri Colorida com Expressões de Lógica Proposicional: Propostas de Modelagem de Requisitos e Fluxo de Navegação. (Thesis). Federal University of Uberlândia. Retrieved from http://www.bdtd.ufu.br//tde_busca/arquivo.php?codArquivo=3673

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

Oliveira, Cintia Carvalho. “Árvore de Características e Redes de Petri Colorida com Expressões de Lógica Proposicional: Propostas de Modelagem de Requisitos e Fluxo de Navegação.” 2011. Thesis, Federal University of Uberlândia. Accessed November 29, 2020. http://www.bdtd.ufu.br//tde_busca/arquivo.php?codArquivo=3673.

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

MLA Handbook (7th Edition):

Oliveira, Cintia Carvalho. “Árvore de Características e Redes de Petri Colorida com Expressões de Lógica Proposicional: Propostas de Modelagem de Requisitos e Fluxo de Navegação.” 2011. Web. 29 Nov 2020.

Vancouver:

Oliveira CC. Árvore de Características e Redes de Petri Colorida com Expressões de Lógica Proposicional: Propostas de Modelagem de Requisitos e Fluxo de Navegação. [Internet] [Thesis]. Federal University of Uberlândia; 2011. [cited 2020 Nov 29]. Available from: http://www.bdtd.ufu.br//tde_busca/arquivo.php?codArquivo=3673.

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

Council of Science Editors:

Oliveira CC. Árvore de Características e Redes de Petri Colorida com Expressões de Lógica Proposicional: Propostas de Modelagem de Requisitos e Fluxo de Navegação. [Thesis]. Federal University of Uberlândia; 2011. Available from: http://www.bdtd.ufu.br//tde_busca/arquivo.php?codArquivo=3673

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


Université Paris-Sud – Paris XI

25. Armant, Vincent. Diagnostic distribué de systèmes respectant la confidentialité : Distributed diagnosis of systems respecting privacy.

Degree: Docteur es, Informatique, 2012, Université Paris-Sud – Paris XI

Dans cette thèse, nous nous intéressons à diagnostiquer des systèmes intrinsèquement distribués (comme les systèmes pairs-à-pairs) où chaque pair n'a accès qu'à une sous partie… (more)

Subjects/Keywords: Diagnostic distribué à base de cohérence; Logique propositionnelle; Raisonnement distribué respectant la confidentialité; Décomposition arborescente distribuée; Distributed consistency based diagnosis; Propositional logic; Distributed reasoning respecting privacy; Distributed tree decomposition

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Armant, V. (2012). Diagnostic distribué de systèmes respectant la confidentialité : Distributed diagnosis of systems respecting privacy. (Doctoral Dissertation). Université Paris-Sud – Paris XI. Retrieved from http://www.theses.fr/2012PA112197

Chicago Manual of Style (16th Edition):

Armant, Vincent. “Diagnostic distribué de systèmes respectant la confidentialité : Distributed diagnosis of systems respecting privacy.” 2012. Doctoral Dissertation, Université Paris-Sud – Paris XI. Accessed November 29, 2020. http://www.theses.fr/2012PA112197.

MLA Handbook (7th Edition):

Armant, Vincent. “Diagnostic distribué de systèmes respectant la confidentialité : Distributed diagnosis of systems respecting privacy.” 2012. Web. 29 Nov 2020.

Vancouver:

Armant V. Diagnostic distribué de systèmes respectant la confidentialité : Distributed diagnosis of systems respecting privacy. [Internet] [Doctoral dissertation]. Université Paris-Sud – Paris XI; 2012. [cited 2020 Nov 29]. Available from: http://www.theses.fr/2012PA112197.

Council of Science Editors:

Armant V. Diagnostic distribué de systèmes respectant la confidentialité : Distributed diagnosis of systems respecting privacy. [Doctoral Dissertation]. Université Paris-Sud – Paris XI; 2012. Available from: http://www.theses.fr/2012PA112197

26. Caridroit, Thomas. Changement de croyances et logiques modales : Belief change and modal logics.

Degree: Docteur es, Informatique, 2016, Université d'Artois

Le changement de croyances vise à trouver des moyens adéquats pour faire évoluer les croyances d'un agent lorsqu'il est confronté à de nouvelles informations. Dans… (more)

Subjects/Keywords: Changement de croyances; Logique propositionnelle; Représentation des connaissances; Système multi-agents; Belief change; Propositional logic; Knowledge representation; Multi-agent systems; Epistemic models; Distance computation; 006.3

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Caridroit, T. (2016). Changement de croyances et logiques modales : Belief change and modal logics. (Doctoral Dissertation). Université d'Artois. Retrieved from http://www.theses.fr/2016ARTO0402

Chicago Manual of Style (16th Edition):

Caridroit, Thomas. “Changement de croyances et logiques modales : Belief change and modal logics.” 2016. Doctoral Dissertation, Université d'Artois. Accessed November 29, 2020. http://www.theses.fr/2016ARTO0402.

MLA Handbook (7th Edition):

Caridroit, Thomas. “Changement de croyances et logiques modales : Belief change and modal logics.” 2016. Web. 29 Nov 2020.

Vancouver:

Caridroit T. Changement de croyances et logiques modales : Belief change and modal logics. [Internet] [Doctoral dissertation]. Université d'Artois; 2016. [cited 2020 Nov 29]. Available from: http://www.theses.fr/2016ARTO0402.

Council of Science Editors:

Caridroit T. Changement de croyances et logiques modales : Belief change and modal logics. [Doctoral Dissertation]. Université d'Artois; 2016. Available from: http://www.theses.fr/2016ARTO0402

27. Curiel Diaz, Arturo Tlacaélel. Using formal logic to represent sign language phonetics in semi-automatic annotation tasks : Using formal logic to represent sign language phonetics in semi-automatic annotation tasks.

Degree: Docteur es, Image, information, hypermedia, 2015, Université Toulouse III – Paul Sabatier

 Cette thèse présente le développement d'un framework formel pour la représentation des Langues de Signes (LS), les langages des communautés Sourdes, dans le cadre de… (more)

Subjects/Keywords: Langue des signes; Logique propositionnelle dynamique; Annotation automatique; Traitement automatique du langage naturel; Sign Language; Propositional Dynamic Logic; Automatic Annotation; Natural Language Processing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Curiel Diaz, A. T. (2015). Using formal logic to represent sign language phonetics in semi-automatic annotation tasks : Using formal logic to represent sign language phonetics in semi-automatic annotation tasks. (Doctoral Dissertation). Université Toulouse III – Paul Sabatier. Retrieved from http://www.theses.fr/2015TOU30308

Chicago Manual of Style (16th Edition):

Curiel Diaz, Arturo Tlacaélel. “Using formal logic to represent sign language phonetics in semi-automatic annotation tasks : Using formal logic to represent sign language phonetics in semi-automatic annotation tasks.” 2015. Doctoral Dissertation, Université Toulouse III – Paul Sabatier. Accessed November 29, 2020. http://www.theses.fr/2015TOU30308.

MLA Handbook (7th Edition):

Curiel Diaz, Arturo Tlacaélel. “Using formal logic to represent sign language phonetics in semi-automatic annotation tasks : Using formal logic to represent sign language phonetics in semi-automatic annotation tasks.” 2015. Web. 29 Nov 2020.

Vancouver:

Curiel Diaz AT. Using formal logic to represent sign language phonetics in semi-automatic annotation tasks : Using formal logic to represent sign language phonetics in semi-automatic annotation tasks. [Internet] [Doctoral dissertation]. Université Toulouse III – Paul Sabatier; 2015. [cited 2020 Nov 29]. Available from: http://www.theses.fr/2015TOU30308.

Council of Science Editors:

Curiel Diaz AT. Using formal logic to represent sign language phonetics in semi-automatic annotation tasks : Using formal logic to represent sign language phonetics in semi-automatic annotation tasks. [Doctoral Dissertation]. Université Toulouse III – Paul Sabatier; 2015. Available from: http://www.theses.fr/2015TOU30308

28. Boudou, Joseph. Procédures de décision pour des logiques modales d'actions, de ressources et de concurrence : Decision procedures for modal logics of actions, resources and concurrency.

Degree: Docteur es, Intelligence artificielle, 2016, Université Toulouse III – Paul Sabatier

 Les concepts d'action et de ressource sont omniprésents en informatique. La caractéristique principale d'une action est de changer l'état actuel du système modélisé. Une action… (more)

Subjects/Keywords: Logiques modales; Décidabilité; Complexité; Expressivité; Procédures de décision; Logique dynamique propositionnelle; Logiques de séparation; Modalités binaires; Modal logics; Decidability; Complexity; Expressivity; Decision procedures; Propositional dynamic logic; Separation logics; Binary modalities

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Boudou, J. (2016). Procédures de décision pour des logiques modales d'actions, de ressources et de concurrence : Decision procedures for modal logics of actions, resources and concurrency. (Doctoral Dissertation). Université Toulouse III – Paul Sabatier. Retrieved from http://www.theses.fr/2016TOU30145

Chicago Manual of Style (16th Edition):

Boudou, Joseph. “Procédures de décision pour des logiques modales d'actions, de ressources et de concurrence : Decision procedures for modal logics of actions, resources and concurrency.” 2016. Doctoral Dissertation, Université Toulouse III – Paul Sabatier. Accessed November 29, 2020. http://www.theses.fr/2016TOU30145.

MLA Handbook (7th Edition):

Boudou, Joseph. “Procédures de décision pour des logiques modales d'actions, de ressources et de concurrence : Decision procedures for modal logics of actions, resources and concurrency.” 2016. Web. 29 Nov 2020.

Vancouver:

Boudou J. Procédures de décision pour des logiques modales d'actions, de ressources et de concurrence : Decision procedures for modal logics of actions, resources and concurrency. [Internet] [Doctoral dissertation]. Université Toulouse III – Paul Sabatier; 2016. [cited 2020 Nov 29]. Available from: http://www.theses.fr/2016TOU30145.

Council of Science Editors:

Boudou J. Procédures de décision pour des logiques modales d'actions, de ressources et de concurrence : Decision procedures for modal logics of actions, resources and concurrency. [Doctoral Dissertation]. Université Toulouse III – Paul Sabatier; 2016. Available from: http://www.theses.fr/2016TOU30145


Texas Tech University

29. Lin, Zhijun. Efficient SAT-based answer set solver.

Degree: Computer Science, 2007, Texas Tech University

 Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS… (more)

Subjects/Keywords: Answer set; Logic programming; Propositional satisfiability (SAT); Answer set programming (ASP)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lin, Z. (2007). Efficient SAT-based answer set solver. (Thesis). Texas Tech University. Retrieved from http://hdl.handle.net/2346/20592

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

Lin, Zhijun. “Efficient SAT-based answer set solver.” 2007. Thesis, Texas Tech University. Accessed November 29, 2020. http://hdl.handle.net/2346/20592.

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

MLA Handbook (7th Edition):

Lin, Zhijun. “Efficient SAT-based answer set solver.” 2007. Web. 29 Nov 2020.

Vancouver:

Lin Z. Efficient SAT-based answer set solver. [Internet] [Thesis]. Texas Tech University; 2007. [cited 2020 Nov 29]. Available from: http://hdl.handle.net/2346/20592.

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

Council of Science Editors:

Lin Z. Efficient SAT-based answer set solver. [Thesis]. Texas Tech University; 2007. Available from: http://hdl.handle.net/2346/20592

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


Euskal Herriko Unibertsitatea / Universidad del País Vasco

30. Gaintzarain Ibarmia, José. Invariant-free deduction systems for temporal logic .

Degree: 2012, Euskal Herriko Unibertsitatea / Universidad del País Vasco

 In this thesis we propose a new approach to deduction methods for temporal logic. Our proposal is based on an inductive definition of eventualities that… (more)

Subjects/Keywords: temporal logic; PLTL; temporal deduction; tableaux; temporal tableaux; sequent; sequent calculus; resolution; clausal resolution; clausal temporal resolution; one-pass tableau; invariant; invariant formula; eventuality; invariant-free; cut-free; invariant generation; logic programming; temporal logic programming; completeness; disjunctive logic programming; temporal disjunctive logic programming; finitary sequent system; invariant-free clausal temporal resolution; declarative temporal logic programming; operational semantics; logical semantics; dual tableaux and sequent systems; propositional linear-time temporal logic; fixpoint semantics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gaintzarain Ibarmia, J. (2012). Invariant-free deduction systems for temporal logic . (Doctoral Dissertation). Euskal Herriko Unibertsitatea / Universidad del País Vasco. Retrieved from http://hdl.handle.net/10810/10332

Chicago Manual of Style (16th Edition):

Gaintzarain Ibarmia, José. “Invariant-free deduction systems for temporal logic .” 2012. Doctoral Dissertation, Euskal Herriko Unibertsitatea / Universidad del País Vasco. Accessed November 29, 2020. http://hdl.handle.net/10810/10332.

MLA Handbook (7th Edition):

Gaintzarain Ibarmia, José. “Invariant-free deduction systems for temporal logic .” 2012. Web. 29 Nov 2020.

Vancouver:

Gaintzarain Ibarmia J. Invariant-free deduction systems for temporal logic . [Internet] [Doctoral dissertation]. Euskal Herriko Unibertsitatea / Universidad del País Vasco; 2012. [cited 2020 Nov 29]. Available from: http://hdl.handle.net/10810/10332.

Council of Science Editors:

Gaintzarain Ibarmia J. Invariant-free deduction systems for temporal logic . [Doctoral Dissertation]. Euskal Herriko Unibertsitatea / Universidad del País Vasco; 2012. Available from: http://hdl.handle.net/10810/10332

[1] [2] [3] [4] [5] … [1346]

.