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:(declarative programming). Showing records 1 – 30 of 37 total matches.

[1] [2]

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


University of Adelaide

1. Wolf, Robert Pawel. Declarative computer music programming: using Prolog to generate rule-based musical counterpoints.

Degree: 2015, University of Adelaide

 This submission for the degree of Doctor of Philosophy at the Elder Conservatorium of Music, University of Adelaide, is presented as a conventional, text-based thesis,… (more)

Subjects/Keywords: prolog; counterpoint; computer music; programming; expert systems; declarative programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wolf, R. P. (2015). Declarative computer music programming: using Prolog to generate rule-based musical counterpoints. (Thesis). University of Adelaide. Retrieved from http://hdl.handle.net/2440/96913

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

Wolf, Robert Pawel. “Declarative computer music programming: using Prolog to generate rule-based musical counterpoints.” 2015. Thesis, University of Adelaide. Accessed January 26, 2021. http://hdl.handle.net/2440/96913.

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

MLA Handbook (7th Edition):

Wolf, Robert Pawel. “Declarative computer music programming: using Prolog to generate rule-based musical counterpoints.” 2015. Web. 26 Jan 2021.

Vancouver:

Wolf RP. Declarative computer music programming: using Prolog to generate rule-based musical counterpoints. [Internet] [Thesis]. University of Adelaide; 2015. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/2440/96913.

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

Council of Science Editors:

Wolf RP. Declarative computer music programming: using Prolog to generate rule-based musical counterpoints. [Thesis]. University of Adelaide; 2015. Available from: http://hdl.handle.net/2440/96913

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


University of Melbourne

2. GIUCA, MATTHEW. Mars: an imperative/declarative higher-order programming language with automatic destructive update.

Degree: 2014, University of Melbourne

 For years, we have enjoyed the robustness of programming without side-effects in languages such as Haskell and Mercury. Yet in order to use languages with… (more)

Subjects/Keywords: programming languages; imperative programming; declarative programming; destructive update; compile-time garbage collection

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

GIUCA, M. (2014). Mars: an imperative/declarative higher-order programming language with automatic destructive update. (Doctoral Dissertation). University of Melbourne. Retrieved from http://hdl.handle.net/11343/43263

Chicago Manual of Style (16th Edition):

GIUCA, MATTHEW. “Mars: an imperative/declarative higher-order programming language with automatic destructive update.” 2014. Doctoral Dissertation, University of Melbourne. Accessed January 26, 2021. http://hdl.handle.net/11343/43263.

MLA Handbook (7th Edition):

GIUCA, MATTHEW. “Mars: an imperative/declarative higher-order programming language with automatic destructive update.” 2014. Web. 26 Jan 2021.

Vancouver:

GIUCA M. Mars: an imperative/declarative higher-order programming language with automatic destructive update. [Internet] [Doctoral dissertation]. University of Melbourne; 2014. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/11343/43263.

Council of Science Editors:

GIUCA M. Mars: an imperative/declarative higher-order programming language with automatic destructive update. [Doctoral Dissertation]. University of Melbourne; 2014. Available from: http://hdl.handle.net/11343/43263


KTH

3. Nordström, Didrik. Declarative modelling of parameter setting.

Degree: Computer Science and Communication (CSC), 2015, KTH

The parameter setting problem is part of a complex, automated process for customizing Scania's products; primarily trucks and buses. The problem is modelled as… (more)

Subjects/Keywords: parameter; setting; declarative programming; lazy execution; Computer Sciences; Datavetenskap (datalogi)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nordström, D. (2015). Declarative modelling of parameter setting. (Thesis). KTH. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-171087

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

Nordström, Didrik. “Declarative modelling of parameter setting.” 2015. Thesis, KTH. Accessed January 26, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-171087.

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

MLA Handbook (7th Edition):

Nordström, Didrik. “Declarative modelling of parameter setting.” 2015. Web. 26 Jan 2021.

Vancouver:

Nordström D. Declarative modelling of parameter setting. [Internet] [Thesis]. KTH; 2015. [cited 2021 Jan 26]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-171087.

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

Council of Science Editors:

Nordström D. Declarative modelling of parameter setting. [Thesis]. KTH; 2015. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-171087

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


Virginia Tech

4. Song, Myoungkyu. Supporting Effective Reuse and Safe Evolution in Metadata-Driven Software Development.

Degree: PhD, Computer Science and Applications, 2013, Virginia Tech

 In recent years, metadata-driven software development has gained prominence. In this implementation model, various application concerns are provided as third-party frameworks and libraries that the… (more)

Subjects/Keywords: declarative programming; metadata; domain-specific language; invariants; program transformation; frameworks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Song, M. (2013). Supporting Effective Reuse and Safe Evolution in Metadata-Driven Software Development. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/19369

Chicago Manual of Style (16th Edition):

Song, Myoungkyu. “Supporting Effective Reuse and Safe Evolution in Metadata-Driven Software Development.” 2013. Doctoral Dissertation, Virginia Tech. Accessed January 26, 2021. http://hdl.handle.net/10919/19369.

MLA Handbook (7th Edition):

Song, Myoungkyu. “Supporting Effective Reuse and Safe Evolution in Metadata-Driven Software Development.” 2013. Web. 26 Jan 2021.

Vancouver:

Song M. Supporting Effective Reuse and Safe Evolution in Metadata-Driven Software Development. [Internet] [Doctoral dissertation]. Virginia Tech; 2013. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/10919/19369.

Council of Science Editors:

Song M. Supporting Effective Reuse and Safe Evolution in Metadata-Driven Software Development. [Doctoral Dissertation]. Virginia Tech; 2013. Available from: http://hdl.handle.net/10919/19369


Vilnius University

5. Peldžius, Stasys. Universalus pertvarkų įrankis.

Degree: Master, 2010, Vilnius University

Vykstant nuolatiniam programų sistemų atnaujinimui, nuolatos reikia prižiūrėti, kad jos būtų kokybiškai projektuojamos ir programuojamos. Tačiau neišvengiamai atsiranda nekokybiško išeities teksto, arba atsiranda projektavimo trūkumų.… (more)

