• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 5
  • 2
  • 1
  • Tagged with
  • 12
  • 12
  • 5
  • 3
  • 2
  • 2
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Investigations into Martin-Löf type theory as a programming logic

Chisholm, Paul January 1988 (has links)
No description available.
2

Towards a semantics bridge between structured specifications and logic specifications /

Leung, Ping-hung, Karl Richard. January 1992 (has links)
Thesis (M. Phil.)--University of Hong Kong, 1992.
3

Computing stable models of logic programs

Singhi, Soumya 01 January 2003 (has links)
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 thesis, we present a search heuristic that we can cr-smodels. cr-smodels prunes the search space to quickly reach to the solution of a problem. The idea is to pick an atom for branching , that lowers the growth rate of the linear recurrence and thuse, minimizes the remaining search space. Our goal in developing cr-smodels is to develop a search heuristic that is efficient on a wide range of problems. Then, we test cr-smodels over a wide range of randomly generated benchmarks. we observed that often randomly generated graphs with no Hamiltonian cycle were trivial to solve. Since, Hamiltonian cycle is an important benchmark problem, my other goal is to develop techniques that generate hard instances of graphs with no Hamiltonian cycle.
4

Hazard detection with VHDL in combinational logic circuits with fixed delays /

Chu, Ming-Cheung, January 1992 (has links)
Thesis (M.S.)--Virginia Polytechnic Institute and State University, 1992. / Vita. Abstract. Includes bibliographical references (leaves 181-182). Also available via the Internet.
5

Nonclausal logic programming /

Malachi, Yonathan. January 1900 (has links)
Thesis (Ph. D.)--Stanford University, 1986. / Cover title. "March 1986." Includes bibliographical references.
6

An investigation of design and execution alternatives for the committed choice non-deterministic logic languages

Trehan, Rajiv January 1989 (has links)
The general area of developing, applying and studying new and parallel models of computation is motivated by a need to overcome the limits of current Von Neumann based architectures. A key area of research in understanding how new technology can be applied to Al problem solving is through using logic languages. Logic programming languages provide a procedural interpretation for sentences of first order logic, mainly using a class of sentence called Horn clauses. Horn clauses are open to a wide variety of parallel evaluation models, giving possible speed-ups and alternative parallel models of execution. The research in this thesis is concerned with investigating one class of parallel logic language known as Committed Choice Non-Deterministic languages. The investigation considers the inherent parallel behaviour of Al programs implemented in the CCND languages and the effect of various alternatives open to language implementors and designers. This is achieved by considering how various Al programming techniques map to alternative language designs and the behaviour of these Al programs on alternative implementations of these languages. The aim of this work is to investigate how Al programming techniques are affected (qualitatively and quantitatively) by particular language features. The qualitative evaluation is a consideration of how Al programs can be mapped to the various CCND languages. The applications considered are general search algorithms (which focuses on the committed choice nature of the languages); chart parsing (which focuses on the differences between safe and unsafe languages); and meta-level inference (which focuses on the difference between deep and flat languages). The quantitative evaluation considers the inherent parallel behaviour of the resulting programs and the effect of possible implementation alternatives on this inherent behaviour. To carry out this quantitative evaluation we have implemented a system which improves on the current interpreter based evaluation systems. The new system has an improved model of execution and allows several
7

Expressiveness of answer set languages

Ferraris, Paolo, January 1900 (has links)
Thesis (Ph. D.)--University of Texas at Austin, 2007. / Vita. Includes bibliographical references.
8

Μοντελοποίηση και ιεραρχικός ευφυής έλεγχος συστημάτων με ασαφή γνωστικά δίκτυα

Στύλιος, Χρυσόστομος 11 December 2009 (has links)
- / -
9

Απομακρυσμένη διαχείριση και έλεγχος βιομηχανικών εφαρμογών (μονάδα εμφιάλωσης) μέσω Labview με PLC

