@misc{RoemerbeimGrabenHuberLiebletal., author = {R{\"o}mer, Ronald and beim Graben, Peter and Huber-Liebl, Markus and Wolff, Matthias}, title = {Unifying Physical Interaction, Linguistic Communication, and Language Acquisition of Cognitive Agents by Minimalist Grammars}, series = {Frontiers in Computer Science}, journal = {Frontiers in Computer Science}, number = {4}, issn = {2624-9898}, doi = {10.3389/fcomp.2022.733596}, pages = {21}, abstract = {Cognitive agents that act independently and solve problems in their environment on behalf of a user are referred to as autonomous. In order to increase the degree of autonomy, advanced cognitive architectures also contain higher-level psychological modules with which needs and motives of the agent are also taken into account and with which the behavior of the agent can be controlled. Regardless of the level of autonomy, successful behavior is based on interacting with the environment and being able to communicate with other agents or users. The agent can use these skills to learn a truthful knowledge model of the environment and thus predict the consequences of its own actions. For this purpose, the symbolic information received during the interaction and communication must be converted into representational data structures so that they can be stored in the knowledge model, processed logically and retrieved from there. Here, we firstly outline a grammar-based transformation mechanism that unifies the description of physical interaction and linguistic communication and on which the language acquisition is based. Specifically, we use minimalist grammar (MG) for this aim, which is a recent computational implementation of generative linguistics. In order to develop proper cognitive information and communication technologies, we are using utterance meaning transducers (UMT) that are based on semantic parsers and a mental lexicon, comprising syntactic and semantic features of the language under consideration. This lexicon must be acquired by a cognitive agent during interaction with its users. To this aim we outline a reinforcement learning algorithm for the acquisition of syntax and semantics of English utterances. English declarative sentences are presented to the agent by a teacher in form of utterance meaning pairs (UMP) where the meanings are encoded as formulas of predicate logic. Since MG codifies universal linguistic competence through inference rules, thereby separating innate linguistic knowledge from the contingently acquired lexicon, our approach unifies generative grammar and reinforcement learning, hence potentially resolving the still pending Chomsky-Skinner controversy. btuktuminglear, btuktsptech, btuktcogsys}, language = {en} } @misc{BeimGrabenHuberLieblKlimczaketal., author = {Beim Graben, Peter and Huber-Liebl, Markus and Klimczak, Peter and Wirsching, G{\"u}nther}, title = {Machine Semiotics}, series = {arXiv}, journal = {arXiv}, pages = {1 -- 48}, abstract = {Recognizing a basic difference between the semiotics of humans and machines presents a possibility to overcome the shortcomings of current speech assistive devices. For the machine, the meaning of a (human) utterance is defined by its own scope of actions. Machines, thus, do not need to understand the conventional meaning of an utterance. Rather, they draw conversational implicatures in the sense of (neo-)Gricean pragmatics. For speech assistive devices, the learning of machine-specific meanings of human utterances, i.e. the fossilization of conversational implicatures into conventionalized ones by trial and error through lexicalization appears to be sufficient. Using the quite trivial example of a cognitive heating | device, we show that — based on dynamic semantics — this process can be formalized as the reinforcement learning of utterance-meaning pairs (UMP).}, language = {en} } @misc{MaierKuhnBeisegeletal., author = {Maier, Isidor Konrad and Kuhn, Johannes and Beisegel, Jesse and Huber-Liebl, Markus and Wolff, Matthias}, title = {Minimalist Grammar: Construction without Overgeneration}, series = {arXiv}, journal = {arXiv}, doi = {10.48550/arXiv.2311.01820}, pages = {51}, abstract = {In this paper we give instructions on how to write a minimalist grammar (MG). In order to present the instructions as an algorithm, we use a variant of context free grammars (CFG) as an input format. We can exclude overgeneration, if the CFG has no recursion, i.e. no non-terminal can (indirectly) derive to a right-hand side containing itself. The constructed MGs utilize licensors/-ees as a special way of exception handling. A CFG format for a derivation A_eats_B↦∗peter_eats_apples, where A and B generate noun phrases, normally leads to overgeneration, e.\,g., i_eats_apples. In order to avoid overgeneration, a CFG would need many non-terminal symbols and rules, that mainly produce the same word, just to handle exceptions. In our MGs however, we can summarize CFG rules that produce the same word in one item and handle exceptions by a proper distribution of licensees/-ors. The difficulty with this technique is that in most generations the majority of licensees/-ors is not needed, but still has to be triggered somehow. We solve this problem with ϵ-items called \emph{adapters}.}, language = {en} } @misc{RoemerbeimGrabenHuberLiebletal., author = {R{\"o}mer, Ronald and beim Graben, Peter and Huber-Liebl, Markus and Wolff, Matthias}, title = {(Pre-)linguistic Problem Solving based on Dynamic Semantics}, series = {14th IEEE International Conference on Cognitive Infocommunications - CogInfoCom 2023, September 22-23, Budapest, Hungary}, journal = {14th IEEE International Conference on Cognitive Infocommunications - CogInfoCom 2023, September 22-23, Budapest, Hungary}, isbn = {979-8-3503-2565-2}, issn = {2473-5671}, doi = {10.1109/CogInfoCom59411.2023.10397487}, pages = {147 -- 152}, language = {en} } @misc{HuberLieblRoemerWirschingetal., author = {Huber-Liebl, Markus and R{\"o}mer, Ronald and Wirsching, G{\"u}nther and Schmitt, Ingo and beim Graben, Peter and Wolff, Matthias}, title = {Quantum-inspired Cognitive Agents}, series = {Frontiers in Applied Mathematics and Statistics}, journal = {Frontiers in Applied Mathematics and Statistics}, number = {8}, issn = {2297-4687}, doi = {10.3389/fams.2022.909873}, pages = {1 -- 31}, abstract = {The concept of intelligent agents is—roughly speaking—based on an architecture and a set of behavioral programs that primarily serve to solve problems autonomously. Increasing the degree of autonomy and improving cognitive performance, which can be assessed using cognitive and behavioral tests, are two important research trends. The degree of autonomy can be increased using higher-level psychological modules with which needs and motives are taken into account. In our approach we integrate these modules in architecture for an embodied, enactive multi-agent system, such that distributed problem solutions can be achieved. Furthermore, after uncovering some weaknesses in the cognitive performance of traditionally designed agents, we focus on two major aspects. On the one hand, the knowledge processing of cognitive agents is based on logical formalisms, which have deficiencies in the representation and processing of incomplete or uncertain knowledge. On the other hand, in order to fully understand the performance of cognitive agents, explanations at the symbolic and subsymbolic levels are required. Both aspects can be addressed by quantum-inspired cognitive agents. To investigate this approach, we consider two tasks in the sphere of Shannon's famous mouse-maze problem: namely classifying target objects and ontology inference. First, the classification of an unknown target object in the mouse-maze, such as cheese, water, and bacon, is based on sensory data that measure characteristics such as odor, color, shape, or nature. For an intelligent agent, we need a classifier with good prediction accuracy and explanatory power on a symbolic level. Boolean logic classifiers do work on a symbolic level but are not adequate for dealing with continuous data. Therefore, we demonstrate and evaluate a quantum-logic-inspired classifier in comparison to Boolean-logic-based classifiers. Second, ontology inference is iteratively achieved by a quantum-inspired agent through maze exploration. This requires the agent to be able to manipulate its own state by performing actions and by collecting sensory data during perception. We suggest an algebraic approach where both kinds of behaviors are uniquely described by quantum operators. The agent's state space is then iteratively constructed by carrying out unitary action operators, while Hermitian perception operators act as observables on quantum eigenstates. As a result, an ontology emerges as the simultaneous solution of the respective eigenvalue equations. Tags: btuktqiai; btuktcogsys; btukttheseus; btuktqtheseus}, language = {en} }