Reasoning about Resources and Information: A Linear Logic Approach

Authors:
Norihiro Kamide;Ken Kaneiwa
Affiliations:
Faculty of Information Technology and Business, Cyber University, Japan Cyber Educational Institute, Ltd., 4F of Izumi Shiba-kouen Building, 1-6-8 Shiba-kouen, Minato-ku, Tokyo 105-0011, Japan. dr ...;Department of Electrical Engineering and Computer Science, Iwate University, 4-3-5 Ueda, Morioka, Iwate 020-8551, Japan. kaneiwa@cis.iwate-u.ac.jp
Venue:
Fundamenta Informaticae
Year:
2013

Citing 11
Cited 0

Linear logic

Theoretical Computer Science
Logic of Information Structures

Logic of Information Structures
A uniform semantic proof for cut-elimination and completeness of various first and higher order logics

Theoretical Computer Science
Artificial Intelligence: A Modern Approach

Artificial Intelligence: A Modern Approach
Possible worlds and resources: the semantics of BI

Theoretical Computer Science - Mathematical foundations of programming semantics
Order-sorted logic programming with predicate hierarchy

Artificial Intelligence
Combining Soft Linear Logic and Spatio-temporal Operators

Journal of Logic and Computation
Linear and affine logics with temporal, spatial and epistemic operators

Theoretical Computer Science
Extended Full Computation-Tree Logic with Sequence Modal Operator: Representing Hierarchical Tree Structures

AI '09 Proceedings of the 22nd Australasian Joint Conference on Advances in Artificial Intelligence
SEQUENCE-INDEXED LINEAR-TIME TEMPORAL LOGIC: PROOF SYSTEM AND APPLICATION

Applied Artificial Intelligence
A proof system for temporal reasoning with sequential information

SBIA'10 Proceedings of the 20th Brazilian conference on Advances in artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.