Subjects/Keywords: Refactoring; Declarative Meta Programming; Logic programming language; Prolog; SOUL; Patterns; Rules; Facts

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Peldžius, Stasys. (2010). Universalus pertvarkų įrankis. (Masters Thesis). Vilnius University. Retrieved from http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2009~D_20101125_190721-56089 ;

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Chicago Manual of Style (16th Edition):

Peldžius, Stasys. “Universalus pertvarkų įrankis.” 2010. Masters Thesis, Vilnius University. Accessed January 26, 2021. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2009~D_20101125_190721-56089 ;.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

MLA Handbook (7th Edition):

Peldžius, Stasys. “Universalus pertvarkų įrankis.” 2010. Web. 26 Jan 2021.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

Peldžius, Stasys. Universalus pertvarkų įrankis. [Internet] [Masters thesis]. Vilnius University; 2010. [cited 2021 Jan 26]. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2009~D_20101125_190721-56089 ;.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Council of Science Editors:

Peldžius, Stasys. Universalus pertvarkų įrankis. [Masters Thesis]. Vilnius University; 2010. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2009~D_20101125_190721-56089 ;

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete


Uppsala University

6. Luo, Tong. Towards Simpler Argument Binding : Knowledge Gathering by Mining Logic Program Repositories.

Degree: Informatics and Media, 2016, Uppsala University

  The compositional relational programming (CRP) is a purely declarative and naturally compositional programming paradigm, but the low readability and some binding issues limit its… (more)

Subjects/Keywords: declarative programming; compositional relational programming; data mining; argument binding; Information Systems; Systemvetenskap, informationssystem och informatik

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Luo, T. (2016). Towards Simpler Argument Binding : Knowledge Gathering by Mining Logic Program Repositories. (Thesis). Uppsala University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-296131

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

Luo, Tong. “Towards Simpler Argument Binding : Knowledge Gathering by Mining Logic Program Repositories.” 2016. Thesis, Uppsala University. Accessed January 26, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-296131.

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

MLA Handbook (7th Edition):

Luo, Tong. “Towards Simpler Argument Binding : Knowledge Gathering by Mining Logic Program Repositories.” 2016. Web. 26 Jan 2021.

Vancouver:

Luo T. Towards Simpler Argument Binding : Knowledge Gathering by Mining Logic Program Repositories. [Internet] [Thesis]. Uppsala University; 2016. [cited 2021 Jan 26]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-296131.

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

Council of Science Editors:

Luo T. Towards Simpler Argument Binding : Knowledge Gathering by Mining Logic Program Repositories. [Thesis]. Uppsala University; 2016. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-296131

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

7. Vasilopoulos, Ioannis Vasileiou. The design, development and evaluation of a visual programming tool for novice programmers : psychological and pedagogical effects of introductory programming tools on programming knowledge of Greek students.

Degree: PhD, 2014, Teesside University

 This thesis reports a research project that aims to improve the teaching and learning of introductory programming from a pedagogical and psychological viewpoint. Towards this… (more)

Subjects/Keywords: 005.1; visual programming tool; mental models; procedural programming knowledge; declarative programming knowledge; novice programmers; design principles

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vasilopoulos, I. V. (2014). The design, development and evaluation of a visual programming tool for novice programmers : psychological and pedagogical effects of introductory programming tools on programming knowledge of Greek students. (Doctoral Dissertation). Teesside University. Retrieved from https://research.tees.ac.uk/en/studentTheses/58975c0b-7a27-4b44-8823-8b0f87249724 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.640913

Chicago Manual of Style (16th Edition):

Vasilopoulos, Ioannis Vasileiou. “The design, development and evaluation of a visual programming tool for novice programmers : psychological and pedagogical effects of introductory programming tools on programming knowledge of Greek students.” 2014. Doctoral Dissertation, Teesside University. Accessed January 26, 2021. https://research.tees.ac.uk/en/studentTheses/58975c0b-7a27-4b44-8823-8b0f87249724 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.640913.

MLA Handbook (7th Edition):

Vasilopoulos, Ioannis Vasileiou. “The design, development and evaluation of a visual programming tool for novice programmers : psychological and pedagogical effects of introductory programming tools on programming knowledge of Greek students.” 2014. Web. 26 Jan 2021.

Vancouver:

Vasilopoulos IV. The design, development and evaluation of a visual programming tool for novice programmers : psychological and pedagogical effects of introductory programming tools on programming knowledge of Greek students. [Internet] [Doctoral dissertation]. Teesside University; 2014. [cited 2021 Jan 26]. Available from: https://research.tees.ac.uk/en/studentTheses/58975c0b-7a27-4b44-8823-8b0f87249724 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.640913.

Council of Science Editors:

Vasilopoulos IV. The design, development and evaluation of a visual programming tool for novice programmers : psychological and pedagogical effects of introductory programming tools on programming knowledge of Greek students. [Doctoral Dissertation]. Teesside University; 2014. Available from: https://research.tees.ac.uk/en/studentTheses/58975c0b-7a27-4b44-8823-8b0f87249724 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.640913


Texas State University – San Marcos

8. High, Jason. DASPPS: Distributed Answer-set Programming with PS+.

Degree: MS, Computer Science, 2005, Texas State University – San Marcos

No abstract prepared.

Subjects/Keywords: Declarative programming; Logic programming; Parallel programming; Computer science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

High, J. (2005). DASPPS: Distributed Answer-set Programming with PS+. (Masters Thesis). Texas State University – San Marcos. Retrieved from https://digital.library.txstate.edu/handle/10877/11112

Chicago Manual of Style (16th Edition):

High, Jason. “DASPPS: Distributed Answer-set Programming with PS+.” 2005. Masters Thesis, Texas State University – San Marcos. Accessed January 26, 2021. https://digital.library.txstate.edu/handle/10877/11112.

MLA Handbook (7th Edition):

High, Jason. “DASPPS: Distributed Answer-set Programming with PS+.” 2005. Web. 26 Jan 2021.

Vancouver:

