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

[1] [2]

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


NSYSU

1. 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 September 22, 2019. 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. 22 Sep 2019.

Vancouver:

Lin Y. Efficient Mining Approaches for Coherent Association Rules. [Internet] [Thesis]. NSYSU; 2012. [cited 2019 Sep 22]. 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

2. 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 September 22, 2019. 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. 22 Sep 2019.

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 2019 Sep 22]. 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

3. 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 September 22, 2019. 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. 22 Sep 2019.

Vancouver:

Dixon SW. The theory and pedagody of semantic inconsistency in critical reasoning. [Internet] [Doctoral dissertation]. University of South Africa; 2018. [cited 2019 Sep 22]. 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


Pontifical Catholic University of Rio de Janeiro

4. 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 September 22, 2019. 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. 22 Sep 2019.

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 2019 Sep 22]. 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


University of Bath

5. 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: 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 22, 2019. 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. 22 Sep 2019.

Vancouver:

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

6. Troška, Karol. BDD knihovna .

Degree: 2014, Brno University of Technology

 Binární rozhodovací diagram je datová struktura využívaná v mnoha oblastech informatiky. Tato práce popisuje BDD ako matematický formalizmus a navrhuje možnou reprezentaci BDD v počítači.… (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. (2014). BDD knihovna . (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 .” 2014. Thesis, Brno University of Technology. Accessed September 22, 2019. 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 .” 2014. Web. 22 Sep 2019.

Vancouver:

Troška K. BDD knihovna . [Internet] [Thesis]. Brno University of Technology; 2014. [cited 2019 Sep 22]. 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 . [Thesis]. Brno University of Technology; 2014. 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

7. 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 September 22, 2019. 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. 22 Sep 2019.

Vancouver:

Ferreira RC. Semântica proposicional categórica. [Internet] [Thesis]. Universidade Federal da Paraíba; 2010. [cited 2019 Sep 22]. 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

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

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 22, 2019. http://hdl.handle.net/10889/5311.

MLA Handbook (7th Edition):

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

Vancouver:

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

9. 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 September 22, 2019. 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. 22 Sep 2019.

Vancouver:

Falcão PAA. Aspectos da teoria de funções modais. [Internet] [Masters thesis]. University of São Paulo; 2012. [cited 2019 Sep 22]. 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/ ;


Univerzitet u Beogradu

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

Degree: Matematički fakultet, 2017, 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. (2017). Вероватносни рачуни секвената и класификација некласичних логика заснована на ентропији. (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-. “Вероватносни рачуни секвената и класификација некласичних логика заснована на ентропији.” 2017. Thesis, Univerzitet u Beogradu. Accessed September 22, 2019. 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-. “Вероватносни рачуни секвената и класификација некласичних логика заснована на ентропији.” 2017. Web. 22 Sep 2019.

Vancouver:

Boričić, Marija 1. Вероватносни рачуни секвената и класификација некласичних логика заснована на ентропији. [Internet] [Thesis]. Univerzitet u Beogradu; 2017. [cited 2019 Sep 22]. 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; 2017. 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


University of South Africa

11. 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 September 22, 2019. http://hdl.handle.net/10500/16280.

MLA Handbook (7th Edition):

Van der Vyver, Thelma. “Proof systems for propositional modal logic.” 1997. Web. 22 Sep 2019.

Vancouver:

Van der Vyver T. Proof systems for propositional modal logic. [Internet] [Masters thesis]. University of South Africa; 1997. [cited 2019 Sep 22]. 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


Université de Grenoble

12. 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 September 22, 2019. 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. 22 Sep 2019.

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 2019 Sep 22]. 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

13. 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 September 22, 2019. 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. 22 Sep 2019.

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 2019 Sep 22]. 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

14. 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 September 22, 2019. 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. 22 Sep 2019.

Vancouver:

Slater A. Investigations into Satisfiability Search . [Internet] [Thesis]. Australian National University; 2004. [cited 2019 Sep 22]. 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

15. 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 September 22, 2019. 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. 22 Sep 2019.

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 2019 Sep 22]. 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

