subject:(declarative programming)

University of Adelaide

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

Degree: 2015, University of Adelaide

URL: http://hdl.handle.net/2440/96913

► 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 Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://hdl.handle.net/11343/43263

► 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 Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-171087

►

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)

▼

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 a stateless, acyclic graph of pure functions and variables. A subset of a deterministic, concurrent, demand-driven, declarative programming model is implemented under the Microsoft .NET framework. The implementation is evaluated based on suitability for solving the parameter setting problem, computational performance and general applicability within the organization. It is concluded that the model reduces the complexity of the parameter setting problem, mainly due to demand-driven (lazy) execution. The implementation scales as expected on sequential programs in time and memory with respect to input size. Parallel programs benefit partly from parallelism but bottlenecks in the .NET framework seem to limit the speedup. The general applicability of the programming model within the organization is potentially high and there are many extensions that can be added in the future, such as constraint programming.

Parametersättning är en del av en komplex, automatiserad process för att specialanpassa Scanias produkter – primärt lastbilar och bussar. Problemet är modellerat som en tillståndslös acyklisk graf av rena funktioner och variabler. En deterministisk, parallel, behovstyrd deklarativ programmeringsmodell har implementeras under Microsoft .NET-ramverket. Implementationen utvärderas utifrån lämplighet för parametersättning, prestanda och generell nytta inom organisationen. Modellen lyckas med att reducera komplexiteten för parametersättning, primärt tack vare behovstyrd (lat) exekvering. Implementationen skalar i både tid och minne i enlighet med förväntningarna för sekventiella program. Parallella program har delvis nytta av multipla processorkärnor men flaskhalsar i .NET-ramverket verkar begränsa prestandan. Programmeringsmodellens generella nytta inom organisationen är potentiellt hög och det finns många tillbyggnader som kan läggas till i framtiden, såsom villkorsprogrammering.

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

Record Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://hdl.handle.net/10919/19369

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

▼ 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 programmer configures through metadata, such as XML configuration files or Java annotations. Metadata-driven software development is a special case of declarative programming: metadata serves as a domain-specific language that the programmer uses to declare various concerns, whose implementation is provided by an elaborate ecosystem of libraries and frameworks that serve as pre-defined application building blocks. Examples abound: transparent persistence mechanisms facilitate data management; security frameworks provide access control and encryption; unit testing frameworks provide abstractions for implementing and executing unit tests, etc. Metadata-driven software development has been particularly embraced in enterprise computing as a means of providing standardized solutions to common application scenarios. Despite the conciseness and simplicity benefits of metadata-driven software development, this implementation model introduces a unique set of reuse and evolution challenges. In particular, metadata is not reusable across application modules, and program evolution causes unsafe discrepancies between the main source code and its corresponding metadata. The research described in this dissertation addresses five fundamental problems of metadata-driven software development: (1) bytecode enhancements that transparently introduce concerns hinder program understanding and debugging; (2) mainstream enterprise metadata formats are hard to understand, evolve, and reuse; (3) concerns declared via metadata cannot be reused when source-to-source compiling emerging languages to mainstream ones; (4) metadata correctness cannot be automatically ensured as application source code is being refactored and enhanced; and (5) lacking built-in metadata, JavaScript programs can be enhanced with additional concerns only through manual source code changes. The research described in this dissertation leverages domain-specific languages and automated code generation to enable effective reuse and safe evolution in metadata-driven software development. The specific innovations that address the problems outlined above are as follows: (1) a domain-specific language (DSL) describing bytecode enhancement that facilitates the understanding and debugging of additional concerns; (2) a novel metadata format expressed as a DSL that is easier to author, understand, reuse, and maintain than existing metadata formats; (3) automated metadata translation that enables effective reuse of target language additional concerns from source-to-source compiled source language programs; (4) metadata invariants – a new abstraction for expressing and verifying metadata coding convention; and (5) a new approach to declaratively enhancing JavaScript programs with additional concerns. Advisors/Committee Members: Tilevich, Eli (committeechair), Kafura, Dennis G. (committee member), Yi, Kwangkeun (committee member), Edwards, Stephen H. (committee member), Ryder, Barbara Gershon (committee member).

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

Record Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2009~D_20101125_190721-56089 ;

►

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)

