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

Coupled resolution engines for programming knowledge based systems in logic

Taylor, Hamish January 1989 (has links)
No description available.

Disjunctive deductive databases.

January 1996 (has links)
by Hwang Hoi Yee Cothan. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1996. / Includes bibliographical references (leaves 68-70). / Abstract --- p.ii / Acknowledgement --- p.iii / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Objectives of the Thesis --- p.1 / Chapter 1.2 --- Overview of the Thesis --- p.7 / Chapter 2 --- Background and Related Work --- p.8 / Chapter 2.1 --- Deductive Databases --- p.8 / Chapter 2.2 --- Disjunctive Deductive Databases --- p.10 / Chapter 2.3 --- Model tree for disjunctive deductive databases --- p.11 / Chapter 3 --- Preliminary --- p.13 / Chapter 3.1 --- Disjunctive Logic Program --- p.13 / Chapter 3.2 --- Data-disjunctive Logic Program --- p.14 / Chapter 4 --- Semantics of Data-disjunctive Logic Program --- p.17 / Chapter 4.1 --- Model-theoretic semantics --- p.17 / Chapter 4.2 --- Fixpoint semantics --- p.20 / Chapter 4.2.1 --- Fixpoint operators corresponding to the MMSpDD --- p.22 / Chapter 4.2.2 --- "Fixpoint operator corresponding to the contingency model, CMP" --- p.25 / Chapter 4.3 --- Equivalence between the model-theoretic and fixpoint semantics --- p.26 / Chapter 4.4 --- Operational Semantics --- p.30 / Chapter 4.5 --- Correspondence with the I-table --- p.31 / Chapter 5 --- Disjunctive Deductive Databases --- p.33 / Chapter 5.1 --- Disjunctions in deductive databases --- p.33 / Chapter 5.2 --- Relation between predicates --- p.35 / Chapter 5.3 --- Transformation of Disjunctive Deductive Data-bases --- p.38 / Chapter 5.4 --- Query answering for Disjunctive Deductive Data-bases --- p.40 / Chapter 6 --- Magic for Data-disjunctive Deductive Database --- p.44 / Chapter 6.1 --- Magic for Relevant Answer Set --- p.44 / Chapter 6.1.1 --- Rule rewriting algorithm --- p.46 / Chapter 6.1.2 --- Bottom-up evaluation --- p.49 / Chapter 6.1.3 --- Examples --- p.49 / Chapter 6.1.4 --- Discussion on the rewriting algorithm --- p.52 / Chapter 6.2 --- Alternative algorithm for Traditional Answer Set --- p.54 / Chapter 6.2.1 --- Rule rewriting algorithm --- p.54 / Chapter 6.2.2 --- Examples --- p.55 / Chapter 6.3 --- Contingency answer set --- p.56 / Chapter 7 --- Experiments and Comparison --- p.57 / Chapter 7.1 --- Experimental Results --- p.57 / Chapter 7.1.1 --- Results for the Traditional answer set --- p.58 / Chapter 7.1.2 --- Results for the Relevant answer set --- p.61 / Chapter 7.2 --- Comparison with the evaluation method for Model tree --- p.63 / Chapter 8 --- Conclusions and Future Work --- p.66 / Bibliography --- p.68

Language interoperability and logic programming languages

Cook, Jonathan J. January 2005 (has links)
We discuss P#, our implementation of a tool which allows interoperation between a concurrent superset of the Prolog programming language and C#. This enables Prolog to be used as a native implementation language for Microsoft's .NET platform. P# compiles a linear logic extension of Prolog to C# source code. We can thus create C# objects from Prolog and use C#'s graphical, networking and other libraries. P# was developed from a modified port of the Prolog to Java translator, Prolog Cafe. We add language constructs on the Prolog side which allow concurrent Prolog code to be written. We add a primitive predicate which evaluates a Prolog structure on a newly forked thread. Communication between threads is based on the unification of variables contained in such a structure. It is also possible for threads to communicate through a globally accessible table. All of the new features are available to the programmer through new built-in Prolog predicates. We present three case studies. The first is an application which allows several users to modify a database. The users are able to disconnect from the database and to modify their own copies of the data before reconnecting. On reconnecting, conflicts must be resolved. The second is an object-oriented assistant, which allows the user to query the contents of a C# namespace or Java package. The third is a tool which allows a user to interact with a graphical display of the inheritance tree. Finally, we optimize P#'s runtime speed by translating some Prolog predicates into more idiomatic C# code than is produced by a naive port of Prolog Cafe. This is achieved by observing that semi-deterministic predicates (being those which always either fail or succeed with exactly one solution) that only call other semi-deterministic predicates enjoy relatively simple control flow. We make use of the fact that Prolog programs often contain predicates which operate as functions, and that such predicates are usually semi-deterministic.