High J. DASPPS: Distributed Answer-set Programming with PS+. [Internet] [Masters thesis]. Texas State University – San Marcos; 2005. [cited 2021 Jan 26]. Available from: https://digital.library.txstate.edu/handle/10877/11112.

Council of Science Editors:

High J. DASPPS: Distributed Answer-set Programming with PS+. [Masters Thesis]. Texas State University – San Marcos; 2005. Available from: https://digital.library.txstate.edu/handle/10877/11112

9. Makrynioti, Konstantina. Declarative specification of data analytics tasks.

Degree: 2020, Athens University Economics and Business (AUEB); Οικονομικό Πανεπιστήμιο Αθηνών

 The thesis studies the application of the declarative paradigm on the area of data analytics. Declarative programming is usually summarized in the phrase "describe what… (more)

Subjects/Keywords: Δηλωτικός προγραμματισμός; Δηλωτικές γλώσσες προγραμματισμού; Ανάλυση δεδομένων; Επιστήμη δεδομένων; Μηχανική μάθηση; Declarative programming; Declarative programming languages; Data analysis; Data science; Machine learning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Makrynioti, K. (2020). Declarative specification of data analytics tasks. (Thesis). Athens University Economics and Business (AUEB); Οικονομικό Πανεπιστήμιο Αθηνών. Retrieved from http://hdl.handle.net/10442/hedi/47340

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

Makrynioti, Konstantina. “Declarative specification of data analytics tasks.” 2020. Thesis, Athens University Economics and Business (AUEB); Οικονομικό Πανεπιστήμιο Αθηνών. Accessed January 26, 2021. http://hdl.handle.net/10442/hedi/47340.

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

MLA Handbook (7th Edition):

Makrynioti, Konstantina. “Declarative specification of data analytics tasks.” 2020. Web. 26 Jan 2021.

Vancouver:

Makrynioti K. Declarative specification of data analytics tasks. [Internet] [Thesis]. Athens University Economics and Business (AUEB); Οικονομικό Πανεπιστήμιο Αθηνών; 2020. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/10442/hedi/47340.

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

Council of Science Editors:

Makrynioti K. Declarative specification of data analytics tasks. [Thesis]. Athens University Economics and Business (AUEB); Οικονομικό Πανεπιστήμιο Αθηνών; 2020. Available from: http://hdl.handle.net/10442/hedi/47340

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

10. Erdem, Esra. Theory and applications of answer set programming.

Degree: PhD, Computer Sciences, 2002, University of Texas – Austin

Subjects/Keywords: Declarative programming; Programming languages (Electronic computers) – Semantics

Page 1 Page 2 Page 3 Page 4 Page 5

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Erdem, E. (2002). Theory and applications of answer set programming. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/561

Chicago Manual of Style (16th Edition):

Erdem, Esra. “Theory and applications of answer set programming.” 2002. Doctoral Dissertation, University of Texas – Austin. Accessed January 26, 2021. http://hdl.handle.net/2152/561.

MLA Handbook (7th Edition):

Erdem, Esra. “Theory and applications of answer set programming.” 2002. Web. 26 Jan 2021.

Vancouver:

Erdem E. Theory and applications of answer set programming. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2002. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/2152/561.

Council of Science Editors:

Erdem E. Theory and applications of answer set programming. [Doctoral Dissertation]. University of Texas – Austin; 2002. Available from: http://hdl.handle.net/2152/561


Virginia Tech

11. Gopal, Sriram. An Extensible Framework for Annotation-based Parameter Passing in Distributed Object Systems.

Degree: MS, Computer Science, 2008, Virginia Tech

 Modern distributed object systems pass remote parameters based on their runtime type. This design choice limits the expressiveness, readability, and maintainability of distributed applications. While… (more)

Subjects/Keywords: Declarative Programming; Extensible Middleware; Metadata; Aspect Oriented Programming (AOP); Generative Programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gopal, S. (2008). An Extensible Framework for Annotation-based Parameter Passing in Distributed Object Systems. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/33742

Chicago Manual of Style (16th Edition):

Gopal, Sriram. “An Extensible Framework for Annotation-based Parameter Passing in Distributed Object Systems.” 2008. Masters Thesis, Virginia Tech. Accessed January 26, 2021. http://hdl.handle.net/10919/33742.

MLA Handbook (7th Edition):

Gopal, Sriram. “An Extensible Framework for Annotation-based Parameter Passing in Distributed Object Systems.” 2008. Web. 26 Jan 2021.

Vancouver:

Gopal S. An Extensible Framework for Annotation-based Parameter Passing in Distributed Object Systems. [Internet] [Masters thesis]. Virginia Tech; 2008. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/10919/33742.

Council of Science Editors:

Gopal S. An Extensible Framework for Annotation-based Parameter Passing in Distributed Object Systems. [Masters Thesis]. Virginia Tech; 2008. Available from: http://hdl.handle.net/10919/33742


Mississippi State University

12. Zhang, Yang. Dynamic Memory Management for the Loci Framework.

Degree: MS, Computer Science, 2004, Mississippi State University

 Resource management is a critical part in high-performance computing software. While management of processing resources to increase performance is the most critical, efficient management of… (more)

Subjects/Keywords: graph processing; parallel programming; declarative languages; software synthesis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhang, Y. (2004). Dynamic Memory Management for the Loci Framework. (Masters Thesis). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-04062004-215627/ ;

Chicago Manual of Style (16th Edition):

Zhang, Yang. “Dynamic Memory Management for the Loci Framework.” 2004. Masters Thesis, Mississippi State University. Accessed January 26, 2021. http://sun.library.msstate.edu/ETD-db/theses/available/etd-04062004-215627/ ;.

MLA Handbook (7th Edition):

Zhang, Yang. “Dynamic Memory Management for the Loci Framework.” 2004. Web. 26 Jan 2021.

Vancouver:

Zhang Y. Dynamic Memory Management for the Loci Framework. [Internet] [Masters thesis]. Mississippi State University; 2004. [cited 2021 Jan 26]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-04062004-215627/ ;.

Council of Science Editors:

Zhang Y. Dynamic Memory Management for the Loci Framework. [Masters Thesis]. Mississippi State University; 2004. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-04062004-215627/ ;