Αποστολόπουλος, Ανδρέας 27 December 2010 (has links)
Στην παρούσα διπλωματική εργασία παρουσιάζεται τμήμα ενός αυτοματισμού μιας βιομηχανικής διεργασίας. Πιο συγκεκριμένα, αφορά το γέμισμα φιαλών και την εποπτεία τους. Για τον έλεγχο του αυτοματισμού χρησιμοποιείται ένας προγραμματιζόμενος λογικός ελεγκτής (PLC) της σειράς SIMATIC S7 300 της Siemens, ενώ η εποπτεία θα γίνεται μέσω Ηλεκτρονικού Υπολογιστή και της εφαρμογής LABVIEW 2009 με την χρήση του NI OPC Servers της National Instruments. Για να ξεκινήσει η κάθε παρτίδα παραγωγής, ο χειριστής οφείλει να εκτελέσει τις εξής ενέργειες : 1) Να ελέγξει αν έχει στάθμη το tank. 2) Να τοποθετήσει φιάλες στο αστέρι. 3) Πιέζει το reset (μπλε μπουτόν), το μηχάνημα είναι έτοιμο και βρίσκεται σε κατάσταση standby. 4) Πιέζει το start (πράσινο μπουτόν), το μηχάνημα είναι ενεργοποιημένο και αρχίζει το γέμισμα. Στο πρώτο μέρος της γραπτής εργασίας, κεφάλαιο 1, κεφάλαιο 2, γίνεται μία εισαγωγή στα PLCs όσον αφορά την εγκατάσταση, διαμόρφωση, δομή, τον προγραμματισμό και τη λειτουργία τους. Οι βασικές αρχές που αναφέρονται ισχύουν σε γενικές γραμμές για όλα τα PLCs, αλλά οι αναφορές είναι στοχευμένες στη σειρά S7-300 της Siemens μια και αυτός είναι ο τύπος του PLC με το οποίο έχει υλοποιηθεί το πρακτικό μέρος της ειδικής επιστημονικής εργασίας. Στο δεύτερο μέρος, κεφάλαιο 3, κεφάλαιο 4, κεφάλαιο 5 γίνεται αναφορά στον προγραμματισμό και τη διαμόρφωση του PLC, μέσω του λογισμικού πακέτου STEP-7 – Simatic Manager. Στο τρίτο μέρος, κεφάλαιο 6, κεφάλαιο 7, κεφάλαιο 8 γίνεται αναφορά στον προγραμματισμό και τη διαμόρφωση του HMI, μέσω του λογισμικού πακέτου LABVIEW 2009 και την χρήση του NI OPC Servers της National Instruments. / In this thesis it is presented a part of an automatism of industrial process. More specifically it has to do with the filling of bottles and their supervision. For the test of the automatism it is used a programming logic control (PLC) of the series SIMATIC S7-300 of Siemens while the check will be done via both a PC and the application of Labview 2009 by the use of NI OPC servers of National Instrument. In order to begin every part of production , the operator has to carry out the following actions: 1) To check if the tank has the right level. 2) To put the bottles to the star. 3) To press the reset (the blue button) the machine is ready and is placed in the standby situation. 4) To press the start (green button), the machine is in function and the filling is starting. In the first part of this thesis, in unit 1, unit 2, is made an introduction for PLC as far as the installation is concerned, the formation, the structure the programming and their functions. The basic principles which are being referred are in force generally for the all PLC, but the references are aimed in the series S7-300 of Siemens, as this is the main type of PLC by which the practical part of this thesis has been created. In the second part, in unit 3, unit 4, unit 5, is made a mention the programming and the formation of PLC, through the software Step 7 Simatic Manager. In the third part, unit 6, unit 7, unit 8 is made a mention on the programming and the formation of HMI, through the software Labview 2009 and the use of NI OPC Servers of National Instruments.
10

PrologPF : parallel logic and functions on the Delphi machine

Lewis, Ian January 1998 (has links)
PrologPF is a parallelising compiler targeting a distributed system of general purpose workstations connected by a relatively low performance network. The source language extends standard Prolog with the integration of higher-order functions. The execution of a compiled PrologPF program proceeds in a similar manner to standard Prolog, but uses oracles in one of two modes. An oracle represents the sequence of clauses used to reach a given point in the problem search tree, and the same PrologPF executable can be used to build oracles, or follow oracles previously generated. The parallelisation strategy used by PrologPF proceeds in two phases, which this research shows can be interleaved. An initial phase searches the problem tree to a limited depth, recording the discovered incomplete paths. In the second phase these paths are allocated to the available processors in the network. Each processor follows its assigned paths and fully searches the referenced subtree, sending solutions back to a control processor. This research investigates the use of the technique with a one-time partitioning of the problem and no further scheduling communication, and with the recursive application of the partitioning technique to effect dynamic work reassignment. For a problem requiring all solutions to be found, execution completes when all the distributed processors have completed the search of their assigned subtrees. If one solution is required, the execution of all the path processors is terminated when the control processor receives the first solution. The presence of the extra-logical Prolog predicate cut in the user program conflicts with the use of oracles to represent valid open subtrees. PrologPF promotes the use of higher-order functional programming as an alternative to the use of cut. The combined language shows that functional support can be added as a consistent extension to standard Prolog.

Page generated in 0.0834 seconds