▼

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ų. Todėl yra svarbu mokėti ieškoti tokias problemas, ir jas ištaisyti. Šio darbo tikslas yra sukurti automatinio – universalaus įrankio modelį, kuris savarankiškai aptiktų pertvarkas, bei būtų nepriklausomas nuo konkrečios programavimo kalbos. Šiam tikslui pasiekti yra nagrinėjami mokslininkų siūlomi automatiškai aptinkantys pertvarkas metodai. Taip pat yra nagrinėjamos tokio įrankio realizavimo galimybės, pateikti realizaciniai sprendimai ir pavyzdžiai. Taip pat tikslas yra sukurti praktiškai naudingas automatines pertvarkas, kurios būtų realizuotos pasiūlytu įrankiu, ir pademonstruotas jų veikimas. Šis įrankis naudoja loginį programavimą, kurio faktais yra aprašomos pertvarkomos programos, o taisyklėmis – pačios pertvarkų programos. Sėkmingai sukurti automatiniai pertvarkų radimo pavyzdžiai, leidžia daryti išvadą, kad šiame darbe rastas būdas automatiškai aptikti nekokybišką išeities tekstą, bei realizuoti tokias pertvarkas nepriklausomai nuo programavimo kalbos.

In the continual evolution of software systems, should be continuous to ensure that they are high quality designed and programmed. But inevitably the defective code, that call “bad small” or the design deficiencies. It is therefore important to be able to find such problems, and to correct them. The aim of this thesis is to create automatic - universal refactoring tool, which is detected in self-refactoring, and is independent of specific programming languages. To achieve this objective are scientists considered the proposed automatic detection of refactoring methods. It is also considered the possibility of the realization of such a tool, to provide examples and realizable solutions. It also aims to create a practical benefit of the automatic adjustments to the proposed tool is to be realized, and a demonstration of their operation. This tool uses a logic programming, which is a factual description of the conversion, and the rules - the refactoring of the program. The successful creation of automatic detection for refactoring, it can be concluded that this work is found way to automatically detect poor quality of source code, and the realization of the restructuring, regardless of programming language.

Advisors/Committee Members: Plukas, Mindaugas (Master's thesis supervisor).

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

Record Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-296131

► 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 Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: https://research.tees.ac.uk/en/studentTheses/58975c0b-7a27-4b44-8823-8b0f87249724 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.640913

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

▼ 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 aim, seven principles for designing educational programming tools for novices were identified by reviewing literature regarding novices’ difficulties and using a theoretical framework defined by the psychological theories of Constructivism and Cognitive Load Theory. This set of design principles was not only theoretically identified, but its pedagogical impact was also empirically tested. For this reason, Koios, a new programming tool, was designed and developed as a manifestation of the combined set of principles. Empirical studies were conducted by a way of a quasi-experimental design in two different Greek secondary-education institutions. The independent variable was compliance with the set of the seven principles. Students’ level of programming skills (procedural knowledge) was the dependent variable, while the quality of their mental models in the domain of introductory programming (declarative knowledge) was the potential mediator. The effect of compliance with the set of principles on students’ programming skills and mental-model quality was explored via Koios’ evaluation. Declarative- and procedural-knowledge measurements, as well as a practical test, were used to collect data, which were analysed using ANOVA and hierarchical multiple regression. The major conclusions drawn from this study are:(a) compliance with the set of design principles does not affect the development of novices’ procedural and declarative programming knowledge, (b) a programming tool that highly complies with this set facilitates novices in the application of their procedural programming knowledge during program creation and (c) programming tools, declarative and procedural knowledge are independent components in learning to program. However, it was also concluded that the two knowledge types and a programming tool that highly complies with the set contribute significantly to novices’ programming performance. This study contributes to knowledge by theoretically identifying and empirically testing a set of design principles for educational programming software, and by producing and scientifically evaluating a programming tool as an embodiment of this set. Through this evaluation, the suggestion of Koios as a practically useful programming tool for novices seems to be well supported.

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

Record Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: https://digital.library.txstate.edu/handle/10877/11112

No abstract prepared.

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

Record Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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); Οικονομικό Πανεπιστήμιο Αθηνών

URL: http://hdl.handle.net/10442/hedi/47340

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