16. 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 September 22, 2019. 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. 22 Sep 2019.

Vancouver:

Alves C. Lógica e álgebras booleanas. [Internet] [Thesis]. Instituto Politécnico de Bragança; 2002. [cited 2019 Sep 22]. 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

17. 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 September 22, 2019. http://www.theses.fr/2016ARTO0402.

MLA Handbook (7th Edition):

Caridroit, Thomas. “Changement de croyances et logiques modales : Belief change and modal logics.” 2016. Web. 22 Sep 2019.

Vancouver:

Caridroit T. Changement de croyances et logiques modales : Belief change and modal logics. [Internet] [Doctoral dissertation]. Université d'Artois; 2016. [cited 2019 Sep 22]. 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


Université Paris-Sud – Paris XI

18. 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 September 22, 2019. 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. 22 Sep 2019.

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 2019 Sep 22]. 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

19. 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 September 22, 2019. 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. 22 Sep 2019.

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 2019 Sep 22]. 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

20. 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 September 22, 2019. 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. 22 Sep 2019.

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 2019 Sep 22]. 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


ETH Zürich

21. Lieberherr, Karl. Informationsverdichtung von Modellen in der Aussagenlogik und das P-NP-Problem.

Degree: 1977, ETH Zürich

Subjects/Keywords: AUSSAGENLOGIK (MATHEMATISCHE LOGIK); ENTSCHEIDUNGSPROBLEME (MATHEMATISCHE LOGIK); ALGORITHMISCHE KOMPLEXITÄT (MATHEMATIK); PROPOSITIONAL LOGIC (MATHEMATICAL LOGIC); DECISION PROBLEMS (MATHEMATICAL LOGIC); ALGORITHMIC COMPLEXITY (MATHEMATICS)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lieberherr, K. (1977). Informationsverdichtung von Modellen in der Aussagenlogik und das P-NP-Problem. (Doctoral Dissertation). ETH Zürich. Retrieved from http://hdl.handle.net/20.500.11850/135374

Chicago Manual of Style (16th Edition):

Lieberherr, Karl. “Informationsverdichtung von Modellen in der Aussagenlogik und das P-NP-Problem.” 1977. Doctoral Dissertation, ETH Zürich. Accessed September 22, 2019. http://hdl.handle.net/20.500.11850/135374.

MLA Handbook (7th Edition):

Lieberherr, Karl. “Informationsverdichtung von Modellen in der Aussagenlogik und das P-NP-Problem.” 1977. Web. 22 Sep 2019.

Vancouver:

Lieberherr K. Informationsverdichtung von Modellen in der Aussagenlogik und das P-NP-Problem. [Internet] [Doctoral dissertation]. ETH Zürich; 1977. [cited 2019 Sep 22]. Available from: http://hdl.handle.net/20.500.11850/135374.

Council of Science Editors:

Lieberherr K. Informationsverdichtung von Modellen in der Aussagenlogik und das P-NP-Problem. [Doctoral Dissertation]. ETH Zürich; 1977. Available from: http://hdl.handle.net/20.500.11850/135374


Euskal Herriko Unibertsitatea / Universidad del País Vasco

22. 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 September 22, 2019. http://hdl.handle.net/10810/10332.

MLA Handbook (7th Edition):

Gaintzarain Ibarmia, José. “Invariant-free deduction systems for temporal logic .” 2012. Web. 22 Sep 2019.

Vancouver:

Gaintzarain Ibarmia J. Invariant-free deduction systems for temporal logic . [Internet] [Doctoral dissertation]. Euskal Herriko Unibertsitatea / Universidad del País Vasco; 2012. [cited 2019 Sep 22]. 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


Brno University of Technology

23. Smetka, Tomáš. Vizualizace rezoluční metody .

Degree: 2013, Brno University of Technology

 Tato bakalářská práce se zabývá problematikou automatického dokazování ve výrokové a predikátové logice. V teoretické části je popsána výroková a predikátová logika v návaznosti na… (more)