Texas Tech University

13. Kolvekar, Loveleen. Developing an inference engine for CR-Prolog with preferences.

Degree: 2004, Texas Tech University

 In recent years, A-Prolog with answer set semantics was shown to be a useful tool for knowledge representation and reasoning. A-Prolog is a declarative language… (more)

Subjects/Keywords: Computer algorithms; Declarative programming; Knowledge representation (Information theory)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kolvekar, L. (2004). Developing an inference engine for CR-Prolog with preferences. (Thesis). Texas Tech University. Retrieved from http://hdl.handle.net/2346/19377

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

Kolvekar, Loveleen. “Developing an inference engine for CR-Prolog with preferences.” 2004. Thesis, Texas Tech University. Accessed January 26, 2021. http://hdl.handle.net/2346/19377.

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

MLA Handbook (7th Edition):

Kolvekar, Loveleen. “Developing an inference engine for CR-Prolog with preferences.” 2004. Web. 26 Jan 2021.

Vancouver:

Kolvekar L. Developing an inference engine for CR-Prolog with preferences. [Internet] [Thesis]. Texas Tech University; 2004. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/2346/19377.

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

Council of Science Editors:

Kolvekar L. Developing an inference engine for CR-Prolog with preferences. [Thesis]. Texas Tech University; 2004. Available from: http://hdl.handle.net/2346/19377

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


Georgia Tech

14. Davies, Kevin L. Declarative modeling of coupled advection and diffusion as applied to fuel cells.

Degree: PhD, Mechanical Engineering, 2014, Georgia Tech

 The goal of this research is to realize the advantages of declarative modeling for complex physical systems that involve both advection and diffusion to varying… (more)

Subjects/Keywords: Electrochemistry; Heat and mass transfer; Fluid dynamics; Equation based; Object oriented; Declarative programming; Diffusion; Heat equation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Davies, K. L. (2014). Declarative modeling of coupled advection and diffusion as applied to fuel cells. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/51814

Chicago Manual of Style (16th Edition):

Davies, Kevin L. “Declarative modeling of coupled advection and diffusion as applied to fuel cells.” 2014. Doctoral Dissertation, Georgia Tech. Accessed January 26, 2021. http://hdl.handle.net/1853/51814.

MLA Handbook (7th Edition):

Davies, Kevin L. “Declarative modeling of coupled advection and diffusion as applied to fuel cells.” 2014. Web. 26 Jan 2021.

Vancouver:

Davies KL. Declarative modeling of coupled advection and diffusion as applied to fuel cells. [Internet] [Doctoral dissertation]. Georgia Tech; 2014. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/1853/51814.

Council of Science Editors:

Davies KL. Declarative modeling of coupled advection and diffusion as applied to fuel cells. [Doctoral Dissertation]. Georgia Tech; 2014. Available from: http://hdl.handle.net/1853/51814

15. Pejović Aleksandar. Parallel software system for counting finite models.

Degree: 2020, University of Novi Sad

This dissertation is about the development of a parallel software system for representing and solving problems of finite model theory and its application. The… (more)

Subjects/Keywords: model theory, free algebras, finite combinatorics, declarative programming, parallel programming; теорија модела, слободне алгебре, коначна комбинаторика,декларативно програмирање, паралелно програмирање; teorija modela, slobodne algebre, konačna kombinatorika,deklarativno programiranje, paralelno programiranje

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Aleksandar, P. (2020). Parallel software system for counting finite models. (Thesis). University of Novi Sad. Retrieved from https://www.cris.uns.ac.rs/DownloadFileServlet/Disertacija15740787572779.pdf?controlNumber=(BISIS)112402&fileName=15740787572779.pdf&id=14264&source=OATD&language=en ; https://www.cris.uns.ac.rs/record.jsf?recordId=112402&source=OATD&language=en

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

Aleksandar, Pejović. “Parallel software system for counting finite models.” 2020. Thesis, University of Novi Sad. Accessed January 26, 2021. https://www.cris.uns.ac.rs/DownloadFileServlet/Disertacija15740787572779.pdf?controlNumber=(BISIS)112402&fileName=15740787572779.pdf&id=14264&source=OATD&language=en ; https://www.cris.uns.ac.rs/record.jsf?recordId=112402&source=OATD&language=en.

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

MLA Handbook (7th Edition):

Aleksandar, Pejović. “Parallel software system for counting finite models.” 2020. Web. 26 Jan 2021.

Vancouver:

Aleksandar P. Parallel software system for counting finite models. [Internet] [Thesis]. University of Novi Sad; 2020. [cited 2021 Jan 26]. Available from: https://www.cris.uns.ac.rs/DownloadFileServlet/Disertacija15740787572779.pdf?controlNumber=(BISIS)112402&fileName=15740787572779.pdf&id=14264&source=OATD&language=en ; https://www.cris.uns.ac.rs/record.jsf?recordId=112402&source=OATD&language=en.

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

Council of Science Editors:

Aleksandar P. Parallel software system for counting finite models. [Thesis]. University of Novi Sad; 2020. Available from: https://www.cris.uns.ac.rs/DownloadFileServlet/Disertacija15740787572779.pdf?controlNumber=(BISIS)112402&fileName=15740787572779.pdf&id=14264&source=OATD&language=en ; https://www.cris.uns.ac.rs/record.jsf?recordId=112402&source=OATD&language=en

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


University of Kentucky

16. Singhi, Soumya. Computing stable models of logic programs.

Degree: 2003, University of Kentucky

 Solution of any search problem lies in its search space. A search is a systematic examination of candidate solutions of a search problem. In this… (more)

Subjects/Keywords: Stable model Semantics; smodels; Search Algorithm; Declarative programming; Logic programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Singhi, S. (2003). Computing stable models of logic programs. (Masters Thesis). University of Kentucky. Retrieved from https://uknowledge.uky.edu/gradschool_theses/223

Chicago Manual of Style (16th Edition):

Singhi, Soumya. “Computing stable models of logic programs.” 2003. Masters Thesis, University of Kentucky. Accessed January 26, 2021. https://uknowledge.uky.edu/gradschool_theses/223.

