• 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.
21

Agent theories and architectures

Seel, Nigel January 1989 (has links)
Cognitive Science attempts to study entities which in some sense possess beliefs, intentions, desires etc. The preferred term in this thesis for such entities is agents. An attempt at a scientific analysis of agents however throws up a number of questions. What are the right concepts to describe agents? What kinds of formal notations permit perspicuous reasoning about agents? What can be said about the architecture and construction of agents? The introductory section of this thesis discusses these questions in some detail, using Dennett's ideas about intentional systems [Den87] as a point of departure. I then examine a number of studies from Artificial Intelligence, Logic, Natural Language semantics and Philosophy which give shape to the current state of the art in agent theory. This leads to the development of a mathematical model of multi-object/agent interaction, which I call the SRS-model (SRS - Synchronous Reactive Systems). I demonstrate the adequacy of the model by using it to formalise learning and games scenarios. Next, various logics are introduced which capture input-output and then belief-desire level descriptions of agents. These logics are given an SRS-model semantics, and adequacy is shown by modelling a psychological experiment (an agent in a Skinner Box). It is shown how the example can be formally analysed in terms of mechanisms and architecture at the SRS-level (including a computer simulation); at the level of behaviourism (using a temporal logic - APTL); and at an intentional level (using an epistemic-conative temporal logic ECTL). Some remarks are made about extending the analysis to multi-agent situations involving co-operation, competition and dialogue. Finally, a detailed survey is made of the main mathematical and logical resources available to the style of formal cognitive science advocated in this thesis. I include modal logic, including its epistemic and doxastic variants; the extension of modal logic to dynamic logic; and the various approaches recently developed in the logic of time.
22

Gazing : a technique for controlling the use of rewrite rules

Plummer, David John January 1988 (has links)
No description available.
23

Logic and objects : language, application and implementation

McCabe, Francis Gregory Christopher January 1989 (has links)
No description available.
24

Integrity constraints in deductive databases

Das, Subrata Kumar January 1990 (has links)
No description available.
25

Implementation of committed choice logic languages on shared memory multiprocessors

Crammond, James Alexander January 1988 (has links)
No description available.
26

Coupled resolution engines for programming knowledge based systems in logic

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

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
28

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.
29

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
30

Recognition of identical stubs in a decision table processor

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

Page generated in 0.1829 seconds