▼ 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 the program computes rather than how to compute it". As the adoption of data science grows rapidly, a need for democratizing data analysis tasks by making their development more approachable and less tedious through high-level languages has emerged. Inspired by the success of the declarative paradigm in relational database systems, researchers have recently started exploring whether the use of declarative languages in the domain of data analytics with a focus on machine learning (ML) algorithms can provide a productivity leap for developers. The first part of the thesis conducts a detailed survey of current systems in the area of data analytics and machine learning describing themselves as declarative. The main characteristics of their programming models, as well as the optimization techniques used in these systems, are analyzed through specific code examples. Based on these characteristics the thesis provides a classification of a wide range of systems in the aforementioned area and proposes a set of desired properties for a data analytics/ML system, in order to follow the objectives of the declarative paradigm closer. The second part of the thesis focuses on the expression of ML algorithms with database query languages and on their efficient compilation and execution on specialized mathematical optimization solvers and ML frameworks. The proposed approaches are based on the "model + solver" paradigm, where there is a description of the objective function (a.k.a. loss or cost function) of a machine learning model and a solver that provides the optimal solution for it. First, the thesis explores the use of Datalog as a declarative language to write the components of a linear machine learning algorithm, which is then transformed to a lower-level data representation/format consumed by a linear programming solver. The second approach proposes a method for translating objective functions of ML models written in SQL to linear algebra operators as provided by an ML specialized system, such as TensorFlow. This approach extends on the previous one in that it covers non-linear ML models and it automatically generates code using the primitives of an ML framework, rather than a data format. In both cases the computed solution is stored back to the database, which allows for generating future predictions on test data inside the database. In the context of these approaches, techniques for automating and optimizing data movement between the structures of the database (relations) and the ones of the ML framework (tensors) are proposed. The thesis demonstrates the proposed approaches through prototype systems implementing an end-to-end workflow that starts in the database, pushes the training of the model to an ML library/solver, and stores the computed weights back in the database. Experiments regarding the translation process and data movement optimization…

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

Record Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://hdl.handle.net/2152/561

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

Record Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://hdl.handle.net/10919/33742

► 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 Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://sun.library.msstate.edu/ETD-db/theses/available/etd-04062004-215627/ ;

► 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 Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://hdl.handle.net/2346/19377

► 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 Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://hdl.handle.net/1853/51814

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

▼ 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 degrees in multiple domains. This occurs, for example, in chemical devices such as fuel cells. The declarative or equation-based modeling approach can provide computational advantages and is compatible with physics-based, object-oriented representations. However, there is no generally accepted method of representing coupled advection and diffusion in a declarative modeling framework. This work develops, justifies, and implements a new upstream discretization scheme for mixed advective and diffusive flows that is well-suited for declarative models. The discretization scheme yields a gradual transition from pure diffusion to pure advection without switching events or nonlinear systems of equations. Transport equations are established in a manner that ensures the conservation of material, momentum, and energy at each interface and in each control volume. The approach is multi-dimensional and resolved down to the species level, with conservation equations for each species in each phase. The framework is applicable to solids, liquids, gases, and charged particles. Interactions among species are described as exchange processes which are diffusive if the interaction is inert or advective if it involves chemical reactions or phase change. The equations are implemented in a highly modular and reconfigurable manner using the Modelica language. A wide range of examples are demonstrated—from basic models of electrical conduction and evaporation to a comprehensive model of a proton exchange membrane fuel cell (PEMFC). Several versions of the PEMFC model are simulated under various conditions including polarization tests and a cyclical electrical load. The model is shown to describe processes such as electro-osmotic drag and liquid pore saturation. It can be scaled in complexity from 4000 to 32,000 equations, resulting in a simulation times from 0.2 to 19 s depending on the level of detail. The most complex example is a seven-layer cell with six segments along the length of the channel. The model library is thoroughly documented and made available as a free, open-source software package. Advisors/Committee Members: Paredis, Christiaan J. J. (advisor), Haynes, Comas L. (advisor), Harris, Tequila A. L. (committee member), Sheldon, Jeter M. (committee member), Fuller, Thomas F. (committee member), Moore, Robert M. (committee member).

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

Record Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

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

►

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)

▼

This dissertation is about the development of a parallel software system for representing and solving problems of finite model theory and its application. The theoretical foundation of the system is presented, as well as an in-depth explanation of the implementation in Python. In particular, a parallel method for computing Boolean expressions based on the properties of finite free Boolean algebras is developed. It is also shown how various finite combinatorial objects can be coded in the formalism of Boolean algebras and counted by this procedure. Specifically, using a translation of first order predicate formulas to propositional formulas, we developed a technique for constructing and counting finite models of first order theories. Finally, we have developed some general techniques that enable more effective use of our system. We illustrate these techniques on two examples. The first one deals with partial orders, while the other one is about random graphs.

