Ken Kaneiwa
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Ken Kaneiwa has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Norihiro Kamide
School of Data Science, Nagoya City University, Nagoya, Japan
5 shared publications - Philip H. P. Nguyen
Government of South Australia
1 shared publication
Latest Publications
- 1 August 2013
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 125 (1) , 51-70
Reasoning about Resources and Information: A Linear Logic Approach
A logic called sequence-indexed linear logic (SLL) is proposed to appropriately formalize resource-sensitive reasoning with sequential information. The completeness and cut-elimination theorems for SLL are proved, and SLL and a fragment of SLL are shown to be undecidable and decidable, respectively. As an application of SLL, some specifications of secure password authentication systems are discussed.
- 1 August 2013
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 125 (1) , 51-70
Reasoning about Resources and Information: A Linear Logic Approach
A logic called sequence-indexed linear logic (SLL) is proposed to appropriately formalize resource-sensitive reasoning with sequential information. The completeness and cut-elimination theorems for SLL are proved, and SLL and a fragment of SLL are shown to be undecidable and decidable, respectively. As an application of SLL, some specifications of secure password authentication systems are discussed.
- 19 June 2012
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 35 (2) , 463-492
An order-sorted query system for sort, predicate, and meta-predicate hierarchies
- 19 June 2012
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 35 (2) , 463-492
An order-sorted query system for sort, predicate, and meta-predicate hierarchies
- 1 October 2011
- Published by Springer Nature in New Generation Computing
- Vol. 29 (4) , 391-408
Paraconsistent Computation Tree Logic
- 1 October 2011
- Published by Springer Nature in New Generation Computing
- Vol. 29 (4) , 391-408
Paraconsistent Computation Tree Logic
- 19 May 2011
- Published by Hindawi Limited in International Journal of Intelligent Systems
- Vol. 26 (7) , 636-651
Conceptual modeling in full computation-tree logic with sequence modal operator
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.
- 19 May 2011
- Published by Hindawi Limited in International Journal of Intelligent Systems
- Vol. 26 (7) , 636-651
Conceptual modeling in full computation-tree logic with sequence modal operator
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.
- Open Access
- 8 February 2011
- Published by Elsevier in Knowledge-Based Systems
- Vol. 24 (5) , 629-641
Existential rigidity and many modalities in order-sorted logic
- 8 February 2011
- Published by Elsevier in Knowledge-Based Systems
- Vol. 24 (5) , 629-641
Open AccessExistential rigidity and many modalities in order-sorted logic
- 30 November 2010
- Published by Taylor & Francis in Applied Artificial Intelligence
- Vol. 24 (10) , 896-913
SEQUENCE-INDEXED LINEAR-TIME TEMPORAL LOGIC: PROOF SYSTEM AND APPLICATION
We propose a proof system for reasoning on certain specifications of secure authentication systems. For this purpose, a new logic, sequence-indexed linear-time temporal logic (SLTL), is obtained semantically from standard linear-time temporal logic (LTL) by adding a sequence modal operator that represents a sequence of symbols. By this sequence modal operator, we can appropriately express message flows between clients and servers and states of servers in temporal reasoning. A Gentzen-type sequent calculus for SLTL is introduced, and the completeness and cut-elimination theorems for it are proved. SLTL is also shown to be PSPACE-complete and embeddable into LTL.
- 30 November 2010
- Published by Taylor & Francis in Applied Artificial Intelligence
- Vol. 24 (10) , 896-913
SEQUENCE-INDEXED LINEAR-TIME TEMPORAL LOGIC: PROOF SYSTEM AND APPLICATION
We propose a proof system for reasoning on certain specifications of secure authentication systems. For this purpose, a new logic, sequence-indexed linear-time temporal logic (SLTL), is obtained semantically from standard linear-time temporal logic (LTL) by adding a sequence modal operator that represents a sequence of symbols. By this sequence modal operator, we can appropriately express message flows between clients and servers and states of servers in temporal reasoning. A Gentzen-type sequent calculus for SLTL is introduced, and the completeness and cut-elimination theorems for it are proved. SLTL is also shown to be PSPACE-complete and embeddable into LTL.
- 1 January 2010
- Published by INSTICC
- p. 464-469
PARACONSISTENT NEGATION AND CLASSICAL NEGATION IN COMPUTATION TREE LOGIC
- 1 January 2010
- Published by INSTICC
- p. 464-469
PARACONSISTENT NEGATION AND CLASSICAL NEGATION IN COMPUTATION TREE LOGIC