MLA Handbook (7th Edition):

Singhi, Soumya. “Computing stable models of logic programs.” 2003. Web. 26 Jan 2021.

Vancouver:

Singhi S. Computing stable models of logic programs. [Internet] [Masters thesis]. University of Kentucky; 2003. [cited 2021 Jan 26]. Available from: https://uknowledge.uky.edu/gradschool_theses/223.

Council of Science Editors:

Singhi S. Computing stable models of logic programs. [Masters Thesis]. University of Kentucky; 2003. Available from: https://uknowledge.uky.edu/gradschool_theses/223


Uppsala University

17. Zetterström, Andreas. Visual Compositional-Relational Programming.

Degree: Computer Systems Sciences, 2010, Uppsala University

  In an ever faster changing environment, software developers not only need agile methods, but also agile programming paradigms and tools. A paradigm shift towards… (more)

Subjects/Keywords: visual programming; compositional-relational programming; logic programming; declarative programming; Information Systems; Systemvetenskap, informationssystem och informatik

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zetterström, A. (2010). Visual Compositional-Relational Programming. (Thesis). Uppsala University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-126895

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

Zetterström, Andreas. “Visual Compositional-Relational Programming.” 2010. Thesis, Uppsala University. Accessed January 26, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-126895.

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

MLA Handbook (7th Edition):

Zetterström, Andreas. “Visual Compositional-Relational Programming.” 2010. Web. 26 Jan 2021.

Vancouver:

Zetterström A. Visual Compositional-Relational Programming. [Internet] [Thesis]. Uppsala University; 2010. [cited 2021 Jan 26]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-126895.

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

Council of Science Editors:

Zetterström A. Visual Compositional-Relational Programming. [Thesis]. Uppsala University; 2010. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-126895

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


University of Texas – Austin

18. Ferraris, Paolo, 1972-. Expressiveness of answer set languages.

Degree: PhD, Computer Sciences, 2007, University of Texas – Austin

 Answer set programming (ASP) is a form of declarative programming oriented towards difficult combinatorial search problems. It has been applied, for instance, to plan generation… (more)

Subjects/Keywords: Programming languages (Electronic computers) – Syntax; Programming languages (Electronic computers) – Semantics; Declarative programming; Logic programming languages

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ferraris, Paolo, 1. (2007). Expressiveness of answer set languages. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/3210

Chicago Manual of Style (16th Edition):

Ferraris, Paolo, 1972-. “Expressiveness of answer set languages.” 2007. Doctoral Dissertation, University of Texas – Austin. Accessed January 26, 2021. http://hdl.handle.net/2152/3210.

MLA Handbook (7th Edition):

Ferraris, Paolo, 1972-. “Expressiveness of answer set languages.” 2007. Web. 26 Jan 2021.

Vancouver:

Ferraris, Paolo 1. Expressiveness of answer set languages. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2007. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/2152/3210.

Council of Science Editors:

Ferraris, Paolo 1. Expressiveness of answer set languages. [Doctoral Dissertation]. University of Texas – Austin; 2007. Available from: http://hdl.handle.net/2152/3210

19. VIANA, Daniel Leite. Uma linguagem de domínio específico para descrição e reconhecimento de gestos usando sensores de profundidade .

Degree: 2015, Universidade Federal de Pernambuco

 Sistemas baseados em gestos vêm se tornando uma alternativa para o desenvolvimento de aplicações mais intuitivas para os usuários, pois permitem a esses usuários interagirem… (more)

Subjects/Keywords: Interação Humano-Computador; Interação Natural; Kinect; Reconhecimento de Gestos; Linguagens Específicas de Domínio; Programação Declarativa; Human-Computer Interaction; Natural Interaction; Gesture Recognition; Domain-Specific Languages; Declarative Programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

VIANA, D. L. (2015). Uma linguagem de domínio específico para descrição e reconhecimento de gestos usando sensores de profundidade . (Thesis). Universidade Federal de Pernambuco. Retrieved from http://repositorio.ufpe.br/handle/123456789/15892

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

VIANA, Daniel Leite. “Uma linguagem de domínio específico para descrição e reconhecimento de gestos usando sensores de profundidade .” 2015. Thesis, Universidade Federal de Pernambuco. Accessed January 26, 2021. http://repositorio.ufpe.br/handle/123456789/15892.

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

MLA Handbook (7th Edition):

VIANA, Daniel Leite. “Uma linguagem de domínio específico para descrição e reconhecimento de gestos usando sensores de profundidade .” 2015. Web. 26 Jan 2021.

Vancouver:

VIANA DL. Uma linguagem de domínio específico para descrição e reconhecimento de gestos usando sensores de profundidade . [Internet] [Thesis]. Universidade Federal de Pernambuco; 2015. [cited 2021 Jan 26]. Available from: http://repositorio.ufpe.br/handle/123456789/15892.

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

Council of Science Editors:

VIANA DL. Uma linguagem de domínio específico para descrição e reconhecimento de gestos usando sensores de profundidade . [Thesis]. Universidade Federal de Pernambuco; 2015. Available from: http://repositorio.ufpe.br/handle/123456789/15892

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

20. Ahmad Kassem, Ahmad. Programming networks with intensional destinations : Programmation distribuée avec destinataires intentionnelles.

Degree: Docteur es, Informatique, 2013, INSA Lyon

La programmation distribuée est une tâche difficile. Elle a énormément gagné en importance avec le développement des réseaux qui supportent un nombre croissant exponentiellement d’applications.… (more)

Subjects/Keywords: Informatique; Système distribué; Programmation distribuée; Fiabilité des services; Destinations intentionnelles; Langage déclaratif; Information Technology; Distributed system; Distributed programming; Services reliability; Intensional desitnation; Declarative language; 005.110 72

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ahmad Kassem, A. (2013). Programming networks with intensional destinations : Programmation distribuée avec destinataires intentionnelles. (Doctoral Dissertation). INSA Lyon. Retrieved from http://www.theses.fr/2013ISAL0113

Chicago Manual of Style (16th Edition):