Ова дисертација се бави развојем паралелног софтверског система за представљање и решавање проблема теорије коначних модела и његовом применом. Износи се теоријска основа система, као и детаљно објашњење имплементације у Пајтону. Конкретно, развијен је паралелан метод за рачунање Булових израза заснован на особинама коначних слободних Булових алгебри. Такође се показује како се различити коначни комбинаторни објекти могу кодирати у формализму Булових алгебри и избројати применом овог поступка. Конкретно, користећи транслацију предикатских формула првог реда на исказне формуле развили смо технику за конструисање и бројање коначних модела теорија првог реда. На крају, развили смо неке опште технике које омогућавају ефективније коришћење нашег система. Ове технике приказујемо на два примера. Први се бави парцијалним уређењима, а други се односи на случајне графове.

Ova disertacija se bavi razvojem paralelnog softverskog sistema za predstavljanje i rešavanje problema teorije konačnih modela i njegovom primenom. Iznosi se teorijska osnova sistema, kao i detaljno objašnjenje implementacije u Pajtonu. Konkretno, razvijen je paralelan metod za računanje Bulovih izraza zasnovan na osobinama konačnih slobodnih Bulovih algebri. Takođe se pokazuje kako se različiti konačni kombinatorni objekti mogu kodirati u formalizmu Bulovih algebri i izbrojati primenom ovog postupka. Konkretno, koristeći translaciju predikatskih formula prvog reda na iskazne formule razvili smo tehniku za konstruisanje i brojanje konačnih modela teorija prvog reda. Na kraju, razvili smo neke opšte tehnike koje omogućavaju efektivnije korišćenje našeg sistema. Ove tehnike prikazujemo na dva primera. Prvi se bavi parcijalnim uređenjima, a drugi se odnosi na slučajne grafove.

Advisors/Committee Members: Gilezan Silvia, Davidović Tatjana, Stojaković Miloš, Popović Miroslav, Ivetić Jelena.

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

Record Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: https://uknowledge.uky.edu/gradschool_theses/223

► 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 Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-126895

► 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 Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://hdl.handle.net/2152/3210

► 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 Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://repositorio.ufpe.br/handle/123456789/15892

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

▼ 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 de forma mais natural. Tais sistemas, em geral, requerem dispositivos de captura junto com alguma técnica de reconhecimento para que os gestos requeridos na interação natural sejam reconhecidos. A ausência de abstrações apropriadas para representação dos gestos dificulta as especificações de novas interações naturais. A representação de um gesto, quase sempre, envolve Aprendizagem de Máquina ou um avançado algoritmo de reconhecimento baseado nos dados da posição tridimensional do corpo humano fornecidos por sensores de profundidade, tal como o Microsoft Kinect. Além disso, as aplicações desenvolvidas tornam-se dependentes das bibliotecas de desenvolvimento dos dispositivos. Dessa forma, se o dispositivo for substituído por outro mais moderno ou de fabricante diferente quase todo o algoritmo de reconhecimento precisa ser reescrito. O principal objetivo desta dissertação é a especificação e implementação da Linguagem para Especificação de Gestos (LEG), uma Domain-Specific Language (DSL) para a especificação e reconhecimento de gestos livres do corpo humano com suporte a diferentes dispositivos de profundidade. A LEG é uma linguagem declarativa, baseada na análise das interfaces gestuais para computador e no estudo das abstrações e representações do movimento humano, a fim de reduzir a complexidade no desenvolvimento de aplicações baseadas em gestos. A implementação da linguagem foi realizada em duas etapas. Primeiro, foi criado um framework (Kinect Gesture) com a lógica para rastrear e identificar gestos descritos na linguagem. Na segunda etapa, foi definida a gramática e o interpretador foi construído. A abordagem adotada foi de DSL externa, sendo sua sintaxe textual e particular. A fim de avaliar a implementação proposta, 15 (quinze) gestos foram especificados em LEG e reconhecidos. Tendo como referência os resultados obtidos, chegou-se a conclusão que a linguagem apresentada neste trabalho diminuiu consideravelmente a complexidade necessária para realizar a especificação e o reconhecimento dos gestos. Advisors/Committee Members: SANTOS, André Luís de Medeiros (advisor).

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 Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://www.theses.fr/2013ISAL0113

►

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)

