Ken Kaneiwa

Knowledge Creating Communication Research Center
National Institute of Information and Communications Technology (NICT)


3-5 Hikaridai, Seika, Soraku, Kyoto 619-0289, Japan

Phone: +81-774-98-6876

Fax: +81-774-98-6960

 

E-mail: kaneiwa@nict.go.jp  

Home Page: http://www2.nict.go.jp/x/x163/kaneiwa/index.html (in English), http://www2.nict.go.jp/x/x163/kaneiwa/index-j.html (in Japanese)

 

 

Activities

Program committee member of International Workshop on Behavior Informatics (BI2010, PAKDD2010 Workshop)

 

Program committee member of International Conference on Formal Ontology in Information Systems (FOIS2010)

 

Program committee member of International Conference on Database and Expert Systems Applications (DEXA2009, DEXA2010)

 

Program committee member of Australasian Joint Conference on Artificial Intelligence (AI2008, AI2009, AI2010)

 

Program committee member of Pacific Rim International Conference on Artificial Intelligence (PRICAI2006, PRICAI2008, PRICAI2010)

 

Program committee member of Australasian Ontology Workshop (AOW2009, AI2009 Workshop)

 

Program committee member of Knowledge Representation Ontology Workshop (KROW2008, KR2008 Workshop)

 

Program committee member of International Conference on Artificial Intelligence and Pattern Recognition (AIPR-08, AIPR-09, AIPR-10)

 

Program committee member of International Conference on Theoretical and Mathematical Foundations of Computer Science (TMFCS-08, TMFCS-09, TMFCS-10)

 

Program committee member of Workshop on Agents and Data Mining Interaction (ADMI-06, ADMI-07, ADMI-08, ADMI-09, ADMI-10)

 

Program committee member of Indian International Conference on Artificial Intelligence (2005, 2007, 2009). special session chair: Logic and Knowledge Representation

 

Program committee member of International Universal Communication Symposium (ISUC2008, IUCS2009, IUCS2010)

 

Program committee member of National Meeting of the Japanese Society for Artificial Intelligence (JSAI2006, JSAI2007).

 

Research interests

 

Order Sorted Logic (or Many Sorted Logic, Logic with Class-hierarchy), Typed Logic Programming, Description Logics

Knowledge Representation and Reasoning (for event knowledge, structural/ terminological knowledge, negative information, etc.)

Formal Ontology (e.g. ontological property classification and event ontology)
Automated Reasoning (e.g. resolution proof system and tableau method)

Temporal Reasoning

Legal Reasoning System

Knowledge Base Reasoning (for assertional knowledge and taxonomic knowledge)

Logical Approach to Artificial Intelligence

UML Consistency Checking

 

 

Career

 

1993.4 - 1996.3 Fujitsu, Ltd.

 

2001.4 - 2006.3 Assistant Professor, National Institute of Informatics (NII)

 

2002.4 - 2006.3 Assistant Professor, The Graduate University for Advanced Studies

 

2006.4 – 2010.3 Visiting Associate Professor, National Institute of Informatics (NII)

 

2006.4 - Researcher, National Institute of Information and Communications Technology (NICT)

 

 

Publications

 

UML Diagrams:

  

UML Consistency Checking and Complexity

 

·         Ken Kaneiwa and Ken Satoh, On the Complexities of Consistency Checking for Restricted UML Class Diagrams. Theoretical Computer Science, Vol.411, No.2, pp. 301–323, 2010. Elsevier [PDF, BibTex]

·         Ken Kaneiwa and Ken Satoh, Consistency Checking Algorithms for Restricted UML Class Diagrams. In Proceedings of the Fourth International Symposium on Foundations of Information and Knowledge Systems (FoIKS 2006), pp. 219-239, LNCS 3861, 2006. Springer-Verlag. [PDF, BibTex]

