No description available.

No description available.

No description available.

No description available.

No description available.

陳浩琛. / Thesis (M.A.)--香港中文大學硏究院哲學部. / Manuscript. / Includes bibliographical references: leaves 17-30 (3d. group) / Chen Haochen. / Thesis (M.A.)--Xianggang Zhong wen da xue yan jiu yuan zhe xue bu. / 序言 --- p.I-III / Chapter 第一部份 --- 歸納法的問題及其解答 / Chapter 第1章 --- 歸納法的問題 / Chapter 1.1 --- 歸納的跳躍 --- p.1-2 / Chapter 1.2 --- 科學方法及歸納推論 --- p.2-5 / Chapter 1.3 --- 休謨吊詭 --- p.5-6 / Chapter 第2章 --- 休謨吊詭的解答 / Chapter 2.1 --- 基本原則的進路 --- p.7-13 / Chapter 2.2 --- 自相支持的歸納論証的進路 --- p.13-21 / Chapter 2.3 --- 消解的進路 --- p.21-28 / Chapter 2.4 --- 日常語言分析的進路 --- p.29-34 / Chapter 2.5 --- 實效証立的進路 --- p.34-39 / Chapter 第二部份 --- 概率的形式系統及其語意解釋 / 概要 --- p.40-41 / Chapter 第3章 --- 概率的形式系統 / Chapter 3.1 --- 離散空間中之概率 --- p.42-46 / Chapter 3.2 --- 條件概率 --- p.46-49 / Chapter 3.3 --- 具努里試驗 --- p.50-51 / Chapter 3.4 --- 中間項 --- p.51-55 / Chapter 3.5 --- 大數律 --- p.55-58 / Chapter 3.6 --- 連續空間中之概率 --- p.58-64 / Chapter 第4章 --- 語意解釋的判準 --- p.65-67 / Chapter 第5章 --- 古典解釋 --- p.68-75 / Chapter 第6章 --- 頻率解釋 / Chapter 6.1 --- 頻率極限 --- p.76-78 / Chapter 6.2 --- 有限序列的頻率解釋 --- p.78-80 / Chapter 6.3 --- 頻率的極限是否存在 --- p.80-88 / Chapter 6.4 --- 趨同規則 --- p.88-97 / Chapter 6.5 --- 單個事件 --- p.97-101 / Chapter 第7章 --- 邏輯解釋 / Chapter 7.1 --- 邏輯解釋概要 --- p.102-105 / Chapter 7.2 --- 結構描述 --- p.105-110 / Chapter 7.3 --- 歸納邏輯(概率邏輯)的公理系統 --- p.111-116 / Chapter 7.4 --- 適當性條件 --- p.116-123 / Chapter 7.5 --- C－函數的決定 --- p.123-136 / Chapter 7.6 --- 邏輯概率在決定實際判斷上的應用 --- p.136-142 / 餘論 --- p.143-145 / 註目 --- p.I-XI / 附錄 --- p.XII-XVI / 參考書目 --- p.XVII-XXX

by Chan Kwok Hung. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1981. / Bibliography: leaves 90-94.

No description available.

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.

Digitized by Kansas Correctional Industries