Algebraic Net Class Rewriting Systems, Syntax and Semantics for Knowledge Representation and Automated Problem Solving

05/24/2013
by   Seppo Ilari Tirri, et al.
0

The intention of the present study is to establish general framework for automated problem solving by approaching the task universal algebraically introducing knowledge as realizations of generalized free algebra based nets, graphs with gluing forms connecting in- and out-edges to nodes. Nets are caused to undergo transformations in conceptual level by type wise differentiated intervening net rewriting systems dispersing problems to abstract parts, matching being determined by substitution relations. Achieved sets of conceptual nets constitute congruent classes. New results are obtained within construction of problem solving systems where solution algorithms are derived parallel with other candidates applied to the same net classes. By applying parallel transducer paths consisting of net rewriting systems to net classes congruent quotient algebras are established and the manifested class rewriting comprises all solution candidates whenever produced nets are in anticipated languages liable to acceptance of net automata.

READ FULL TEXT

Authors

page 1

page 2

page 3

page 4

08/24/2013

Evolution Theory of Self-Evolving Autonomous Problem Solving Systems

The present study gives a mathematical framework for self-evolution with...
01/29/2021

A Categorical Semantics for Hierarchical Petri Nets

We show how a particular flavor of hierarchical nets, where the firing o...
06/04/2021

How to Bake Quantum into Your Pet Petri Nets and Have Your Net Theory Too

Petri nets have found widespread use among many application domains, not...
02/09/2018

The Monadic Second Order Theory of Grid-Free 1-Safe Petri Nets is Decidable

Finite 1-safe Petri nets, also called net systems, are natural models of...
02/03/2022

Modularization, Composition, and Hierarchization of Petri Nets with Heraklit

It is known for decades that computer-based systems cannot be understood...
10/20/2017

The Emptiness Problem for Valence Automata over Graph Monoids

This work studies which storage mechanisms in automata permit decidabili...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.