Subjects/Keywords: Výroková logika; predikátová logika; automatické dokazování; rezoluční metoda; Robinsonův rezoluční princip; lexikální analýza; syntaktická analýza; prohledávání stavového prostoru; Propositional logic; predicate logic; automated reasoning; resolution method; Robinson's resolution principle; lexical analysis; syntactic analysis; state space searching

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Smetka, T. (2013). Vizualizace rezoluční metody . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/54795

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

Smetka, Tomáš. “Vizualizace rezoluční metody .” 2013. Thesis, Brno University of Technology. Accessed September 22, 2019. http://hdl.handle.net/11012/54795.

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

MLA Handbook (7th Edition):

Smetka, Tomáš. “Vizualizace rezoluční metody .” 2013. Web. 22 Sep 2019.

Vancouver:

Smetka T. Vizualizace rezoluční metody . [Internet] [Thesis]. Brno University of Technology; 2013. [cited 2019 Sep 22]. Available from: http://hdl.handle.net/11012/54795.

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

Council of Science Editors:

Smetka T. Vizualizace rezoluční metody . [Thesis]. Brno University of Technology; 2013. Available from: http://hdl.handle.net/11012/54795

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


Australian National University

24. Boskovitz, Agnes. Data Editing and Logic: The covering set method from the perspective of logic .

Degree: 2008, Australian National University

 Errors in collections of data can cause significant problems when those data are used. Therefore the owners of data find themselves spending much time on… (more)

Subjects/Keywords: data editing; data cleaning; propositional logic; propositional resolution; Fellegi-Holt; Field Code Forest Algorithm; error localisation; reduction property for counter-examples; lifting property

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Boskovitz, A. (2008). Data Editing and Logic: The covering set method from the perspective of logic . (Thesis). Australian National University. Retrieved from http://hdl.handle.net/1885/49318

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

Boskovitz, Agnes. “Data Editing and Logic: The covering set method from the perspective of logic .” 2008. Thesis, Australian National University. Accessed September 22, 2019. http://hdl.handle.net/1885/49318.

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

MLA Handbook (7th Edition):

Boskovitz, Agnes. “Data Editing and Logic: The covering set method from the perspective of logic .” 2008. Web. 22 Sep 2019.

Vancouver:

Boskovitz A. Data Editing and Logic: The covering set method from the perspective of logic . [Internet] [Thesis]. Australian National University; 2008. [cited 2019 Sep 22]. Available from: http://hdl.handle.net/1885/49318.

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

Council of Science Editors:

Boskovitz A. Data Editing and Logic: The covering set method from the perspective of logic . [Thesis]. Australian National University; 2008. Available from: http://hdl.handle.net/1885/49318

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


Université Paris-Sorbonne – Paris IV

25. Rieger schmidt, Ana. La primauté de l’étant et les premiers principes chez Gérard Odon : The primacy of being and the first principles in Geraldus Odonis.

Degree: Docteur es, Histoire de la philosophie médiévale, 2014, Université Paris-Sorbonne – Paris IV

Il s’agit d’une thèse sur le traité De duobus communissimis principiis scientiarum de Gérard Odon (vers 1320). Dans la première partie, nous faisons l’analyse du… (more)

Subjects/Keywords: Gérard Odon; Logique; Métaphysique; Principe de non-contradiction; Principe du tiers exclu; Proposition; Copule; Esse tertium adiacens; Réalisme propositionnel; Vérifacteur; Geraldus Odonis; Logic; Metaphysics; Principle of non-contradiction; Principle of the excluded middle; Proposition; Copula; Esse tertium adiacens; Propositional realism; Truthmaker; 100

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rieger schmidt, A. (2014). La primauté de l’étant et les premiers principes chez Gérard Odon : The primacy of being and the first principles in Geraldus Odonis. (Doctoral Dissertation). Université Paris-Sorbonne – Paris IV. Retrieved from http://www.theses.fr/2014PA040030