Ahmad Kassem, Ahmad. “Programming networks with intensional destinations : Programmation distribuée avec destinataires intentionnelles.” 2013. Doctoral Dissertation, INSA Lyon. Accessed January 26, 2021. http://www.theses.fr/2013ISAL0113.

MLA Handbook (7th Edition):

Ahmad Kassem, Ahmad. “Programming networks with intensional destinations : Programmation distribuée avec destinataires intentionnelles.” 2013. Web. 26 Jan 2021.

Vancouver:

Ahmad Kassem A. Programming networks with intensional destinations : Programmation distribuée avec destinataires intentionnelles. [Internet] [Doctoral dissertation]. INSA Lyon; 2013. [cited 2021 Jan 26]. Available from: http://www.theses.fr/2013ISAL0113.

Council of Science Editors:

Ahmad Kassem A. Programming networks with intensional destinations : Programmation distribuée avec destinataires intentionnelles. [Doctoral Dissertation]. INSA Lyon; 2013. Available from: http://www.theses.fr/2013ISAL0113

21. Nguyen, Thi Thanh Quynh. A new approach for distributed programming in smart grids : Une nouvelle approche pour la programmation distribuée dans les smartgrids.

Degree: Docteur es, Génie électrique, 2019, Université Grenoble Alpes (ComUE)

 Le principal défi du contrôle et de la gestion des réseaux électriques intelligents (Smartgrids) est la quantité de données à traiter. Les techniques classiques centralisées,… (more)

Subjects/Keywords: Smartgrids; Micro-Réseau; Base de données distribuées; Langage déclaratif et réactif; Programmation distribuée; Contrôle distribué; Smart grids; Microgrid; Distributed database; Declarative and reactive language; Distributed programming; Distributed control; 620

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nguyen, T. T. Q. (2019). A new approach for distributed programming in smart grids : Une nouvelle approche pour la programmation distribuée dans les smartgrids. (Doctoral Dissertation). Université Grenoble Alpes (ComUE). Retrieved from http://www.theses.fr/2019GREAT079

Chicago Manual of Style (16th Edition):

Nguyen, Thi Thanh Quynh. “A new approach for distributed programming in smart grids : Une nouvelle approche pour la programmation distribuée dans les smartgrids.” 2019. Doctoral Dissertation, Université Grenoble Alpes (ComUE). Accessed January 26, 2021. http://www.theses.fr/2019GREAT079.

MLA Handbook (7th Edition):

Nguyen, Thi Thanh Quynh. “A new approach for distributed programming in smart grids : Une nouvelle approche pour la programmation distribuée dans les smartgrids.” 2019. Web. 26 Jan 2021.

Vancouver:

Nguyen TTQ. A new approach for distributed programming in smart grids : Une nouvelle approche pour la programmation distribuée dans les smartgrids. [Internet] [Doctoral dissertation]. Université Grenoble Alpes (ComUE); 2019. [cited 2021 Jan 26]. Available from: http://www.theses.fr/2019GREAT079.

Council of Science Editors:

Nguyen TTQ. A new approach for distributed programming in smart grids : Une nouvelle approche pour la programmation distribuée dans les smartgrids. [Doctoral Dissertation]. Université Grenoble Alpes (ComUE); 2019. Available from: http://www.theses.fr/2019GREAT079


Arizona State University

22. Henderson, Christopher. Graph Search as a Feature in Imperative/Procedural Programming Languages.

Degree: Software Engineering, 2018, Arizona State University

Subjects/Keywords: Computer science; Computer engineering; Backtracking; Declarative Programming; Golang; Graph Search; Imperative Programming; Programming Languages

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Henderson, C. (2018). Graph Search as a Feature in Imperative/Procedural Programming Languages. (Masters Thesis). Arizona State University. Retrieved from http://repository.asu.edu/items/49188

Chicago Manual of Style (16th Edition):

Henderson, Christopher. “Graph Search as a Feature in Imperative/Procedural Programming Languages.” 2018. Masters Thesis, Arizona State University. Accessed January 26, 2021. http://repository.asu.edu/items/49188.

MLA Handbook (7th Edition):

Henderson, Christopher. “Graph Search as a Feature in Imperative/Procedural Programming Languages.” 2018. Web. 26 Jan 2021.

Vancouver:

Henderson C. Graph Search as a Feature in Imperative/Procedural Programming Languages. [Internet] [Masters thesis]. Arizona State University; 2018. [cited 2021 Jan 26]. Available from: http://repository.asu.edu/items/49188.

Council of Science Editors:

Henderson C. Graph Search as a Feature in Imperative/Procedural Programming Languages. [Masters Thesis]. Arizona State University; 2018. Available from: http://repository.asu.edu/items/49188


University of New South Wales

23. Drescher, Christian. Conflict-driven constraint answer set solving.

Degree: Computer Science & Engineering, 2015, University of New South Wales

 Constraint answer set programming (CASP) is a declarative problem solving paradigm that combines the strengths of answer set programming (ASP) and constraint programming (CP). ASP… (more)

Subjects/Keywords: Answer Set Programming; Artificial Intelligence; Declarative Problem Solving; Logic Programming; All-Different; Grammar; Reachability; Unfounded Sets; Well-founded Justification; Well-founded Domination; Support Flowgraph; Conflict-driven Nogood Learning; Lazy Nogood Generation; Constraint Answer Set Solving; ASP; CSP; CP; CASP; Constraint Programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Drescher, C. (2015). Conflict-driven constraint answer set solving. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/54397 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:34911/SOURCE02?view=true

Chicago Manual of Style (16th Edition):

Drescher, Christian. “Conflict-driven constraint answer set solving.” 2015. Doctoral Dissertation, University of New South Wales. Accessed January 26, 2021. http://handle.unsw.edu.au/1959.4/54397 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:34911/SOURCE02?view=true.

MLA Handbook (7th Edition):

Drescher, Christian. “Conflict-driven constraint answer set solving.” 2015. Web. 26 Jan 2021.

Vancouver:

Drescher C. Conflict-driven constraint answer set solving. [Internet] [Doctoral dissertation]. University of New South Wales; 2015. [cited 2021 Jan 26]. Available from: http://handle.unsw.edu.au/1959.4/54397 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:34911/SOURCE02?view=true.

