The Experts below are selected from a list of 7800 Experts worldwide ranked by ideXlab platform
Yuefei Sui - One of the best experts on this subject based on the ideXlab platform.
-
A Sound and Complete Axiomatic System for Modality $\Box\phi\equiv\Box_1\phi\land\Box_2\phi$
2014Co-Authors: Shaobo Deng, Meiying Sun, Cungen Cao, Yuefei SuiAbstract:An axiomatic system is presented in this paper, which has a Modal Operator □ such that $\Box\phi\equiv\Box_1\phi\land\Box_2\phi$, where □1 and □2 are the Modal Operators of the language for the axiom system S5. The axiomatic system for □ is proved to be sound and complete.
-
Intelligent Information Processing - A Sound and Complete Axiomatic System for Modality \(\Box\phi\equiv\Box_1\phi\land\Box_2\phi\)
Progress in Pattern Recognition Image Analysis Computer Vision and Applications, 2014Co-Authors: Shaobo Deng, Meiying Sun, Cungen Cao, Yuefei SuiAbstract:An axiomatic system is presented in this paper, which has a Modal Operator □ such that \(\Box\phi\equiv\Box_1\phi\land\Box_2\phi\), where □1 and □2 are the Modal Operators of the language for the axiom system S5. The axiomatic system for □ is proved to be sound and complete.
Shaobo Deng - One of the best experts on this subject based on the ideXlab platform.
-
A Sound and Complete Axiomatic System for Modality $\Box\phi\equiv\Box_1\phi\land\Box_2\phi$
2014Co-Authors: Shaobo Deng, Meiying Sun, Cungen Cao, Yuefei SuiAbstract:An axiomatic system is presented in this paper, which has a Modal Operator □ such that $\Box\phi\equiv\Box_1\phi\land\Box_2\phi$, where □1 and □2 are the Modal Operators of the language for the axiom system S5. The axiomatic system for □ is proved to be sound and complete.
-
Intelligent Information Processing - A Sound and Complete Axiomatic System for Modality \(\Box\phi\equiv\Box_1\phi\land\Box_2\phi\)
Progress in Pattern Recognition Image Analysis Computer Vision and Applications, 2014Co-Authors: Shaobo Deng, Meiying Sun, Cungen Cao, Yuefei SuiAbstract:An axiomatic system is presented in this paper, which has a Modal Operator □ such that \(\Box\phi\equiv\Box_1\phi\land\Box_2\phi\), where □1 and □2 are the Modal Operators of the language for the axiom system S5. The axiomatic system for □ is proved to be sound and complete.
Norihiro Kamide - One of the best experts on this subject based on the ideXlab platform.
-
SMC - The Logic of Information Merge and Sequential Information
2013 IEEE International Conference on Systems Man and Cybernetics, 2013Co-Authors: Norihiro KamideAbstract:The logic LMS of information merge and sequential information is introduced as a Gentzen-type sequent calculus. LMS has a specific inference rule called the mingle, which can suitably represent information merge processes. LMS has also a specific Modal Operator called the sequence Modal Operator, which can suitably represent sequential information. The completeness and cut-elimination theorems for LMS are proved as the main result of this paper. LMS is also shown to be useful for representing relational databases.
-
Conceptual modeling in full computation-tree logic with sequence Modal Operator
International Journal of Intelligent Systems, 2011Co-Authors: Ken Kaneiwa, Norihiro KamideAbstract:In this paper, we propose a method for modeling concepts in full computation-tree logic with sequence Modal Operators. An extended full computation-tree logic, CTLS*, is introduced as a Kripke semantics with a sequence Modal Operator. This logic can appropriately represent hierarchical tree structures in cases where sequence Modal Operators in CTLS* are applied to tree structures. We prove a theorem for embedding CTLS* into CTL*. The validity, satisfiability, and model-checking problems of CTLS* are shown to be decidable. An illustrative example of biological taxonomy is presented using CTLS* formulas. © 2011 Wiley Periodicals, Inc. (This paper is an extended version of Kamide and Kaneiwa.)
-
SBIA - A proof system for temporal reasoning with sequential information
Advances in Artificial Intelligence – SBIA 2010, 2010Co-Authors: Norihiro KamideAbstract:A new logic, sequence-indexed linear-time temporal logic (SLTL), is obtained semantically from the standard linear-time temporal logic LTL by adding a sequence Modal Operator which represents a sequence of symbols. By the sequence Modal Operator of SLTL, we can appropriately express "sequential information" in temporal reasoning. A Gentzen-type sequent calculus for SLTL is introduced, and the completeness and cut-elimination theorems for this calculus are proved. SLTL is also shown to be PSPACE-complete and embeddable into LTL.
-
extended full computation tree logic with sequence Modal Operator representing hierarchical tree structures
Australasian Joint Conference on Artificial Intelligence, 2009Co-Authors: Norihiro Kamide, Ken KaneiwaAbstract:An extended full computation-tree logic, CTLS*, is introduced as a Kripke semantics with a sequence Modal Operator. This logic can appropriately represent hierarchical tree structures where sequence Modal Operators in CTLS* are applied to tree structures. An embedding theorem of CTLS* into CTL* is proved. The validity, satisfiability and model-checking problems of CTLS* are shown to be decidable. An illustrative example of biological taxonomy is presented using CTLS* formulas.
-
Australasian Conference on Artificial Intelligence - Extended Full Computation-Tree Logic with Sequence Modal Operator: Representing Hierarchical Tree Structures
AI 2009: Advances in Artificial Intelligence, 2009Co-Authors: Norihiro Kamide, Ken KaneiwaAbstract:An extended full computation-tree logic, CTLS*, is introduced as a Kripke semantics with a sequence Modal Operator. This logic can appropriately represent hierarchical tree structures where sequence Modal Operators in CTLS* are applied to tree structures. An embedding theorem of CTLS* into CTL* is proved. The validity, satisfiability and model-checking problems of CTLS* are shown to be decidable. An illustrative example of biological taxonomy is presented using CTLS* formulas.
Meiying Sun - One of the best experts on this subject based on the ideXlab platform.
-
A Sound and Complete Axiomatic System for Modality $\Box\phi\equiv\Box_1\phi\land\Box_2\phi$
2014Co-Authors: Shaobo Deng, Meiying Sun, Cungen Cao, Yuefei SuiAbstract:An axiomatic system is presented in this paper, which has a Modal Operator □ such that $\Box\phi\equiv\Box_1\phi\land\Box_2\phi$, where □1 and □2 are the Modal Operators of the language for the axiom system S5. The axiomatic system for □ is proved to be sound and complete.
-
Intelligent Information Processing - A Sound and Complete Axiomatic System for Modality \(\Box\phi\equiv\Box_1\phi\land\Box_2\phi\)
Progress in Pattern Recognition Image Analysis Computer Vision and Applications, 2014Co-Authors: Shaobo Deng, Meiying Sun, Cungen Cao, Yuefei SuiAbstract:An axiomatic system is presented in this paper, which has a Modal Operator □ such that \(\Box\phi\equiv\Box_1\phi\land\Box_2\phi\), where □1 and □2 are the Modal Operators of the language for the axiom system S5. The axiomatic system for □ is proved to be sound and complete.
Cungen Cao - One of the best experts on this subject based on the ideXlab platform.
-
A Sound and Complete Axiomatic System for Modality $\Box\phi\equiv\Box_1\phi\land\Box_2\phi$
2014Co-Authors: Shaobo Deng, Meiying Sun, Cungen Cao, Yuefei SuiAbstract:An axiomatic system is presented in this paper, which has a Modal Operator □ such that $\Box\phi\equiv\Box_1\phi\land\Box_2\phi$, where □1 and □2 are the Modal Operators of the language for the axiom system S5. The axiomatic system for □ is proved to be sound and complete.
-
Intelligent Information Processing - A Sound and Complete Axiomatic System for Modality \(\Box\phi\equiv\Box_1\phi\land\Box_2\phi\)
Progress in Pattern Recognition Image Analysis Computer Vision and Applications, 2014Co-Authors: Shaobo Deng, Meiying Sun, Cungen Cao, Yuefei SuiAbstract:An axiomatic system is presented in this paper, which has a Modal Operator □ such that \(\Box\phi\equiv\Box_1\phi\land\Box_2\phi\), where □1 and □2 are the Modal Operators of the language for the axiom system S5. The axiomatic system for □ is proved to be sound and complete.