Chicago Manual of Style (16th Edition):

Rieger schmidt, Ana. “La primauté de l’étant et les premiers principes chez Gérard Odon : The primacy of being and the first principles in Geraldus Odonis.” 2014. Doctoral Dissertation, Université Paris-Sorbonne – Paris IV. Accessed September 22, 2019. http://www.theses.fr/2014PA040030.

MLA Handbook (7th Edition):

Rieger schmidt, Ana. “La primauté de l’étant et les premiers principes chez Gérard Odon : The primacy of being and the first principles in Geraldus Odonis.” 2014. Web. 22 Sep 2019.

Vancouver:

Rieger schmidt A. La primauté de l’étant et les premiers principes chez Gérard Odon : The primacy of being and the first principles in Geraldus Odonis. [Internet] [Doctoral dissertation]. Université Paris-Sorbonne – Paris IV; 2014. [cited 2019 Sep 22]. Available from: http://www.theses.fr/2014PA040030.

Council of Science Editors:

Rieger schmidt A. La primauté de l’étant et les premiers principes chez Gérard Odon : The primacy of being and the first principles in Geraldus Odonis. [Doctoral Dissertation]. Université Paris-Sorbonne – Paris IV; 2014. Available from: http://www.theses.fr/2014PA040030


Virginia Tech

26. Arora, Rajat. Enhancing SAT-based Formal Verification Methods using Global Learning.

Degree: MS, Electrical and Computer Engineering, 2004, Virginia Tech

 With the advances in VLSI and System-On-Chip (SOC) technology, the complexity of hardware systems has increased manifold. Today, 70% of the design cost is spent… (more)

Subjects/Keywords: Boolean Satisfiability (SAT); Static Logic Implications; Combinational Equivalence Checking (CEC); Bounded Model Checking (BMC); Propositional Formula

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Arora, R. (2004). Enhancing SAT-based Formal Verification Methods using Global Learning. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/32987

Chicago Manual of Style (16th Edition):

Arora, Rajat. “Enhancing SAT-based Formal Verification Methods using Global Learning.” 2004. Masters Thesis, Virginia Tech. Accessed September 22, 2019. http://hdl.handle.net/10919/32987.

MLA Handbook (7th Edition):

Arora, Rajat. “Enhancing SAT-based Formal Verification Methods using Global Learning.” 2004. Web. 22 Sep 2019.

Vancouver:

Arora R. Enhancing SAT-based Formal Verification Methods using Global Learning. [Internet] [Masters thesis]. Virginia Tech; 2004. [cited 2019 Sep 22]. Available from: http://hdl.handle.net/10919/32987.

Council of Science Editors:

Arora R. Enhancing SAT-based Formal Verification Methods using Global Learning. [Masters Thesis]. Virginia Tech; 2004. Available from: http://hdl.handle.net/10919/32987


Brno University of Technology

27. Binko, Petr. Moderní plánovací algoritmy .

Degree: 2010, Brno University of Technology

 Tato práce popisuje algoritmy graphplan, satplan a real-time adaptive A*. Na implementaci těchto algoritmů   je otestována jejich funkčnost a předpokládané vlastnosti (real-time výpočet, paralelismus),… (more)

Subjects/Keywords: Graphplan; satplan; A*; real-time adaptive A*; plánování; jazyk PDDL; plánovací úlohy;   plánovací grafy; relace mutex; výroková logika; program blackbox; strips.; Graphplan; satplan; A*; real-time adaptive A*; planning; PDDL language;   planning tasks; planning graphs; mutex relation; propositional logic; blackbox program;   strips.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Binko, P. (2010). Moderní plánovací algoritmy . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/54289

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

Binko, Petr. “Moderní plánovací algoritmy .” 2010. Thesis, Brno University of Technology. Accessed September 22, 2019. http://hdl.handle.net/11012/54289.

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

MLA Handbook (7th Edition):

Binko, Petr. “Moderní plánovací algoritmy .” 2010. Web. 22 Sep 2019.

Vancouver:

