Based on the theory of the quasi-truth degrees in two-valued predicate logic, some researches on approximate reasoning are studied in this paper. The relation of the pseudo-metric between first-order formulae and the ...Based on the theory of the quasi-truth degrees in two-valued predicate logic, some researches on approximate reasoning are studied in this paper. The relation of the pseudo-metric between first-order formulae and the quasi-truth degrees of first-order formulae is discussed, and it is proved that there is no isolated point in the logic metric space (F, ρ ). Thus the pseudo-metric between first-order formulae is well defined to develop the study about approximate reasoning in the logic metric space (F, ρ ). Then, three different types of approximate reasoning patterns are proposed, and their equivalence under some condition is proved. This work aims at filling in the blanks of approximate reasoning in quantitative predicate logic.展开更多
A method to model and analyze the hybrid systems is presented. The time to be considered in the plant is taken as an explicit parameter through the constrained predicated net (CPN). The CPN's basic structure is a ...A method to model and analyze the hybrid systems is presented. The time to be considered in the plant is taken as an explicit parameter through the constrained predicated net (CPN). The CPN's basic structure is a Petri net with predicated transition. All components of the net are expressed by annotation which is defined on rational set Q. The analysis method for the plant is interval temporal logic represented by Petri nets. This paper combines the above two methods to synthesize the hybrid system, gives a simple and clear expression of the expected action of the studied plant.展开更多
With this work, we introduce a novel method for the unsupervised learning of conceptual hierarchies, or concept maps as they are sometimes called, which is aimed specifically for use with literary texts, as such disti...With this work, we introduce a novel method for the unsupervised learning of conceptual hierarchies, or concept maps as they are sometimes called, which is aimed specifically for use with literary texts, as such distinguishing itself from the majority of research literature on the topic which is primarily focused on building ontologies from a vast array of different types of data sources, both structured and unstructured, to support various forms of AI, in particular, the Semantic Web as envisioned by Tim Berners-Lee. We first elaborate on mutually informing disciplines of philosophy and computer science, or more specifically the relationship between metaphysics, epistemology, ontology, computing and AI, followed by a technically in-depth discussion of DEBRA, our dependency tree based concept hierarchy constructor, which as its name alludes to, constructs a conceptual map in the form of a directed graph which illustrates the concepts, their respective relations, and the implied ontological structure of the concepts as encoded in the text, decoded with standard Python NLP libraries such as spaCy and NLTK. With this work we hope to both augment the Knowledge Representation literature with opportunities for intellectual advancement in AI with more intuitive, less analytical, and well-known forms of knowledge representation from the cognitive science community, as well as open up new areas of research between Computer Science and the Humanities with respect to the application of the latest in NLP tools and techniques upon literature of cultural significance, shedding light on existing methods of computation with respect to documents in semantic space that effectively allows for, at the very least, the comparison and evolution of texts through time, using vector space math.展开更多
A modal logic for describing temporal as well as spatial properties of mobileprocesses, expressed in the asynchronous π-calculus, is presented. The logic has recur-sive constructs built upon predicate-variables. The ...A modal logic for describing temporal as well as spatial properties of mobileprocesses, expressed in the asynchronous π-calculus, is presented. The logic has recur-sive constructs built upon predicate-variables. The semantics of the logic is establishedand shown to be monotonic, thus guarantees the existence of fixpoints. An algorithm isdeveloped to automatically check if a mobile process has properties described as formulasin the logic. The correctness of the algorithm is proved.展开更多
基金National Natural Science Foundation of China (No. 60875034)Spanish Ministry of Education and Science Fund,Spain (No.TIN-2009-0828)Spanish Regional Government (Junta de Andalucia) Fund,Spain (No. P08-TIC-3548)
文摘Based on the theory of the quasi-truth degrees in two-valued predicate logic, some researches on approximate reasoning are studied in this paper. The relation of the pseudo-metric between first-order formulae and the quasi-truth degrees of first-order formulae is discussed, and it is proved that there is no isolated point in the logic metric space (F, ρ ). Thus the pseudo-metric between first-order formulae is well defined to develop the study about approximate reasoning in the logic metric space (F, ρ ). Then, three different types of approximate reasoning patterns are proposed, and their equivalence under some condition is proved. This work aims at filling in the blanks of approximate reasoning in quantitative predicate logic.
文摘A method to model and analyze the hybrid systems is presented. The time to be considered in the plant is taken as an explicit parameter through the constrained predicated net (CPN). The CPN's basic structure is a Petri net with predicated transition. All components of the net are expressed by annotation which is defined on rational set Q. The analysis method for the plant is interval temporal logic represented by Petri nets. This paper combines the above two methods to synthesize the hybrid system, gives a simple and clear expression of the expected action of the studied plant.
文摘With this work, we introduce a novel method for the unsupervised learning of conceptual hierarchies, or concept maps as they are sometimes called, which is aimed specifically for use with literary texts, as such distinguishing itself from the majority of research literature on the topic which is primarily focused on building ontologies from a vast array of different types of data sources, both structured and unstructured, to support various forms of AI, in particular, the Semantic Web as envisioned by Tim Berners-Lee. We first elaborate on mutually informing disciplines of philosophy and computer science, or more specifically the relationship between metaphysics, epistemology, ontology, computing and AI, followed by a technically in-depth discussion of DEBRA, our dependency tree based concept hierarchy constructor, which as its name alludes to, constructs a conceptual map in the form of a directed graph which illustrates the concepts, their respective relations, and the implied ontological structure of the concepts as encoded in the text, decoded with standard Python NLP libraries such as spaCy and NLTK. With this work we hope to both augment the Knowledge Representation literature with opportunities for intellectual advancement in AI with more intuitive, less analytical, and well-known forms of knowledge representation from the cognitive science community, as well as open up new areas of research between Computer Science and the Humanities with respect to the application of the latest in NLP tools and techniques upon literature of cultural significance, shedding light on existing methods of computation with respect to documents in semantic space that effectively allows for, at the very least, the comparison and evolution of texts through time, using vector space math.
文摘A modal logic for describing temporal as well as spatial properties of mobileprocesses, expressed in the asynchronous π-calculus, is presented. The logic has recur-sive constructs built upon predicate-variables. The semantics of the logic is establishedand shown to be monotonic, thus guarantees the existence of fixpoints. An algorithm isdeveloped to automatically check if a mobile process has properties described as formulasin the logic. The correctness of the algorithm is proved.