A workbench to develop ILP systems

Azevedo, João de Campos January 2010 (has links)
Tese de mestrado integrado. Engenharia Informática e Computação. Faculdade de Engenharia. Universidade do Porto. 2010

Recognition of identical stubs in a decision table processor

Lu, Chi-Dong January 2010 (has links)
Digitized by Kansas Correctional Industries

An integration of reduction and logic for programming languages

Wright, David A January 1988 (has links)
A new declarative language is presented which captures the expressibility of both logic programming languages and functional languages. This is achieved by conditional graph rewriting, with full unification as the parameter passing mechanism. The syntax and semantics are described both formally and informally, and examples are offered to support the expressibility claim made above. The language design is of further interest due to its uniformity and the inclusion of a novel mechanism for type inference in the presence of derived type hierarchies

Forgetting in logic programs

Wong, Ka-Shu, Computer Science & Engineering, Faculty of Engineering, UNSW January 2009 (has links)
Forgetting is an operation which removes information from a set of logical statements, such that a) the language used by the logic is simplified; and b) as much information as possible from the original logical statements are preserved. Forgetting operations are useful in a variety of contexts, including knowledge representation, where it is necessary to have an operation for removing information from knowledge bases; and the problem of relevance, where logical statements are simplified by removing irrelevant information. In this thesis we consider forgetting operations on logic programs with negation-as-failure according to the stable model semantics. There are existing notions of forgetting on logic programs in the literature: the strong forgetting and weak forgetting of Zhang and Foo, and the semantic approach to forgetting introduced by Wang et al. However, these notions are inadequate: the strong and weak forgettings are defined syntactically with no obvious connections to semantic notions of forgetting; while the semantic approach of Wang et al. does not take into account ``hidden'' information encoded in unused rules. The idea of equivalence on logic programs capture the extent of information contained in a logic program. We consider that two logic programs are equivalent iff the two programs contain the same information. For logic programs, there are many different possible notions of equivalence. We look at the well-known notion of strong equivalence and a new notion of equivalence which we call T-equivalence. Associated with each of these equivalences is a consequence relation on logic program rules. We present sound and complete set of inference rules for both consequence relations. We present a novel approach to logic program forgetting which uses as its basis a set of postulates, which are defined relative to a notion of equivalence. We show that if we use T-equivalence as the equivalence relation, then the only possible forgetting operations (up to equivalence) are strong forgetting and weak forgetting. If strong equivalence is used instead, then there are also only two possible forgetting operations (up to equivalence).

A parallel process model and architecture for a Pure Logic Language

Jelly, Innes E. January 1990 (has links)
The research presented in this thesis has been concerned with the use of parallel logic systems for the implementation of large knowledge bases. The thesis describes proposals for a parallel logic system based on a new logic programming language, the Pure Logic Language. The work has involved the definition and implementation of a new logic interpreter which incorporates the parallel execution of independent OR processes, and the specification and design of an appropriate non shared memory multiprocessor architecture. The Pure Logic Language which is under development at JeL, Bracknell, differs from Prolog in its expressive powers and implementation. The resolution based Prolog approach is replaced by a rewrite rule technique which successively transforms expressions according to logical axioms and user defined rules until no further rewrites are possible. A review of related work in the field of parallel logic language systems is presented. The thesis describes the different forms of parallelism within logic languages and discusses the decision to concentrate on the efficient implementation of OR parallelism. The parallel process model for the Pure Logic Language uses the same execution technique of rule rewriting but has been adapted to implement the creation of independent OR processes and the required message passing operations. The parallelism in the system is implemented automatically and, unlike many other parallel logic systems there are no explicit program annotations for the control of parallel execution. The spawning of processes involves computational overheads within the interpreter: these have been measured and results are presented. The functional requirements of a multiprocessor architecture are discussed: shared memory machines are not scalable for large numbers of processing elements, but, with no shared memory, data needed by offspring processors must be copied from the parent or else recomputed. The thesis describes an optimised format for the copying of data between processors. Because a one-to-many communication pattern exits between parent and offspring processors a broadcast architecture is indicated. The development of a system based on the broadcasting of data packets represents a new approach to the parallel execution of logic languages and has led to the design of a novel bus based multiprocessor architecture. A simulation of this multiprocessor architecture has been produced and the parallel logic interpreter mapped onto it: this provides data on the predicted performance of the system. A detailed analysis of these results is presented and the implications for future developments to the proposed system are discussed.

Concurrent and distributed functional systems

Spiliopoulou, Eleni January 2000 (has links)
No description available.

A formalism for representing qualified knowledge and its implementation for large knowledge bases

Jiang, Y. J. January 1986 (has links)
No description available.

Page generated in 0.1487 seconds