Binko P. Moderní plánovací algoritmy . [Internet] [Thesis]. Brno University of Technology; 2010. [cited 2019 Sep 22]. Available from: http://hdl.handle.net/11012/54289.

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

Council of Science Editors:

Binko P. Moderní plánovací algoritmy . [Thesis]. Brno University of Technology; 2010. Available from: http://hdl.handle.net/11012/54289

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

28. 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 September 22, 2019. 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. 22 Sep 2019.

Vancouver:

LUSTOSA CRE. [en] ON SOME RELATIONS BETWEEN NATURAL DEDUCTION AND SEQUENT CALCULUS. [Internet] [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2015. [cited 2019 Sep 22]. 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


University of Florida

29. Warner, Susan Aileen, 1955-. An investigation of the role of propositional logic in performance on Piagetian formal operational tasks.

Degree: 1981, University of Florida

Subjects/Keywords: Bending; Brasses; Chemicals; Cognitive psychology; Developmental psychology; Pendulums; Propositional logic; Reasoning; Standardized tests; Steels; Cognition; Developmental psychology; Learning, Psychology of; Psychology thesis Ph. D

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Warner, Susan Aileen, 1. (1981). An investigation of the role of propositional logic in performance on Piagetian formal operational tasks. (Thesis). University of Florida. Retrieved from http://ufdc.ufl.edu/AA00047770

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

Warner, Susan Aileen, 1955-. “An investigation of the role of propositional logic in performance on Piagetian formal operational tasks.” 1981. Thesis, University of Florida. Accessed September 22, 2019. http://ufdc.ufl.edu/AA00047770.

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

MLA Handbook (7th Edition):

Warner, Susan Aileen, 1955-. “An investigation of the role of propositional logic in performance on Piagetian formal operational tasks.” 1981. Web. 22 Sep 2019.

Vancouver:

Warner, Susan Aileen 1. An investigation of the role of propositional logic in performance on Piagetian formal operational tasks. [Internet] [Thesis]. University of Florida; 1981. [cited 2019 Sep 22]. Available from: http://ufdc.ufl.edu/AA00047770.

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

Council of Science Editors:

Warner, Susan Aileen 1. An investigation of the role of propositional logic in performance on Piagetian formal operational tasks. [Thesis]. University of Florida; 1981. Available from: http://ufdc.ufl.edu/AA00047770

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

30. Rocha, Camilo. Symbolic reachability analysis for rewrite theories.

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

 This dissertation presents a significant step forward in automatic and semi-automatic reasoning for reachability properties of rewriting logic specifications, a major research goal in the… (more)

Subjects/Keywords: rewriting logic; symbolic reachability analysis; deadlock freedom; inductive invariants; constrained rewriting; theorem proving; propositional tree automata; smt solving

…CHAPTER 8 A REWRITING LOGIC SEMANTICS FOR PLEXIL 8.1 PLEXIL Overview… …rewriting logic [70], where a specification R has both a deduction-based operational… …logics, or in standard mathematical logic such as first-order logic. A major research goal in… …Rewriting Logic [72]. Another important motivation for the deductive approach is that… …initial states. However, as the applications of rewriting logic have grown, it has been quite… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rocha, C. (2013). Symbolic reachability analysis for rewrite theories. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/42200

Chicago Manual of Style (16th Edition):

Rocha, Camilo. “Symbolic reachability analysis for rewrite theories.” 2013. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed September 22, 2019. http://hdl.handle.net/2142/42200.

MLA Handbook (7th Edition):

Rocha, Camilo. “Symbolic reachability analysis for rewrite theories.” 2013. Web. 22 Sep 2019.

Vancouver:

Rocha C. Symbolic reachability analysis for rewrite theories. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2013. [cited 2019 Sep 22]. Available from: http://hdl.handle.net/2142/42200.

Council of Science Editors:

Rocha C. Symbolic reachability analysis for rewrite theories. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2013. Available from: http://hdl.handle.net/2142/42200

[1] [2]

.