·          Ken Satoh, Ken Kaneiwa and Takeaki Uno, Contradiction Finding and Minimal Recover for UML class diagrams. In Proceedings of the 21st IEEE/ACM International on Automated Software Engineering (ASE 2006), pp. 277-280, 2006.

 

 

Order-sorted Logic and Knowledge Representation:

 

Ontology and Sort Hierarchy

  

·         Ken Kaneiwa and Riichiro Mizoguchi. Distributed Reasoning with Ontologies and Rules in Order-Sorted Logic Programming, Journal of Web Semantics, Vol. 7, Vol. 3, pp. 252-270, 2009. Elsevier. [PDF, BibTex]

·         Ken Kaneiwa, Michiaki Iwazume, and Ken Fukuda, An Upper Ontology for Event Classifications and Relations, In Proceedings of the Twentieth Australian Joint Conference on Artificial Intelligence (AI 2007), pp. 394-403, LNCS 4830, 2007. [PDF, BibTex, Slides]

·         K. Kaneiwa and R. Mizoguchi. Ontological Knowledge Base Reasoning with Sort-Hierarchy and Rigidity. In Proceedings of the Ninth International Conference on the Principles of Knowledge Representation and Reasoning (KR2004), pp. 278-288, Whistler, Canada, 2004. [PDF, BibTex]

·         K. Kaneiwa and R. Mizoguchi. An Order-Sorted Quantified Modal Logic for Meta-Ontology. In Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2005), Koblenz, Germany, pp. 169-184, LNCS 3702, 2005. Springer-Verlag. [PDF, BibTex] (extended version)

 

Eventuality and Predicate Hierarchy

 

·         Ken Kaneiwa and Philip H, P, Nguyen, Decidable Order-Sorted Logic Programming for Ontologies and Rules with Argument Restructuring. In Proceedings of the 8th International Semantic Web Conference (ISWC 2009), pp. 328-343, LNCS 5823, 2009 (acceptance rate: 17.3%). [PDF, BibTex] (extended version)

·         K. Kaneiwa. Order-Sorted Logic Programming with Predicate Hierarchy. Artificial Intelligence, Vol.158, No.2, pp. 155-188, 2004. Elsevier. [PDF, BibTex]