▼

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. Les systèmes distribués fournissent des fonctionnalités assurées par les noeuds qui forment un réseau et échangent des données et services, éventuellement par le biais de messages. La provenance du service n’est souvent pas pertinente, alors que sa fiabilité est essentielle. Notre objectif est de fournir un nouveau modèle de communication qui permet de spécifier intentionnellement lequel service est demandé, et non les noeuds qui le fournissent. Cette spécification intentionnelle des échanges offre un potentiel pour faciliter la programmation distribuée, garantir la persistance des données dans les messages et la résilience des systèmes, qui constituent le sujet de cette thèse. Nous proposons donc un cadre qui supporte des messages avec destinations intentionnelles, qui sont évaluées uniquement à la volée au fur et à mesure du déplacement des messages. Nous introduisons un langage, Questlog, qui gère les destinations intentionnelles. Contrairement aux langages à base de règles existants pour les réseaux, comme Datalog, qui suivent le mode push, Questlog permet d’exprimer des stratégies complexes afin de récupérer de manière récursive des données distribuées en mode pull. Le langage fonctionne sur une machine virtuelle qui s’appuie sur un SGBD. Nous démontrons l’approche avec des exemples pris dans deux domaines: (i) les architectures orientées données, où une classe restreinte d’applications client-serveur sont distribuées de manière transparente sur les systèmes pair-à-pair basés sur une DHT, (ii) les réseaux de capteurs sans fil, où un protocole de groupement des noeuds en clusters virtuels est proposé pour agréger les données. Dans ce protocole, les chefs des clusters sont élus à l’aide des destinations intentionnelles. Nos simulations sur la plate-forme QuestMonitor montre que cette approche offre une simplicité, une modularité aux protocoles, ainsi qu’une fiabilité accrue.

Distributed programming is a challenging task. It has tremendously gained importance with the wide development of networks, which support an exponentially increasing number of applications. Distributed systems provide functionalities that are ensured by nodes which form a network and exchange data and services possibly through messages. The provenance of the service is often not relevant, while its reliability is essential. Our aim is to provide a new communication model which allows to specify intensionally what service is needed as opposed to which nodes provide it. The intensional specification of exchanges offers a potential to facilitate distributed programming, to provide persistence of data in messages and resilience of systems, that constitute the topic of this thesis. We propose a framework that supports messages with intensional destinations, which are evaluated only on the fly while the messages are traveling. We introduce a rule-based…

Advisors/Committee Members: Ubeda, Stéphane (thesis director), Grumbach, Stéphane (thesis director).

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 Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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, Génie électrique, 2019, Université Grenoble Alpes (ComUE)

URL: http://www.theses.fr/2019GREAT079

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

