Search for dissertations about: "Logic programming"

Showing result 1 - 5 of 78 swedish dissertations containing the words Logic programming.

  1. 1. Representation of Compositional Relational Programs

    Author : Görkem Paçacı; Andreas Hamfelt; Alberto Pettorossi; Uppsala universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Programming; Syntax; Logic Programming; Combilog; CombInduce; Prolog; Variable-free; Point-free; Tacit; Compositional Relational Programming; Combinatory Logic; Predicate-Functor Logic; Program Synthesis; Meta-interpreters; Meta-interpretative Synthesis; Decompositional Synthesis; Inductive Synthesis; Inductive Logic Programming; Usability; Cognitive Dimensions of Notations; Visual Variables; Usability testing; Programming Language usability; Empirical evidence; Informationssystem; Information Systems;

    Abstract : Usability aspects of programming languages are often overlooked, yet have a substantial effect on programmer productivity. These issues are even more acute in the field of Inductive Synthesis, where programs are automatically generated from sample expected input and output data, and the programmer needs to be able to comprehend, and confirm or reject the suggested programs. READ MORE

  2. 2. Field Programmable Gate Arrays and Reconfigurable Computing in Automatic Control

    Author : Carl Wilhelmsson; Förbränningsmotorer; []
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; systems analysis; FPGA; Field Programmable Gate Array; programming; Compendex: Field programmable gate arrays FPGA ; programming environments; computer science; programmable controllers; observers; adaptive control; modelling; closed loop systems; logic CAD; control systems; reconfigurable architectures; field programmable gate arrays; Computer Programming; telecommunication control; Control system applications; Real time control; Computer control systems; Control systems; Engine Control; Heat release analysis; Cylinder pressure; power-train control; Vehicle control; High speed; Rapid Prototyping; Combustion control; Automotive control; Control application; High frequency; Computer control; Feedback Control; Closed loop systems; Control; Reconfigurable computing; Reconfigurable hardware; VLSI; Closed loop control; programmable logic arrays; Automatic Control; System on Chip SoC ;

    Abstract : New combustion engine principles increase the demands on feedback combustion control, at the same time economical considerations currently enforce the usage of low-end control hardware limiting implementation possibilities. Significant development is simultaneously and continuously carried out within the field of Field Programmable Gate Arrays (FPGAs). READ MORE

  3. 3. Computational Issues in Calculi of Partial Inductive Definitions

    Author : Per Kreuger; RISE; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Theory of computation; algorithms; logic; proof-theory; partial inductive defi-nitions; definitional reflection; disunification; closure; completion; negation; constructive negation; quantification; logic programming; meta programming; quantification; skolemization; self-reference; program semantics; declarative control; proof-search; theorem-proving.;

    Abstract : We study the properties of a number of algorithms proposed to explore the computational space generated by a very simple and general idea: the notion of a mathematical definition and a number of suggested formal interpretations ofthis idea. Theories of partial inductive definitions (PID) constitute a class of logics based on the notion of an inductive definition. READ MORE

  4. 4. Tabulation-based Logic Programming : A Multi-level View of Query Answering

    Author : Lars Degerstedt; Teodor C. Przymusinski; Ulf Nilsson; University of California at Riverside; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Deductive databases; Partial deduction procedure; Tabulated resolution; Programmering; Databashanteringssystem Programspråk;

    Abstract : .... READ MORE

  5. 5. Testing for ASP—ASP for Testing

    Author : Johannes Oetsch; Hans Tompits; Österreich Technische Universität Wien Institut für Logic and Computation; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Logic Programming; Answer-Set Programming; Mutation Testing; Random Testing; Structural Testing; Unit Testing; Program Annotations; Combinatorial Interaction Testing; Event-Sequence Testing; Programming Support;

    Abstract : Answer-set programming (ASP) is a prominent approach for declarative problem solving with roots in non-monotonic reasoning, knowledge representation, and logic programming. As a problem solving paradigm, it means that properties of problem solutions are modelled using declarative rules so that an ASP solver can then be used to search for solutions which are referred to as answer sets. READ MORE