Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 30 for “"Logic programming languages"”.

  1. Infinite-game semantics for logic programming languages

    … thesis focuses on the study of the semantics of logic programs and the development of infinite games of perfect information between two players that capture this semantics. Initially, we study propositional logic programming. In [M.H. van Emden, Quantitative deduction and its fixpoint theory, …

    greece Repository record for Infinite-game semantics for logic programming languages (opens in a new tab)

  2. On Compiling Logic Programs Into Relational Algebra

    The combination of logic programming methods and database systems technology will result in knowledge bases of increased size and improved efficiency: this topic has received a lot of attention [Zaniolo 1985, Reiter 1978, Chang 1986, Minker 1978, Henschen 1984, Parker 1986, Brodie 1986]. Our …

    glasgow Download PDF for On Compiling Logic Programs Into Relational Algebra (opens in a new tab)

  3. Logic programming as a formalism for specification and implementation of computer systems

    The expressive power of logic-programming languages allows utilization of conventional constructs in development of computer systems based on logic programming. However, logic-programming languages have many novel features and capabilities. This thesis investigates how advantage can be taken of …

    ubc Repository record for Logic programming as a formalism for specification and implementation of computer systems (opens in a new tab) Download PDF for Logic programming as a formalism for specification and implementation of computer systems (opens in a new tab)

  4. Numerical computation as deduction in constraint logic programming

    Logic programming realizes the ideal of "computation as deduction," except when floating-point arithmetic is involved. In that respect, logic programming languages suffer the same deficiency as conventional algorithmic languages: floating-point operations are only approximate and it is not easy to …

    uvic Repository record for Numerical computation as deduction in constraint logic programming (opens in a new tab)

  5. Declarative Programming via Term Rewriting

    I present a new approach to implementing weighted logic programming languages. I first present a bag-relational algebra that is expressive enough to capture the desired denotational semantics, directly representing the recursive conjunctions, disjunctions, and aggregations that are specified by a …

    jhu Repository record for Declarative Programming via Term Rewriting (opens in a new tab)

  6. Approaches to procedural adequacy in logic programming using connection graphs

    … graph method provides a representation for logic programs which allows for the incorporation of better procedural control techniques than standard logic programming languages. A proposed search strategy for visual recognition which combines top-down and bottom-up techniques has been …

    ubc Repository record for Approaches to procedural adequacy in logic programming using connection graphs (opens in a new tab) Download PDF for Approaches to procedural adequacy in logic programming using connection graphs (opens in a new tab)

  7. An environment theory with precomplete negation over pairs

    … to this semantics is given. Then, a logic programming system is described in the form of a computational proof theory for the Gilmore semantics. This system uses parallel disjunction and the technique of precomplete negation; these features are shown to make it more complete than …

    ubc Repository record for An environment theory with precomplete negation over pairs (opens in a new tab) Download PDF for An environment theory with precomplete negation over pairs (opens in a new tab)

  8. Exploiting and/or Parallelism in Prolog

    Logic programming languages have generated increasing interest over the last few years. Logic programming languages like Prolog are being explored for different applications. Prolog is inherently parallel. Attempts are being made to utilize this inherent parallelism. There are two kinds of …

    portland-state Repository record for Exploiting and/or Parallelism in Prolog (opens in a new tab)

  9. Dyna 2: Towards a General Weighted Logic Language

    … of an expressive, purely-declarative, weighted logic programming language, Dyna. Dyna is a decade-plus effort in pushing the boundaries of declarative programming and “executable mathematics;” it instantiates an unusual point in the design space, as it is both Turing-complete (unlike Datalog) …

    jhu Repository record for Dyna 2: Towards a General Weighted Logic Language (opens in a new tab)

  10. Computational Natural Deduction

    The formalization of the notion of a logically sound argument as a natural deduction proof offers the prospect of a computer program capable of constructing such arguments for conclusions of interest. We present a constructive definition for a new subclass of natural deduction proofs, called atomic …

    anu Repository record for Computational Natural Deduction (opens in a new tab)

  11. Functional Logic Programming with Static Determinism Analysis

    … implementation, and analysis of functional logic programming languages with a particular focus on the combination of lazy evaluation and non-determinism. Functional logic languages combine functional and logic programming paradigms, enabling a flexible and expressive programming environment. …

    cau-kiel Repository record for Functional Logic Programming with Static Determinism Analysis (opens in a new tab)

  12. xpProlog : high performance extended pure prolog

    Adhering to the principles of logic programming results in greater expressiveness than is obtained by using the many non-logical features which have been grafted onto current logic programming languages such as Prolog. This report describes an alternative approach to high performance logic …

    ubc Repository record for xpProlog : high performance extended pure prolog (opens in a new tab) Download PDF for xpProlog : high performance extended pure prolog (opens in a new tab)

  13. Visualization of logic programming

    … that visually depict the execution processes of programming languages. It is believed that visual traces of program execution in some language may help to expedite the learning of those that are unfamiliar with that language. In particular, the execution processes of logic programming languages …

    eastern-wash Repository record for Visualization of logic programming (opens in a new tab)

  14. A formal theory for reasoning about action, knowledge and time

    … present a way to implement the framework using logic programming languages

    greece Repository record for A formal theory for reasoning about action, knowledge and time (opens in a new tab)

  15. Intensional logic programming

    This dissertation presents an investigation of logic programming based on intensional logic. Through intensional logic, the notion of dynamic change and the ability to reason about context-dependent properties can be brought back into logic programming without any extra-logical or non-logical …

    uvic Repository record for Intensional logic programming (opens in a new tab)

  16. A PARALLEL LOGIC PROGRAMMING SYSTEM BASED ON BALINDA LISP : AN IMPLEMENTATION OF FLAT GUARDED HORN CLASUES

    … we present the parallel implementation of a Logic programming language called FGHC based on BaLinda Lisp under a distributed parallel environment in order to explore the application of BaLinda Lisp as a tool to implement a parallel logic system. BaLinda Lisp is a parallel Lisp dialect …

    nus Repository record for A PARALLEL LOGIC PROGRAMMING SYSTEM BASED ON BALINDA LISP : AN IMPLEMENTATION OF FLAT GUARDED HORN CLASUES (opens in a new tab) Download file for A PARALLEL LOGIC PROGRAMMING SYSTEM BASED ON BALINDA LISP : AN IMPLEMENTATION OF FLAT GUARDED HORN CLASUES (opens in a new tab)

  17. Automated reasoning about actions

    … of \loop formulas" that originated from logi programming under the answer set semanti s.

    texas Repository record for Automated reasoning about actions (opens in a new tab)

  18. Modeling hybrid domains using process description language

    … in the field of knowledge representation and logic programming are constantly trying to come up with better ways to represent knowledge. One of the recent attempts is to model dynamic domains. A dynamic domain consists of actions that are capable of changing the properties of objects in the …

    ttu Repository record for Modeling hybrid domains using process description language (opens in a new tab)

  19. An implementation of the language lambda Prolog organized around higher-order pattern unification.

    … by computer-based algebraic systems, and logic formulas and proofs by automatic proof systems and proof assistants. The notion of bound variables plays an important role in the structures of such syntactic objects, and should therefore be reflected in their representations and properly …

    umn Repository record for An implementation of the language lambda Prolog organized around higher-order pattern unification. (opens in a new tab)

  20. Needed Narrowing as the Computational Strategy of Evaluable Functions in an Extension of Goedel

    A programming language that combines the best aspects of both the functional and logic paradigms with a complete evaluation strategy has been a goal of a Portland State University project team for the last several years. I present the third in a series of modifications to the compiler of the logic …

    portland-state Repository record for Needed Narrowing as the Computational Strategy of Evaluable Functions in an Extension of Goedel (opens in a new tab)

Page 1 of 2