▼ 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, même si elles offrent l’avantage de facilité de gestion par leur vision globale du réseau, ne supportent pas en pratique la croissance continue des volumes de données (bande passante limitée, goulot d’étranglement, quantité de calculs à assurer, etc.). Le passage à un contrôle et une gestion décentralisée (répartie), où le système est composé d’une multitude d’unités de calcul coopérantes, offre de très bonnes perspectives (robustesse, calcul au plus près des producteurs et consommateurs de données, exploitation de toutes les ressources disponibles), mais reste difficile à mettre en place. En effet, la programmation d’algorithmes distribués nécessite de prendre en compte les échanges de données et la synchronisation des unités participantes, cette complexité augmentant avec le nombre d’unités. Dans cette thèse, nous proposons une approche innovante de programmation de haut niveau d’abstraction masquant ces difficultés.Tout d’abord, nous proposons d’abstraire l’ensemble des unités de calcul du Smartgrid (compteur intelligent, capteurs, concentrateurs de données, etc.) sous forme d’une base de données distribuées. Chaque unité de calcul hébergeant une base de données locale et seules les données nécessaires à la poursuite du calcul sont échangées avec d’autres unités, ce qui diminue l’utilisation de la bande passante disponible. L’utilisation d’un langage de manipulation de données déclaratif simplifiera la programmation des applications de contrôle et de gestion. Nous proposons également SmartLog, un langage à base de règles (basé sur le langage Datalog et ses dérivés) dédié à ces applications. Il facilite la programmation distribuée des applications Smartgrid en réagissant immédiatement à tout changement dans les données.Même avec un langage tel que SmartLog, il est nécessaire de prendre en compte les échanges de données et la synchronisation des participants. C’est pourquoi nous proposons ensuite une approche simplifiant la programmation distribuée. Cette approche, nommée CPDE pour Centralized Programmation and Distributed Execution, consiste en deux étapes : (i) programmer l’application centralisée en SmartLog, car cela est plus facile, et (ii) traduire le programme centralisé en programme distribué en se basant sur la localisation réelle des données. Pour ce faire, nous proposons un algorithme de distribution semi-automatique des règles SmartLog.Afin de démontrer l’intérêt de CPDE, nous avons mené une expérimentation exhaustive en utilisant des applications et des algorithmes réellement utilisés dans les Smartgrids, telles que le contrôle secondaire dans les micro-réseaux isolés ou la régulation de tension équitable. L’expérimentation a été réalisée sur une plate-forme de simulation de réseau électrique temps réel, avec une machine de simulation OPAL-RT, et des un réseau Raspberry-Pi représentant les unités de calcul (leurs performances sont… Advisors/Committee Members: Hadj-Said, Nouredine (thesis director).

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 Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://repository.asu.edu/items/49188

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

Record Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://handle.unsw.edu.au/1959.4/54397 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:34911/SOURCE02?view=true

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

▼ 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 solvers provide good computational performance by conflict-driven nogood learning (CDNL) and exploiting unfounded sets. To model features like finite domain variables and global constraints, which are naturally dealt with in CP, hybrid CASP systems have been developed that delegate CP constructs to a CP solver. While this achieved some success, hybrid systems do not seamlessly integrate with CDNL. We address this deficiency by devising two alternative approaches that accommodate CDNL.For one, we introduce a translation-based approach. The idea is to enhance ASP with CP constructs through translation to ASP. Implemented as preprocessing, this allows us to apply existing CDNL-enabled ASP systems to CASP solving. Our contributions include various generic translations that work for any constraint, and specialised encodings for important global constraints such as ALL-DIFFERENT, GRAMMAR, and REACHABILITY. We show that the inference of ASP solvers can simulate the effect of complex CP algorithms in many cases. Propagation of REACHABILITY, however, can be hindered because ASP systems disregard some consequences from unfounded sets for performance reasons. We tackle this weakness by providing more efficient methods using a reduction to the problem of finding dominators in a flowgraph.For another, we devise an extension to CDNL-based ASP solving that can integrate CP constructs via lazy nogood generation (LNG). Rather than a-priori translations into ASP, the idea of LNG is to make necessary parts of an encoding explicit on demand and only when new information can be propagated. We introduce external propagators to facilitate LNG and incorporate them into a decision procedure for ASP solving that is centred around CDNL. We then demonstrate how to seamlessly integrate constraint propagation with this framework, resulting in a novel approach to CASP solving.We have implemented a prototypical CASP system to demonstrate some key principles of our approaches. In 2013, it has successfully participated in a model and solve competition, outperforming hybrid systems. Advisors/Committee Members: Walsh, Toby, Computer Science & Engineering, Faculty of Engineering, UNSW, Pagnucco, Maurice, Computer Science & Engineering, Faculty of Engineering, UNSW.

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 Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://handle.unsw.edu.au/1959.4/40701 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:1482/SOURCE02?view=true

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

▼ 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 programs define arbitrary dimensional infinite data structures, which are then queried to produce results. The formal foundations of TransLucid come from the work in intensional logic by Montague and Scott.The background chapters give a history of intensional logic and its predecessors in the Western world, as well as a history of intensional programming and Lucid, the first intensional programming language.The semantics of TransLucid are fully specified in the form of operational semantics. Three levels of semantics are given, in increasing order of efficiency, with the sequential warehouse semantics, the most efficient, being presented together with a proof that any expression will be evaluated by only examining relevant dimensions in the current context. The language is then extended in three important ways, by adding versioned identifiers, (declarative) side-effects and timestamped equations and demands.Adding versioned identifiers to TransLucid enriches the expressiveness of the language and allows the encoding of a variety of programming paradigms, ranging from manipulating large data-cubes to pattern-matching.Adding side-effects supports one of the main reasons for TransLucid: namely, to provide a target language, together with a methodology, for translating the main programming paradigms, thus creating a uniform end platform that can be the focus for optimisation and program verification. A translation of imperative programs into TransLucid is given.Timestamped equations and demands enable TransLucid to become a language for synchronous programming in real-time systems, as well as allowing runtime updates to a program's equations.The language TransLucid represents a decisive advance in declarative programming. It has applications in many fields of computer science and opens up exciting new avenues of research.

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 Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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)

URL: http://hdl.handle.net/10442/hedi/11261

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

Record Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://hdl.handle.net/2152/18266

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