Council of Science Editors:

Drescher C. Conflict-driven constraint answer set solving. [Doctoral Dissertation]. University of New South Wales; 2015. Available from: http://handle.unsw.edu.au/1959.4/54397 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:34911/SOURCE02?view=true


University of New South Wales

24. Ditu, Gabriel Cristian. The programming language TransLucid.

Degree: Computer Science & Engineering, 2007, University of New South Wales

 This thesis presents TransLucid, a low-level, purely declarative, intensional programming language. Built on a simple algebra and with just a small number of primitives, TransLucid… (more)

Subjects/Keywords: TransLucid; Lucid (Computer program language); Intensional programming; Cartesian programming; Declarative programming; Programming language semantics; Programming language translation; Modal logic; Intensional logic; Modality (Logic)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ditu, G. C. (2007). The programming language TransLucid. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/40701 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:1482/SOURCE02?view=true

Chicago Manual of Style (16th Edition):

Ditu, Gabriel Cristian. “The programming language TransLucid.” 2007. Doctoral Dissertation, University of New South Wales. Accessed January 26, 2021. http://handle.unsw.edu.au/1959.4/40701 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:1482/SOURCE02?view=true.

MLA Handbook (7th Edition):

Ditu, Gabriel Cristian. “The programming language TransLucid.” 2007. Web. 26 Jan 2021.

Vancouver:

Ditu GC. The programming language TransLucid. [Internet] [Doctoral dissertation]. University of New South Wales; 2007. [cited 2021 Jan 26]. Available from: http://handle.unsw.edu.au/1959.4/40701 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:1482/SOURCE02?view=true.

Council of Science Editors:

Ditu GC. The programming language TransLucid. [Doctoral Dissertation]. University of New South Wales; 2007. Available from: http://handle.unsw.edu.au/1959.4/40701 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:1482/SOURCE02?view=true

25. Θάνος, Άγγελος. Παράλληλες μέθοδοι ελέγχου δηλωτικών γλωσσών προγραμματισμού με γραμματική προσέγγιση.

Degree: 1999, Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ); National Technical University of Athens (NTUA)

Subjects/Keywords: Δηλωτικές γλώσσες προγραμματισμού; Κατηγορικές γραμματικές; Παράληλη επεξεργασία; Προγραμματισμός με περιορισμούς; Declarative programming languages; Attribute grammars; Parallel procesisng; Constraint programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Θάνος, . (1999). Παράλληλες μέθοδοι ελέγχου δηλωτικών γλωσσών προγραμματισμού με γραμματική προσέγγιση. (Thesis). Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ); National Technical University of Athens (NTUA). Retrieved from http://hdl.handle.net/10442/hedi/11261

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

Θάνος, Άγγελος. “Παράλληλες μέθοδοι ελέγχου δηλωτικών γλωσσών προγραμματισμού με γραμματική προσέγγιση.” 1999. Thesis, Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ); National Technical University of Athens (NTUA). Accessed January 26, 2021. http://hdl.handle.net/10442/hedi/11261.

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

MLA Handbook (7th Edition):

Θάνος, Άγγελος. “Παράλληλες μέθοδοι ελέγχου δηλωτικών γλωσσών προγραμματισμού με γραμματική προσέγγιση.” 1999. Web. 26 Jan 2021.

Vancouver:

Θάνος . Παράλληλες μέθοδοι ελέγχου δηλωτικών γλωσσών προγραμματισμού με γραμματική προσέγγιση. [Internet] [Thesis]. Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ); National Technical University of Athens (NTUA); 1999. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/10442/hedi/11261.

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

Council of Science Editors:

Θάνος . Παράλληλες μέθοδοι ελέγχου δηλωτικών γλωσσών προγραμματισμού με γραμματική προσέγγιση. [Thesis]. Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ); National Technical University of Athens (NTUA); 1999. Available from: http://hdl.handle.net/10442/hedi/11261

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

26. Uzuncaova, Engin. Efficient specification-based testing using incremental techniques.

Degree: PhD, Electrical and Computer Engineering, 2008, University of Texas – Austin

 As software systems grow in complexity, the need for efficient automated techniques for design, testing and verification becomes more and more critical. Specification-based testing provides… (more)

Subjects/Keywords: Computer software – Testing; Program transformation (Computer programming); Constrained optimization; Declarative programming languages

declarative specifications incrementally; presents a constraint prioritization and partitioning… …ix The key insight behind the incremental technique is declarative slicing, which is a… …for imperative languages but are applicable to analyzable declarative languages, in general… …and Alloy, in particular. We introduce a novel algorithm for slicing declarative models… …solving declarative models. Incremental analyses have a natural application in the software… 

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

Uzuncaova, E. (2008). Efficient specification-based testing using incremental techniques. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/18266

Chicago Manual of Style (16th Edition):

Uzuncaova, Engin. “Efficient specification-based testing using incremental techniques.” 2008. Doctoral Dissertation, University of Texas – Austin. Accessed January 26, 2021. http://hdl.handle.net/2152/18266.

MLA Handbook (7th Edition):

Uzuncaova, Engin. “Efficient specification-based testing using incremental techniques.” 2008. Web. 26 Jan 2021.

Vancouver:

Uzuncaova E. Efficient specification-based testing using incremental techniques. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2008. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/2152/18266.

Council of Science Editors:

Uzuncaova E. Efficient specification-based testing using incremental techniques. [Doctoral Dissertation]. University of Texas – Austin; 2008. Available from: http://hdl.handle.net/2152/18266


Euskal Herriko Unibertsitatea / Universidad del País Vasco

27. 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 January 26, 2021. http://hdl.handle.net/10810/10332.

MLA Handbook (7th Edition):

Gaintzarain Ibarmia, José. “Invariant-free deduction systems for temporal logic .” 2012. Web. 26 Jan 2021.

Vancouver:

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


ETH Zürich

28. Staub, Jacqueline. xLogo online - a web-based programming IDE for Logo.

Degree: 2016, ETH Zürich

