| 2013 | ||
|---|---|---|
| j17 | Ken Kaneiwa, Philip H. P. Nguyen: An order-sorted query system for sort, predicate, and meta-predicate hierarchies. Knowl. Inf. Syst. 35(2): 463-492 (2013) | |
| 2012 | ||
| c21 | Ken Kaneiwa, Philip H. P. Nguyen: Sorted hyper-predicate knowledge bases for ontologies and rules. SAC 2012: 312-319 | |
| c20 | Michiaki Iwazume, Ken Kaneiwa, Ichiro Kobayashi: KC3 Browser: Semantic Service Mush-up for Global Knowledge Sharing and Discovery. SNPD 2012: 754-759 | |
| 2011 | ||
| j16 | Ken Kaneiwa: A rough set approach to multiple dataset analysis. Appl. Soft Comput. 11(2): 2538-2547 (2011) | |
| j15 | Ken Kaneiwa, Riichiro Mizoguchi: A Time and Situation Dependent Semantics for Ontological Property Classification. IEICE Transactions 94-D(3): 639-647 (2011) | |
| j14 | Ken Kaneiwa, Yasuo Kudo: A sequential pattern mining algorithm using rough set theory. Int. J. Approx. Reasoning 52(6): 881-893 (2011) | |
| j13 | Ken Kaneiwa, Norihiro Kamide: Conceptual modeling in full computation-tree logic with sequence modal operator. Int. J. Intell. Syst. 26(7): 636-651 (2011) | |
| j12 | Ken Kaneiwa: Existential rigidity and many modalities in order-sorted logic. Knowl.-Based Syst. 24(5): 629-641 (2011) | |
| j11 | Ken Kaneiwa, Norihiro Kamide: Paraconsistent Computation Tree Logic. New Generation Comput. 29(4): 391-408 (2011) | |
| c19 | Yasuo Kudo, Ken Kaneiwa, Tetsuya Murai: An attempt of reconstruction of object-oriented rough set models. GrC 2011: 345-350 | |
| 2010 | ||
| j10 | Ken Kaneiwa, Norihiro Kamide: Sequence-Indexed Linear-Time Temporal Logic: Proof System and Application. Applied Artificial Intelligence 24(10): 896-913 (2010) | |
| j9 | Ken Kaneiwa, Ken Satoh: On the complexities of consistency checking for restricted UML class diagrams. Theor. Comput. Sci. 411(2): 301-323 (2010) | |
| c18 | Norihiro Kamide, Ken Kaneiwa: Resource-Sensitive Reasoning with Sequential Information. Australasian Conference on Artificial Intelligence 2010: 22-31 | |
| c17 | Ken Kaneiwa, Yasuo Kudo: Local Pattern Mining from Sequences Using Rough Set Theory. GrC 2010: 247-252 | |
| c16 | Norihiro Kamide, Ken Kaneiwa: Paraconsistent Negation and Classical Negation in Computation Tree Logic. ICAART (1) 2010: 464-469 | |
| c15 | ||
| 2009 | ||
| j8 | Philip H. P. Nguyen, Ken Kaneiwa, Dan Corbett, Minh-Quang Nguyen: Meta-relation and ontology closure in Conceptual Structure Theory. Artif. Intell. Law 17(4): 291-320 (2009) | |
| j7 | Ken Kaneiwa, Riichiro Mizoguchi: Distributed reasoning with ontologies and rules in order-sorted logic programming. J. Web Sem. 7(3): 252-270 (2009) | |
| c14 | Norihiro Kamide, Ken Kaneiwa: Extended Full Computation-Tree Logic with Sequence Modal Operator: Representing Hierarchical Tree Structures. Australasian Conference on Artificial Intelligence 2009: 485-494 | |
| c13 | Ken Kaneiwa, Philip H. P. Nguyen: Decidable Order-Sorted Logic Programming for Ontologies and Rules with Argument Restructuring. International Semantic Web Conference 2009: 328-343 | |
| 2008 | ||
| j6 | 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 18(2): 155-164 (2008) | |
| c12 | Philip H. P. Nguyen, Ken Kaneiwa, Dan Corbett, Minh-Quang Nguyen: An Ontology Formalization of Relation Type Hierarchy in Conceptual Structure Theory. Australasian Conference on Artificial Intelligence 2008: 79-85 | |
| c11 | Michiaki Iwazume, Ken Kaneiwa, Koji Zettsu, Takafumi Nakanishi, Yutaka Kidawara, Yasushi Kiyoki: KC3 browser: semantic mash-up and link-free browsing. WWW 2008: 1209-1210 | |
| 2007 | ||
| j5 | Ken Kaneiwa: Description Logics with Contraries, Contradictories, and Subcontraries. New Generation Comput. 25(4): 443-468 (2007) | |
| c10 | Ken Kaneiwa, Michiaki Iwazume, Ken Fukuda: An Upper Ontology for Event Classifications and Relations. Australian Conference on Artificial Intelligence 2007: 394-403 | |
| 2006 | ||
| c9 | Ken Kaneiwa, Ken Satoh: Consistency Checking Algorithms for Restricted UML Class Diagrams. FoIKS 2006: 219-239 | |
| c8 | Ken Satoh, Ken Kaneiwa, Takeaki Uno: Contradiction Finding and Minimal Recovery for UML Class Diagrams. ASE 2006: 277-280 | |
| 2005 | ||
| j4 | Ken Kaneiwa: A Hybrid Reasoning System for Terminologies and First-order Clauses in Knowledge Bases. New Generation Comput. 24(1): 29-51 (2005) | |
| c7 | Ken Kaneiwa: On the Semantics of Classical First-order Logic with Constructive Double Negation. IICAI 2005: 1225-1242 | |
| c6 | Ken Kaneiwa, Riichiro Mizoguchi: An Order-Sorted Quantified Modal Logic for Meta-ontology. TABLEAUX 2005: 169-184 | |
| 2004 | ||
| j3 | Ken Kaneiwa: Order-sorted logic programming with predicate hierarchy. Artif. Intell. 158(2): 155-188 (2004) | |
| j2 | Ken Kaneiwa: Resolution for Label-based Formulas in Hierarchical Representation. New Generation Comput. 22(3): 253-269 (2004) | |
| j1 | Ken Kaneiwa: The completeness of logic programming with sort predicates. Systems and Computers in Japan 35(1): 37-46 (2004) | |
| c5 | ||
| c4 | Ken Kaneiwa, Riichiro Mizoguchi: Ontological Knowledge Base Reasoning with Sort-Hierarchy and Rigidity. KR 2004: 278-288 | |
| 2003 | ||
| c3 | Suguru Yoshioka, Ken Kaneiwa, Satoshi Tojo: Occurrence Logic with Temporal Heredity. IICAI 2003: 1296-1309 | |
| 2001 | ||
| c2 | Ken Kaneiwa, Satoshi Tojo: An Order-Sorted Resolution with Implicitly Negative Sorts. ICLP 2001: 300-314 | |
| 1999 | ||
| c1 | ||
Colors in the list of coauthors
Last update Sun May 19 22:07:30 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page