Multi-modal Mu-calculus Semantics for Knowledge Construction

This position paper aims at setting a new semantics for multi-modal mu-calculus to represent interactive states where abstract actions may be applied to. A least fixed point formula may be available to denote states allowing interaction. A simple algebraic representation for interactive states can be definable. For communication between human and machinery, a modality is reserved. In applicative task domains, knowledge construction is focused on with respect to interactive action applications through communications. Panel touch behaviour on iDevice as practice, URL references as functions and grammatical rule applications for sequential effects are studied, as knowledge construction technologies. These views coherent with abstract state machine are finally related to recent trends as semiring in algebraic structure and coalgebra for streams as sequential knowledge structures. A refinement of interactive techniques is positioned into a formal approach to multi-modal logic, applicable to some practices.

[1]  Javier Esparza,et al.  A Logical Viewpoint on Process-algebraic Quotients , 2022 .

[2]  Wojciech Jamroga,et al.  A logic for strategic reasoning , 2005, AAMAS '05.

[3]  Laura Giordano,et al.  Ramification and causality in a modal action logic , 2000, J. Log. Comput..

[4]  Francesco Zappa Nardelli,et al.  Behavioural Theory for Mobile Ambients , 2004, IFIP TCS.

[5]  Takumi Kasai,et al.  An Hierarchy Between Context-Free and Context-Sensitive Languages , 1970, J. Comput. Syst. Sci..

[6]  Robin Milner,et al.  Communicating and mobile systems - the Pi-calculus , 1999 .

[7]  Clara Bertolissi,et al.  Expressing combinatory reduction systems derivations in the rewriting calculus , 2006, High. Order Symb. Comput..

[8]  Marcello M. Bonsangue,et al.  Coalgebraic Characterizations of Context-Free Languages , 2013, Log. Methods Comput. Sci..

[9]  R. Chapey.  Language intervention strategies in aphasia and related neurogenic communication disorders , 2008 .

[10]  Yde Venema.  Automata and fixed point logic: A coalgebraic perspective , 2006, Inf. Comput..

[11]  Hiroyuki Tanabe,et al.  A Bi-phase Model of Folding Origami Interactively with Gap Representation , 2013, 2013 17th International Conference on Information Visualisation.

[12]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

[13]  Somesh Jha,et al.  Weighted pushdown systems and their application to interprocedural dataflow analysis , 2003, Sci. Comput. Program..

[14]  Susumu Yamasaki,et al.  A Construction of Logic-Constrained Functions with Respect to Awareness , 2010, MALLOW.

[15]  Susumu Yamasaki.  Logic programming with default, weak and strict negations , 2006, Theory Pract. Log. Program..