Spelling suggestions: "subject:"firstorder logic"" "subject:"firstorder yogic""
1 |
A novel fuzzy first-order logic learning system.January 2002 (has links)
Tse, Ming Fun. / Thesis submitted in: December 2001. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2002. / Includes bibliographical references (leaves 142-146). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Problem Definition --- p.2 / Chapter 1.2 --- Contributions --- p.3 / Chapter 1.3 --- Thesis Outline --- p.4 / Chapter 2 --- Literature Review --- p.6 / Chapter 2.1 --- Representing Inexact Knowledge --- p.7 / Chapter 2.1.1 --- Nature of Inexact Knowledge --- p.7 / Chapter 2.1.2 --- Probability Based Reasoning --- p.8 / Chapter 2.1.3 --- Certainty Factor Algebra --- p.11 / Chapter 2.1.4 --- Fuzzy Logic --- p.13 / Chapter 2.2 --- Machine Learning Paradigms --- p.13 / Chapter 2.2.1 --- Classifications --- p.14 / Chapter 2.2.2 --- Neural Networks and Gradient Descent --- p.15 / Chapter 2.3 --- Related Learning Systems --- p.21 / Chapter 2.3.1 --- Relational Concept Learning --- p.21 / Chapter 2.3.2 --- Learning of Fuzzy Concepts --- p.24 / Chapter 2.4 --- Fuzzy Logic --- p.26 / Chapter 2.4.1 --- Fuzzy Set --- p.27 / Chapter 2.4.2 --- Basic Notations in Fuzzy Logic --- p.29 / Chapter 2.4.3 --- Basic Operations on Fuzzy Sets --- p.29 / Chapter 2.4.4 --- "Fuzzy Relations, Projection and Cylindrical Extension" --- p.31 / Chapter 2.4.5 --- Fuzzy First Order Logic and Fuzzy Prolog --- p.34 / Chapter 3 --- Knowledge Representation and Learning Algorithm --- p.43 / Chapter 3.1 --- Knowledge Representation --- p.44 / Chapter 3.1.1 --- Fuzzy First-order Logic ´ؤ A Powerful Language --- p.44 / Chapter 3.1.2 --- Literal Forms --- p.48 / Chapter 3.1.3 --- Continuous Variables --- p.50 / Chapter 3.2 --- System Architecture --- p.61 / Chapter 3.2.1 --- Data Reading --- p.61 / Chapter 3.2.2 --- Preprocessing and Postprocessing --- p.67 / Chapter 4 --- Global Evaluation of Literals --- p.71 / Chapter 4.1 --- Existing Closeness Measures between Fuzzy Sets --- p.72 / Chapter 4.2 --- The Error Function and the Normalized Error Functions --- p.75 / Chapter 4.2.1 --- The Error Function --- p.75 / Chapter 4.2.2 --- The Normalized Error Functions --- p.76 / Chapter 4.3 --- The Nodal Characteristics and the Error Peaks --- p.79 / Chapter 4.3.1 --- The Nodal Characteristics --- p.79 / Chapter 4.3.2 --- The Zero Error Line and the Error Peaks --- p.80 / Chapter 4.4 --- Quantifying the Nodal Characteristics --- p.85 / Chapter 4.4.1 --- Information Theory --- p.86 / Chapter 4.4.2 --- Applying the Information Theory --- p.88 / Chapter 4.4.3 --- Upper and Lower Bounds of CE --- p.89 / Chapter 4.4.4 --- The Whole Heuristics of FF99 --- p.93 / Chapter 4.5 --- An Example --- p.94 / Chapter 5 --- Partial Evaluation of Literals --- p.99 / Chapter 5.1 --- Importance of Covering in Inductive Learning --- p.100 / Chapter 5.1.1 --- The Divide-and-conquer Method --- p.100 / Chapter 5.1.2 --- The Covering Method --- p.101 / Chapter 5.1.3 --- Effective Pruning in Both Methods --- p.102 / Chapter 5.2 --- Fuzzification of FOIL --- p.104 / Chapter 5.2.1 --- Analysis of FOIL --- p.104 / Chapter 5.2.2 --- Requirements on System Fuzzification --- p.107 / Chapter 5.2.3 --- Possible Ways in Fuzzifing FOIL --- p.109 / Chapter 5.3 --- The α Covering Method --- p.111 / Chapter 5.3.1 --- Construction of Partitions by α-cut --- p.112 / Chapter 5.3.2 --- Adaptive-α Covering --- p.112 / Chapter 5.4 --- The Probabistic Covering Method --- p.114 / Chapter 6 --- Results and Discussions --- p.119 / Chapter 6.1 --- Experimental Results --- p.120 / Chapter 6.1.1 --- Iris Plant Database --- p.120 / Chapter 6.1.2 --- Kinship Relational Domain --- p.122 / Chapter 6.1.3 --- The Fuzzy Relation Domain --- p.129 / Chapter 6.1.4 --- Age Group Domain --- p.134 / Chapter 6.1.5 --- The NBA Domain --- p.135 / Chapter 6.2 --- Future Development Directions --- p.137 / Chapter 6.2.1 --- Speed Improvement --- p.137 / Chapter 6.2.2 --- Accuracy Improvement --- p.138 / Chapter 6.2.3 --- Others --- p.138 / Chapter 7 --- Conclusion --- p.140 / Bibliography --- p.142 / Chapter A --- C4.5 to FOIL File Format Conversion --- p.147 / Chapter B --- FF99 example --- p.150
|
2 |
Convex optimization under inexact first-order informationLan, Guanghui. January 2009 (has links)
Thesis (Ph.D)--Industrial and Systems Engineering, Georgia Institute of Technology, 2009. / Committee Chair: Arkadi Nemirovski; Committee Co-Chair: Alexander Shapiro; Committee Co-Chair: Renato D. C. Monteiro; Committee Member: Anatoli Jouditski; Committee Member: Shabbir Ahmed. Part of the SMARTech Electronic Thesis and Dissertation Collection.
|
3 |
Exact learning of first-order expressions from queries /Arias Robles, Marta. January 1900 (has links)
Thesis (Ph.D.)--Tufts University, 2004. / Adviser: Roni Khardon. Submitted to the Dept. of Computer Science. Includes bibliographical references (leaves 157-161). Access restricted to members of the Tufts University community. Also available via the World Wide Web;
|
4 |
The likeness regress : Plato's Parmenides 132c12-133a7 /Otto, Karl Darcy. Hitchcock, David, January 1900 (has links)
Thesis (Ph.D.)--McMaster University, 2003. / Advisor: David L. Hitchcock. Includes bibliographical references (leaves 144-147). Also available via World Wide Web.
|
5 |
!-Logic : first order reasoning for families of non-commutative string diagramsQuick, David Arthur January 2015 (has links)
Equational reasoning with string diagrams provides an intuitive method for proving equations between morphisms in various forms of monoidal category. !-Graphs were introduced with the intention of reasoning with infinite families of string diagrams by allowing repetition of sub-diagrams. However, their combinatoric nature only allows commutative nodes. The aim of this thesis is to extend the !-graph formalism to remove the restriction of commutativity and replace the notion of equational reasoning with a natural deduction system based on first order logic. The first major contribution is the syntactic !-tensor formalism, which enriches Penrose's abstract tensor notation to allow repeated structure via !-boxes. This will allow us to work with many noncommutative theories such as bialgebras, Frobenius algebras, and Hopf algebras, which have applications in quantum information theory. A more subtle consequence of switching to !-tensors is the ability to definitionally extend a theory. We will demonstrate how noncommutativity allows us to define nodes which encapsulate entire diagrams, without inherently assuming the diagram is commutative. This is particularly useful for recursively defining arbitrary arity nodes from fixed arity nodes. For example, we can construct a !-tensor node representing the family of left associated trees of multiplications in a monoid. The ability to recursively define nodes goes hand in hand with proof by induction. This leads to the second major contribution of this thesis, which is !-Logic (!L). We extend previous attempts at equational reasoning to a fully fledged natural deduction system based on positive intuitionistic first order logic, with conjunction, implication, and universal quantification over !-boxes. The key component of !L is the principle of !-box induction. We demonstrate its application by proving how we can transition from fixed to arbitrary arity theories for monoids, antihomomorphisms, bialgebras, and various forms of Frobenius algebras. We also define a semantics for !L, which we use to prove its soundness. Finally, we reintroduce commutativity as an optional property of a morphism, along with another property called symmetry, which describes morphisms which are not affected by cyclic permutations of their edges. Implementing these notions in the !-tensor language allows us to more easily describe theories involving symmetric or commutative morphisms, which we then demonstrate for recursively defined Frobenius algebra nodes.
|
6 |
Zero-one laws and almost sure validities on finite structuresSchamm, Rainer Franz 12 September 2012 (has links)
M.Sc. / This short dissertation is intended to give a brief account of the history and current state of affairs in the field of study called 'Zero-one Laws'. The probability of a property P on a class of finite relational structures is defined to be the limit of the sequence of fractions, of the n element structures that satisfy the property P, as n tends to infinity. A class of properties is said to have a Zero-One law if the above limit, which is usually called the asymptotic probability of the property with respect to the given class of finite structures, is either 0 or 1 for each property. The connection to the field of Mathematical Logic is given by the surprising fact that the class of properties definable by a first-order sentence has a Zero-One law with respect to the class of all finite relational structures of the common signature. We cover this result in more detail and discuss several further Zero- One laws for higher-order logics. In particular we will be interested in all those modal formulae which are 'almost surely' frame valid in the finite, i.e. those which have an asymptotic probability equal to 1 with respect to the class of all finite frames. Our goal is to find a purely logical characterization of these formulae by finding a set of axioms which describe such modal formulae absolutely. We devise a strategy and provide some Java programs to aid in this search for future research
|
7 |
Hilbert's thesis : some considerations about formalizations of mathematicsBerk, Lon A January 1982 (has links)
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Linguistics and Philosophy, 1982. / MICROFICHE COPY AVAILABLE IN ARCHIVES AND HUMANITIES / Bibliography: leaves 175-176. / by Lon A. Berk. / Ph.D.
|
8 |
A constructive interpretation of a fragment of first order logic /Lamarche, François. January 1983 (has links)
No description available.
|
9 |
Semantic Integration of Time OntologiesOng, Darren 15 December 2011 (has links)
Here we consider the verification and semantic integration for the set of first-order time ontologies by Allen-Hayes, Ladkin, and van Benthem that axiomatize time as points, intervals, or a combination of both within an ontology repository environment. Semantic integration of the set of time ontologies is explored via the notion of theory interpretations using an automated reasoner as part of the methodology. We use the notion of representation theorems for verification by characterizing the models of the ontology up to isomorphism and proving that they are equivalent to the intended structures for the ontology. Provided is a complete account of the meta-theoretic relationships between ontologies along with corrections to their axioms, translation definitions, proof of representation theorems, and a discussion of various issues such as class-quantified interpretations, the impact of namespacing support for Common Logic, and ontology repository support for semantic integration as related to the time ontologies examined.
|
10 |
Semantic Integration of Time OntologiesOng, Darren 15 December 2011 (has links)
Here we consider the verification and semantic integration for the set of first-order time ontologies by Allen-Hayes, Ladkin, and van Benthem that axiomatize time as points, intervals, or a combination of both within an ontology repository environment. Semantic integration of the set of time ontologies is explored via the notion of theory interpretations using an automated reasoner as part of the methodology. We use the notion of representation theorems for verification by characterizing the models of the ontology up to isomorphism and proving that they are equivalent to the intended structures for the ontology. Provided is a complete account of the meta-theoretic relationships between ontologies along with corrections to their axioms, translation definitions, proof of representation theorems, and a discussion of various issues such as class-quantified interpretations, the impact of namespacing support for Common Logic, and ontology repository support for semantic integration as related to the time ontologies examined.
|
Page generated in 0.8788 seconds