·         K. Kaneiwa and S. Tojo. Event, property and hierarchy in order-sorted logic. In Proceedings of the 1999 International Conference on Logic Programming (ICLP'99), Las Cruces, New Mexico, USA, pp. 94-108, 1999. The MIT Press. [PDF, BibTex]

·         Ken Kaneiwa and Satoshi Tojo, Logical Aspects of Events: Quantification, Sorts, Composition and Disjointness. In Proceedings of Australasian Ontology Workshop (AOW 2005), Sydney, Australia, 2005. [PDF, BibTex].

·         Philip H. P. Nguyen, Ken Kaneiwa, Dan R. Corbett, Minh-Quang Nguyen. Meta-Relation and Ontology Closure in Conceptual Structure Theory, Artificial Intelligence and Law, Vol. 17, No. 4, pp. 291-320, 2009. Springer [PDF, BibTex].

·         Philip H. P. Nguyen, Ken Kaneiwa, Dan Corbett, Minh-Quang Nguyen: Representing Event Assertions in an Upper Event Ontology. In Proceedings of the first International Conference on Knowledge and Systems Engineering, pp. 120-125, 2009.

·         Philip H. P. Nguyen, Ken Kaneiwa, Dan Corbett, Minh-Quang Nguyen: An Ontology Formalization of Relation Type Hierarchy in Conceptual Structure Theory. In Proceedings of the 21st Australian Joint Conference on Artificial Intelligence (AI 2008), LNCS 5360, pp. 79-85, 2008.

·          S. Tojo and K. Kaneiwa. Toward a Proper Semantics for the Logic of Occurrence. In Proceedings of the Context '03 Workshop on Barwise and Situation Theory, 2003. [PDF, BibTex]

·          S. Yoshioka, K. Kaneiwa and S. Tojo. Occurrence Logic with Temporal Heredity. In Proceedings of the 1st Indian International Conference on Artificial Intelligence (IICAI'03), 2003.

 

Negation

 

·          Ken Kaneiwa and Satoshi Tojo. An Order-sorted Resolution with Implicitly Negative Sorts. In Proceedings of the 2001 International Conference on Logic Programming (ICLP'01), Cyprus, pp.300-314, 2001 (Lecture Notes in Computer Science 2237, Springer-Verlag, Logic Programming.) [PDF, BibTex]

·         Ken Kaneiwa. On the Semantics of Classical First-Order Logic with Constructive Double Negation. In Proceedings of the 2nd Indian International Conference on Artificial Intelligence, 2005. [PDF, BibTex]

·         Ken Kaneiwa and Norihiro Kamide, Paraconsistent Computation Tree Logic. New Generation Computing, 2010, to appear. [PDF, BibTex]

·         Norihiro Kamide and Ken Kaneiwa, Paraconsistent Negation and Classical Negation in Computation Tree Logic. In Proceedings of the 2nd International Conference on Agents and Artificial Intelligence (ICAART 2010), Vol.1, pp. 464-469, 2010. INSTICC Press [PDF, BibTex]

 

Sort Predicates (i.e. sorts are used to express their corresponding unary predicates)

 

·          Ken Kaneiwa, The completeness of logic programming with sort predicates, Systems and Computers in Japan, Vol.35, No.1, pp. 37-46, 2004. [PDF, BibTex] (Systems and Computers in Japan)

 

Label-based Expressions

 

·          K. Kaneiwa, A Logic with Multi-purpose Labels for Hierarchical Representation, Proceedings of the Fifth International Workshop on Computational Semantics (IWCS-03), 461 - 463, 2003. [PDF, BibTex]

·          Ken Kaneiwa, Resolution for Label-based Formulas in Hierarchical Representation, New Generation Computing, Vol.22, pp. 253-269, 2004. [PDF, BibTex]

 

 

Modal Logic:

  

Sequence Modal Operator

 

·         Norihiro Kamide and Ken Kaneiwa, Extended Full Computation-Tree Logic with Sequence Modal Operator: Representing Hierarchical Tree Structures. In Proceedings of the 22nd Australian Joint Conference on Artificial Intelligence (AI 2009), pp. 485-494, LNCS 5866, 2009.

 

 

Description Logic:

  

Negative Concepts

 

·          K. Kaneiwa, Description Logics with Contraries, Contradictories, and Subcontraries, New Generation Computing, Vol.25, Vol.4, pp. 443-468, 2007. [PDF, BibTex]

·          K. Kaneiwa. Negations in Description Logic -- Contraries, Contradictories, and Subcontraries. In Proceedings of the 13th International Conference on Conceptual Structures (ICCS '05), Kassel, Germany, pp. 66-79, 2005. Kassel University Press. [PDF, BibTex]

 

Combining Logic Programming and Description Logic

 

·          K. Kaneiwa, A Hybrid Reasoning System for Terminologies and First-order Clauses in Knowledge Bases, New Generation Computing, Vol.24, pp. 29-51, 2006. [PDF, BibTex]

·         Ken Kaneiwa, A Hybrid Reasoning System for Terminologies and Clause Sets, In Proceedings of The IASTED International Conference on ARTIFICIAL INTELLIGENCE AND APPLICATIONS (AIA 2004) (as part of the Twenty-Second IASTED International Multi-Conference on Multi-Conference on Applied Informatics), Innsbruck, Austria, pp. 564 – 570, 2004. [PDF, BibTex]

 

 

Data Mining:

  

Rough Set Approach

 

 ·       Ken Kaneiwa, A Rough Set Approach to Mining Connections from Information Systems. In Proceedings of the 25th ACM Symposium on Applied Computing (ACM SAC 2010), Track on Data Mining, pp. 990-996, 2010. (acceptance rate: 25.5%). [PDF, BibTex] (extended version)         

 ·       Ken Kaneiwa and Yasuo Kudo, Local Pattern Mining from Sequences using Rough Set Theory. In Proceedings of the 2010 IEEE International Conference on Granular Computing (IEEE GrC 2010), 2010, to appear. [PDF, BibTex] (extended version)       

 

 

Web Information:

  

Knowledge Browser

 

 ·       Michiaki Iwazume, Ken Kaneiwa, Koji Zettsu, Takafumi Nakanishi, Yutaka Kidawara and Yasushi Kiyoki, KC3 Browser: Semantic Mashup and Link-free Browsing, In Proceedings of the 17th International World Wide Web Conference (WWW 2008), pp. 1209-1210, 2008. (short paper)       

 

Evaluation of Web Information

 

 ·       Hisashi Miyamori, Susumu Akamine, Yoshikiyo Kato, Ken Kaneiwa, Kaoru Sumi, Kentaro Inui, Sadao Kurohashi, Evaluation Data and Prototype System WISDOM for Information Credibility Analysis, Internet Research, Special Issue on Information Credibility, Vol. 18, Vol. 2, pp. 155-164, 2008.

 

 

Survey papers:

 

·        Ken Kaneiwa, Ken Satoh, DL: Description Logics, Journal of Japanese Society of Artificial Intelligence, Vol. 18, No.1, pp. 73 – 82, 2003 (in Japanese).

·         Ken Kaneiwa, OWL Reasoning and its Complexity, Computer Software, Vol. 22, No. 4, pp. 26 - 34, 2005 (in Japanese).         

·         Ken Kaneiwa, Fuzzy Description Logic, Journal of Japanese Society of Artificial Intelligence, Vol. 22, No.5, pp. 588-596, 2007 (in Japanese).         

 

 

Others (in Japanese):

 

·         Ken Kaneiwa, Satoshi Tojo, A Legal Reasoning System with Event and Property Interpretation for Legal Knowledge (in Japanese). Trans. IJ, Vol. 40, No. 7, pp. 2892-2904, 1999.

·         Ken Kaneiwa, Satoshi Tojo, Event and Property in Order-sorted Logic. Computer Software (in Japanese), Vol. 17, No. 2, pp. 10-24, 2000.

·         Ken Kaneiwa, Satoshi Tojo, The Completeness of a Horn Clause Calculus with Sort and Predicate Hierarchies (in Japanese). Trans. IEICE, Vol. J83-D-I, No. 12, pp. 1239-1248, Dec. 2000.

·         Ken Kaneiwa, Satoshi Tojo, An Order-Sorted Logic with Implicitly Negative Sorts (in Japanese). Trans. IJ, Vol. 43, No.5, pp.1505-1517, 2002.

·         Ken Kaneiwa, The Completeness of Logic Programming with Sort Predicates (in Japanese). Trans. IEICE, Vol. J85-D-I, No.7, pp.662-671, 2002.

·         Ken Kaneiwa, Consistency of Taxonomies for Ontology Development. Computer Software (in Japanese), Vol.21, No.2, pp. 12-24, 2004.

·         K. Kaneiwa and R. Mizoguchi. Formal Ontology and Extensions of Order-Sorted Logic (in Japanese), Journal of Japanese Society of Artificial Intelligence, Vol. 20, No.6, pp. 387-395, 2005.

·         Ken Kaneiwa, Classical First-Order Logic with Constructive Double Negation (in Japanese). Trans. IEICE, Vol.J90-D, No.4,pp.1031-1042, 2007.

·         Ken Kaneiwa, Satoshi Tojo, A Logical Event-Language for Legal Reasoning (in Japanese). Trans. IJ, Vol.48, No.12, pp. 3996-4011, 2007.

 

 

Doctoral Dissertation

 

An Order-Sorted Logic with Predicate-Hierarchy, Eventuality and Implicit Negation.
Japan Advanced Institute of Science and Technology, 121 pages, 2001. [PDF, BibTex]