The Search is performed on all of the following fields:
Note: Please use complete words only.

Publication Title

Abstract

Publication Keywords

DOI

Proceeding Title

Proceeding Foreword

ISBN (Completed)

Insticc Ontology

Author Affiliation

Author Name

Editor Name

If you're looking for an exact phrase use quotation marks on text fields.

Paper

Theoretical Basis of Language System with State ConstraintsTopics: AI-based Computing, AI-based Analysis; Complexity Theory; Formal Methods and System Verification; Information Systems; Linguistic and Cognitive Systems; Mathematical Models; Multi-Agent Systems; Ontology Engineering; Simulation and Modeling; System Specification and Modeling; Usability of Complex Information Systems

Keyword(s):Programming Language, Algebraic Expression, State Constraint System.

Abstract: This paper presents theoretical basis of a language system whose program is described as algebraic expressions and implemented as abstract state machine. The behaviors of the described expressions may be captured (with their models) as causing sequences for state transitions, where composition and alternation for state transitions are mechanized in algebraic structure. Monitoring facilities to the language system may be described with state concepts, as well. With respect to intuitionistic logic and logical program containing negatives, Heyting algebra expressions are taken rather than already established nonmonotonic reasoning programs with negations, where 3-valued domain may be of use for the undefined to be allowable such that positives and negatives may be consistently evaluated, instead of rigid 2-valued settlements. We may have a standard form of Heyting algebra expressions in accordance to logical and AI programming, where the expressions are constrained with states. The states may be regarded as environmental conditions or objects as in object-oriented programming. As regards 3-valued models of given expressions, monotonic mapping cannot be in general associated with, but some ways are presented to approximate fixed points of a mapping for the given expression. Then the formal description of programs may be given with reference to state transitions, which is thought of as proposing a language system structure.(More)

This paper presents theoretical basis of a language system whose program is described as algebraic expressions and implemented as abstract state machine. The behaviors of the described expressions may be captured (with their models) as causing sequences for state transitions, where composition and alternation for state transitions are mechanized in algebraic structure. Monitoring facilities to the language system may be described with state concepts, as well. With respect to intuitionistic logic and logical program containing negatives, Heyting algebra expressions are taken rather than already established nonmonotonic reasoning programs with negations, where 3-valued domain may be of use for the undefined to be allowable such that positives and negatives may be consistently evaluated, instead of rigid 2-valued settlements. We may have a standard form of Heyting algebra expressions in accordance to logical and AI programming, where the expressions are constrained with states. The states may be regarded as environmental conditions or objects as in object-oriented programming. As regards 3-valued models of given expressions, monotonic mapping cannot be in general associated with, but some ways are presented to approximate fixed points of a mapping for the given expression. Then the formal description of programs may be given with reference to state transitions, which is thought of as proposing a language system structure.

Guests can use SciTePress Digital Library without having a SciTePress account. However, guests have limited access to downloading full text versions of papers and no access to special options.

Guests can use SciTePress Digital Library without having a SciTePress account. However, guests have limited access to downloading full text versions of papers and no access to special options.

Yamasaki, S. (2020). Theoretical Basis of Language System with State Constraints.In Proceedings of the 5th International Conference on Complexity, Future Information Systems and Risk - Volume 1: COMPLEXIS, ISBN 978-989-758-427-5, pages 80-87. DOI: 10.5220/0009385100800087

@conference{complexis20, author={Susumu Yamasaki.}, title={Theoretical Basis of Language System with State Constraints}, booktitle={Proceedings of the 5th International Conference on Complexity, Future Information Systems and Risk - Volume 1: COMPLEXIS,}, year={2020}, pages={80-87}, publisher={SciTePress}, organization={INSTICC}, doi={10.5220/0009385100800087}, isbn={978-989-758-427-5}, }

TY - CONF

JO - Proceedings of the 5th International Conference on Complexity, Future Information Systems and Risk - Volume 1: COMPLEXIS, TI - Theoretical Basis of Language System with State Constraints SN - 978-989-758-427-5 AU - Yamasaki, S. PY - 2020 SP - 80 EP - 87 DO - 10.5220/0009385100800087