Subjects/Keywords: PROGRAMMIERUMGEBUNGEN (SOFTWARE ENGINEERING); DEKLARATIVE PROGRAMMIERUNG + LOGISCHE PROGRAMMIERUNG (PROGRAMMIERMETHODEN); LOGO (PROGRAMMIERSPRACHEN); PROGRAMMING ENVIRONMENTS (SOFTWARE ENGINEERING); DECLARATIVE PROGRAMMING + LOGIC PROGRAMMING (PROGRAMMING METHODS); LOGO (PROGRAMMING LANGUAGES); info:eu-repo/classification/ddc/004; Data processing, computer science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Staub, J. (2016). xLogo online - a web-based programming IDE for Logo. (Thesis). ETH Zürich. Retrieved from http://hdl.handle.net/20.500.11850/155855

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

Staub, Jacqueline. “xLogo online - a web-based programming IDE for Logo.” 2016. Thesis, ETH Zürich. Accessed January 26, 2021. http://hdl.handle.net/20.500.11850/155855.

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

MLA Handbook (7th Edition):

Staub, Jacqueline. “xLogo online - a web-based programming IDE for Logo.” 2016. Web. 26 Jan 2021.

Vancouver:

Staub J. xLogo online - a web-based programming IDE for Logo. [Internet] [Thesis]. ETH Zürich; 2016. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/20.500.11850/155855.

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

Council of Science Editors:

Staub J. xLogo online - a web-based programming IDE for Logo. [Thesis]. ETH Zürich; 2016. Available from: http://hdl.handle.net/20.500.11850/155855

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


York University

29. Khan, Shakil Mahmud. Rational Agents: Prioritized Goals, Goal Dynamics, and Agent Programming Languages with Declarative Goals.

Degree: PhD, Computer Science, 2018, York University

 I introduce a specification language for modeling an agent's prioritized goals and their dynamics. I use the situation calculus along with Reiter's solution to the… (more)

Subjects/Keywords: Logic; Prioritized goals; Goal change; Intention; Reasoning about goals and goal dynamics; Logic of agency; Subgoals; Agent programming languages with declarative goals; Rationality; Rational behavior; Modal logic; Modelling mental states; Motivation; Desires; Intentional stance; Knowledge representation; Theory of mind; Common sense psychology

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Khan, S. M. (2018). Rational Agents: Prioritized Goals, Goal Dynamics, and Agent Programming Languages with Declarative Goals. (Doctoral Dissertation). York University. Retrieved from http://hdl.handle.net/10315/35495

Chicago Manual of Style (16th Edition):

Khan, Shakil Mahmud. “Rational Agents: Prioritized Goals, Goal Dynamics, and Agent Programming Languages with Declarative Goals.” 2018. Doctoral Dissertation, York University. Accessed January 26, 2021. http://hdl.handle.net/10315/35495.

MLA Handbook (7th Edition):

Khan, Shakil Mahmud. “Rational Agents: Prioritized Goals, Goal Dynamics, and Agent Programming Languages with Declarative Goals.” 2018. Web. 26 Jan 2021.

Vancouver:

Khan SM. Rational Agents: Prioritized Goals, Goal Dynamics, and Agent Programming Languages with Declarative Goals. [Internet] [Doctoral dissertation]. York University; 2018. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/10315/35495.

Council of Science Editors:

Khan SM. Rational Agents: Prioritized Goals, Goal Dynamics, and Agent Programming Languages with Declarative Goals. [Doctoral Dissertation]. York University; 2018. Available from: http://hdl.handle.net/10315/35495

30. Σφυρής, Δημήτριος. Εφαρμογές ασαφούς λογικής στην ανάπτυξη έμπειρων συστημάτων.

Degree: 2011, Democritus University of Thrace (DUTH); Δημοκρίτειο Πανεπιστήμιο Θράκης (ΔΠΘ)

In the present Dissertation, the development of Expert Systems is presented, by proposing new methods towards the solution of Technical and Economic problems under uncertainty.… (more)

Subjects/Keywords: Ασαφής λογική; Έμπειρα συστήματα; Αριθμητικές μέθοδοι; Δηλωτικός προγραμματισμός; Νευρωνικά δίκτυα; Επιχειρησιακή έρευνα; Βιομηχανικός έλεγχος; Στρατηγικό μάνατζμεντ; Fuzzy logic; Expert systems; Numerical methods; Declarative programming; Neural networks; Operational research; Industrial control; Strategic management

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Σφυρής, . . (2011). Εφαρμογές ασαφούς λογικής στην ανάπτυξη έμπειρων συστημάτων. (Thesis). Democritus University of Thrace (DUTH); Δημοκρίτειο Πανεπιστήμιο Θράκης (ΔΠΘ). Retrieved from http://hdl.handle.net/10442/hedi/28678

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

Σφυρής, Δημήτριος. “Εφαρμογές ασαφούς λογικής στην ανάπτυξη έμπειρων συστημάτων.” 2011. Thesis, Democritus University of Thrace (DUTH); Δημοκρίτειο Πανεπιστήμιο Θράκης (ΔΠΘ). Accessed January 26, 2021. http://hdl.handle.net/10442/hedi/28678.

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

MLA Handbook (7th Edition):

Σφυρής, Δημήτριος. “Εφαρμογές ασαφούς λογικής στην ανάπτυξη έμπειρων συστημάτων.” 2011. Web. 26 Jan 2021.

Vancouver:

Σφυρής . Εφαρμογές ασαφούς λογικής στην ανάπτυξη έμπειρων συστημάτων. [Internet] [Thesis]. Democritus University of Thrace (DUTH); Δημοκρίτειο Πανεπιστήμιο Θράκης (ΔΠΘ); 2011. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/10442/hedi/28678.

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

Council of Science Editors:

Σφυρής . Εφαρμογές ασαφούς λογικής στην ανάπτυξη έμπειρων συστημάτων. [Thesis]. Democritus University of Thrace (DUTH); Δημοκρίτειο Πανεπιστήμιο Θράκης (ΔΠΘ); 2011. Available from: http://hdl.handle.net/10442/hedi/28678

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

[1] [2]

.