▼ 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 an effective approach for checking the correctness of software in general. Constraint-based analysis using specifications enables checking various rich properties by automating generation of test inputs. However, as specifications get more complex, existing analyses face a scalability problem due to state explosion. This dissertation introduces a novel approach to analyze declarative specifications incrementally; presents a constraint prioritization and partitioning methodology to enable efficient incremental analyses; defines a suite of optimizations to improve the analyses further; introduces a novel approach for testing software product lines; and provides an experimental evaluation that shows the feasibility and scalability of the approach. The key insight behind the incremental technique is declarative slicing, which is a new class of optimizations. The optimizations are inspired by traditional program slicing 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. Given an Alloy model, our fully automatic tool, Kato, partitions the model into a base slice and a derived slice using constraint prioritization. As opposed to the conventional use of the Alloy Analyzer, where models are analyzed as a whole, we perform analysis incrementally, i.e., using several steps. A satisfying solution to the base slice is systematically extended to generate a solution for the entire model, while unsatisfiability of the base implies unsatisfiability of the entire model. We show how our incremental technique enables different analysis tools and solvers to be used in synergy to further optimize our approach. Compared to the conventional use of the Alloy Analyzer, this means even more overall performance enhancements for solving declarative models. Incremental analyses have a natural application in the software product line domain. A product line is a family of programs built from features that are increments in program functionality. Given properties of features as firstorder logic formulas, we automatically generate test inputs for each product in a product line. We show how to map a formula that specifies a feature into a transformation that defines incremental refinement of test suites. Our experiments using different data structure product lines show that our approach can provide an order of magnitude speed-up over conventional techniques. Advisors/Committee Members: Khurshid, Sarfraz (advisor).

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…

Record Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://hdl.handle.net/10810/10332

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

▼ 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 is different from the usual one. On the basis of this non-customary inductive definition for eventualities, we first provide dual systems of tableaux and sequents for Propositional Linear-time Temporal Logic (PLTL). Then, we adapt the deductive approach introduced by means of these dual tableau and sequent systems to the resolution framework and we present a clausal temporal resolution method for PLTL. Finally, we make use of this new clausal temporal resolution method for establishing logical foundations for declarative temporal logic programming languages. The key element in the deduction systems for temporal logic is to deal with eventualities and hidden invariants that may prevent the fulfillment of eventualities. Different ways of addressing this issue can be found in the works on deduction systems for temporal logic. Traditional tableau systems for temporal logic generate an auxiliary graph in a first pass.Then, in a second pass, unsatisfiable nodes are pruned. In particular, the second pass must check whether the eventualities are fulfilled. The one-pass tableau calculus introduced by S. Schwendimann requires an additional handling of information in order to detect cyclic branches that contain unfulfilled eventualities. Regarding traditional sequent calculi for temporal logic, the issue of eventualities and hidden invariants is tackled by making use of a kind of inference rules (mainly, invariant-based rules or infinitary rules) that complicates their automation. A remarkable consequence of using either a two-pass approach based on auxiliary graphs or aone-pass approach that requires an additional handling of information in the tableau framework, and either invariant-based rules or infinitary rules in the sequent framework, is that temporal logic fails to carry out the classical correspondence between tableaux and sequents. In this thesis, we first provide a one-pass tableau method TTM that instead of a graph obtains a cyclic tree to decide whether a set of PLTL-formulas is satisfiable. In TTM tableaux are classical-like. For unsatisfiable sets of formulas, TTM produces tableaux whose leaves contain a formula and its negation. In the case of satisfiable sets of formulas, TTM builds tableaux where each fully expanded open branch characterizes a collection of models for the set of formulas in the root. The tableau method TTM is complete and yields a decision procedure for PLTL. This tableau method is directly associated to a one-sided sequent calculus called TTC. Since TTM is free from all the structural rules that hinder the mechanization of deduction, e.g. weakening and contraction, then the resulting sequent calculus TTC is also free from this kind of structural rules. In particular, TTC is free of any kind of cut, including invariant-based cut. From the deduction system TTC, we obtain a two-sided sequent calculus GTC that preserves all these good freeness… Advisors/Committee Members: Lucio Carrasco, Francisca (advisor).

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 Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://hdl.handle.net/20.500.11850/155855

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 Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

URL: http://hdl.handle.net/10315/35495

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

