• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 135
  • 34
  • 8
  • 6
  • 4
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • Tagged with
  • 247
  • 247
  • 82
  • 50
  • 40
  • 37
  • 36
  • 33
  • 29
  • 29
  • 28
  • 26
  • 24
  • 23
  • 22
  • 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

Focused inverse method for LF

Li, Xi, January 1900 (has links)
Thesis (M.Sc.). / Written for the School of Computer Science. Title from title page of PDF (viewed 2008/05/14). Includes bibliographical references.
2

Task Interaction and Control System (TICS) /

Grossman, Mark, January 1987 (has links)
Thesis (Ph. D.)--Oregon Graduate Center, 1987.
3

Ordinal-theoretic properties of logic programs

Bagai, Rajiv 19 June 2018 (has links)
The work described in this dissertation is mainly a study of some ordinal-theoretic properties of logic programs that are related to the downward powers of their immediate-consequence functions. The downward powers for any program give rise to an interesting non-increasing sequence of interpretations, whose point of convergence is called the downward closure ordinal of that program. The last appearance of ground atoms that get eliminated somewhere in this sequence is called their downward order. While it is well-known that there is no general procedure that can determine downward orders of atoms in any program, we present some rules for constructing such a procedure for a restricted class of programs. Another existing result is that for every ordinal up to and including the least non-recursive ordinal [special characters omitted] there is a logic program having that ordinal as its downward closure ordinal. However, the literature contains only a few examples of programs, constructed in an ad hoc manner, with downward closure ordinal greater than the least transfinite ordinal (ω). We contribute to bridging this wide gap between the abstract and concrete knowledge by showing the connection between some of the existing examples and the well-known concept of the order of a vertex in a graph. Using this connection and a convenient notation system for ordinals involving ground terms as bases, we construct a family [special characters omitted] of logic programs where [special characters omitted] is the least fixpoint of the function λβ[ωβ] and any member Pα of the family has downward closure ordinal ω + α. We also present an organization of a general transformation system, in which the objective is to search for transformations on syntax objects that satisfy pre-established semantic constraints. As desired transformations are not always guaranteed to exist, we present necessary and sufficient conditions for their existence. In this framework, we proceed to give transformations on logic programs for the successor and addition operations on their downward closure ordinals. / Graduate
4

The Clausal Theory of Types

Wolfram, David Anthony January 1990 (has links)
No description available.
5

A logic-based concurrent object-oriented programming language

Melendez, Rafael Ramirez January 1996 (has links)
No description available.
6

Effective meta-programming in declarative languages

Bowers, Antony Francis January 1998 (has links)
No description available.
7

Over-constrained systems in CLP and CSP

Jampel, Michael Benjamin January 1996 (has links)
No description available.
8

And-parallel implementation of Prolog on distributed memory machines

Verden, Andrew Roy January 1991 (has links)
No description available.
9

A representation language based on a game-theoretic interpretation of logic

Jackson, E. P. January 1987 (has links)
No description available.
10

Parallel execution of Parlog

Cheese, Andrew B. January 1990 (has links)
No description available.

Page generated in 0.0973 seconds