▼ 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 frame problem and predicates for describing agents' knowledge as my base formalism. I further enhance this language by introducing a new sort of infinite paths. Within this language, I discuss how to systematically specify prioritized goals and how to precisely describe the effects of actions on these goals. These actions include adoption and dropping of goals and subgoals. In this framework, an agent's intentions are formally specified as the prioritized intersection of her goals. The ``prioritized'' qualifier above means that the specification must respect the priority ordering of goals when choosing between two incompatible goals. I ensure that the agent's intentions are always consistent with each other and with her knowledge. I investigate two variants with different commitment strategies. Agents specified using the ``optimizing'' agent framework always try to optimize their intentions, while those specified in the ``committed'' agent framework will stick to their intentions even if opportunities to commit to higher priority goals arise when these goals are incompatible with their current intentions. For these, I study properties of prioritized goals and goal change. I also give a definition of subgoals, and prove properties about the goal-subgoal relationship. As an application, I develop a model for a Simple Rational Agent Programming Language (SR-APL) with declarative goals. SR-APL is based on the ``committed agent'' variant of this rich theory, and combines elements from Belief-Desire-Intention (BDI) APLs and the situation calculus based ConGolog APL. Thus SR-APL supports prioritized goals and is grounded on a formal theory of goal change. It ensures that the agent's declarative goals and adopted plans are consistent with each other and with her knowledge. In doing this, I try to bridge the gap between agent theories and practical agent programming languages by providing a model and specification of an idealized BDI agent whose behavior is closer to what a rational agent does. I show that agents programmed in SR-APL satisfy some key rationality requirements. Advisors/Committee Members: Lesperance, Yves (advisor).

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 Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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); Δημοκρίτειο Πανεπιστήμιο Θράκης (ΔΠΘ)

URL: http://hdl.handle.net/10442/hedi/28678

►

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)

▼

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. To achieve this, Fuzzy Logic is used along with Logic Programming, Arithmetic Methods, Neural Networks, Procedural and Declarative Programming. Specifically, after the relevant mathematical background of Fuzzy Arithmetic, Fuzzy Logic and Fuzzy Statistics, generalizations are presented and improvements of existing methods of constraint fuzzy arithmetic, fuzzy estimators as a vehicle to substitute interval arithmetic in statistics and fuzzy or non-fuzzy rules of expert systems produced from data, as well as linguistic neural networks. These methods, by way of various applications-examples of the Dissertation, are used to solve mathematical, technical or economic problems such as statistical estimates, multi-dimensional fits, time-series forecasts, queuing systems analysis, workflow management, industrial control and strategic management. Also, the prototype of a new general purpose declarative language is presented which is used in the Dissertation to the development of expert systems. The developed theory and the examples provided are framed by computer code implementations to make the results of the research of the Dissertation directly applicable.

Στην διατριβή αυτή παρουσιάζεται η ανάπτυξη Έμπειρων Συστημάτων προτείνοντας νέες μεθόδους για την επίλυση Τεχνικών και Οικονομικών προβλημάτων υπό συνθήκες αβεβαιότητας. Προς τούτο γίνεται χρήση Ασαφούς Λογικής παράλληλα με Λογικό Προγραμματισμό, χρήση Αριθμητικών Μεθόδων, Νευρωνικών Δικτύων, Διαδικαστικού και Δηλωτικού Προγραμματισμού. Αναλυτικότερα, μετά από την έκθεση του αντίστοιχου μαθηματικού υποβάθρου της Ασαφούς Αριθμητικής Ασαφούς Λογικής και Ασαφούς Στατιστικής, παρουσιάζονται γενικεύσεις και βελτιώσεις των υπαρχόντων μεθόδων ασαφούς αριθμητικής με περιορισμούς ασαφών εκτιμητών σαν όχημα για την αντικατάσταση της λογικής διαστημάτων στο χώρο της στατιστικής και παράγονται ασαφείς και μη κανόνες έμπειρων συστημάτων από δεδομένα και γλωσσικά νευρωνικά δίκτυα. Οι μέθοδοι αυτές μέσα από τις ποικίλες εφαρμογές-παραδείγματα της Διατριβής χρησιμοποιούνται για την επίλυση μαθηματικών, τεχνικών είτε οικονομικών προβλημάτων όπως στατιστικές εκτιμήσεις, πολυδιάστατες προσαρμογές, πρόβλεψη χρονοσειρών, ουρές αναμονής, διαχείριση ροών εργασιών, βιομηχανικός έλεγχος και στρατηγικό μάνατζμεντ. Επίσης, παρουσιάζεται το πρότυπο μίας νέας γλώσσας Δηλωτικού Προγραμματισμού γενικού σκοπού, που χρησιμοποιείται στην Διατριβή για την ανάπτυξη έμπειρων συστημάτων. Η αναπτυχθείσα θεωρία και παραδείγματα πλαισιώνονται με υλοποιήσεις σε πραγματικό κώδικα Η/Υ, που κάνουν πρακτικά εφαρμόσιμα τα αποτελέσματα της έρευνας της Διατριβής.

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

Record Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 (7^th 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

		in
And / Or
		in
And / Or
		in
And / Or
		in

Open Access Theses and Dissertations