Control Structures of Rule-Based Agent Languages

Artificial Intelligence (AI) has received significant attention in recent years. It is being adopted to provide solutions to medicine, engineering, education, government and several other domains. To analyze the state-of-theart of research in AI, we present a systematic literature review focusing on the Evolution of AI programming languages. Our search returned 7,604 documents; after reviewing these documents, 78 which were relevant for this study were retained. Our research revealed that the prevalence of AI programming language by volume of publications had experienced peaks and valleys between 1963 and 2018; however, between 2015 to 2020, related publications have been experiencing peaks. During the review period, the PROLOG programming language received the most attention in about 49% of publications; this was followed by LISP, which received almost 22%. The remaining attention was shared between Logic and Object-Oriented Programming (LOOP), ARCHLOG, Epistemic Ontology Language with Constraints (EOLC), Python, C++, ADA and JAVA. However, the predominant AI programming language in recent AI software is C/C++, which takes 70% of the modern AI libraries analyzed in this study. Python is used in 60% of the modern AI libraries analyzed. Their prevalence is as a result of their speed, portability and ease of coding, making them effective in developing trending AI libraries such as TensorFlow and Keras.

Artificial Intelligence in the American Healthcare Industry: Looking Forward to 2030

Mark Watson Morgan Kaufmann Publishers, San Francisco, 1997, 377 pp. ISBN 1-55860-420-0, $44.95 This book is well written and organized to cover how to apply AI (Artificial Intelligence) techniques for practical Internet and Intranet tools by using the Java programming language. In the book, the author uses neural network and genetic algorithms to develop distributed systems that are applied for the Internet and Intranets, such as client/server model and information retrieval tool and so on. Part 1 begins with a good general introduction to AI. The history and survey of Artificial Intelligence research are given briefly. In addition, symbolic processing versus neural networks approaches are discussed. This author opts to use neural network to develop example Internet/Intranet systems in the book. Part 2 consists of Java programs developed for AI, neural networks, genetic algorithms, natural language processing, and expert systems. Chapter 2 illustrates Graphical User Interface (GUI) class that is derived from Applet and Canvas classes in Java, which is used in most example programs in the book. Chapter 3 introduces a frame data structure that is used as a message in distributed systems in the later chapters. Chapter 4 shows neural network classes developed in Java and its theory and implementation. Chapter 5 explains the genetic algorithms and the Java genetic algorithm classes. Chapter 6 describes how to develop and implement natural language processing classes using Java. Chapter 7 shows how to share data objects in distributed systems. For example, distributed AI agent classes are developed to share data objects, WWW data collection agent classes are shown to retrieve documents in the Internet, and small POP (Post Office Protocol) mail classes are developed to send and receive mails. Chapter 8 illustrates how to develop expert systems by using Java Jess, which is based on OPS5/CLIPS expert systems. Part 3 explains how to generate and implement the projects using the Java classes that are developed in Part 2. Chapter 9 shows the project that demonstrates the use of genetic algorithms in chapter 5 to control enemy ships in a scrolling arcade game. Chapter 10 describes the real-time handwriting recognition system developed by using the neural network classes in chapter 4. Chapter 11 illustrates a greedy algorithm to optimize neural networks that is based on the author’s hand-tuning neural training data. Chapter 12 improves neural network training data by applying genetic algorithms, to discard bad training data and to avoid discarding good training data. Chapter 13 describes the distributed natural language processing system that uses natural language processing classes in chapter 6. The data structures in chapter 2 are used to store historical data in a separate server application on any other computer in the Internet or Intranets. The final chapter provides the design and implementation of a complete agent-based information retrieval tool for the Internet. The retrieved documents are stored in ASCII or HTML format. This book is a very good reference book for anyone interested in developing systems using Java in distributed environments, especially applying AI techniques. Also, the author provides the CD-ROM that includes the source code for Java classes developed in the book. Haklin Kimm, University of Tennessee

We define an operational (transition system) semantics for the two most basic forms of Discrete Event Simulation (DES): event-based simulation (without objects) and object-event simulation. We show that under our operational semantics, DES models correspond to a certain form of abstract state machines (ASMs) such that the Future Event List (FEL) is part of the transition system state and the transition function is based on event routines. Unlike other formalisms proposed for DES (such as Petri Nets or DEVS), our ASM semantics takes all basic DES concepts (like event types and the FEL) into consideration and allows for expressive transition system states representing the objects, properties, relations and functions of the evolving possible worlds of a simulation run. As a direct formal semantics of DES, it provides a basis for comparing, and explaining design choices in, different DES approaches.

Purpose Reactive rules are used for programming rule-based Web agents, which have the ability to detect events and respond to them automatically and can have complex structure and unpredictable behavior. The aim of this paper is to provide an appropriate formal framework for analyzing such rules. Design/methodology/approach To achieve this goal, the authors give two alternative semantics for the basic reactive rules’ families which allow us to specify reactive rule-based agents and verify their intended behavior. The first approach expresses the functionality of production and event condition action rules in terms of equations, whereas the second methodology is based in the formalism of rewriting logic. Both semantics can be expressed within the framework of CafeOBJ algebraic specification language, which then offers the verification support and have their advantages and downsides. Findings The authors report on experiences gained by applying those methodologies in a reactive rule-based system and compare the two methodologies. Originality/value Finally, the authors demonstrate a tool that translates a set of reactive rules into CafeOBJ rewrite rules, thus making the verification of reactive rules possible for inexperienced users.

Preface: Volume 59, Issue 4

Creol is an object-oriented modeling language in which inherently concurrent objects exchange asynchronous method calls. The operational semantics of Creol is written in an actor-based style, formulated in rewriting logic. The operational semantics yields a language interpreter in the Maude system, which can be used to analyze models. Recently, Creol has been applied to the modeling of systems with radio communication, such as sensor systems. With radio communication, messages expire and, if sent simultaneously, they may collide in the air. In order to capture these and other properties of distributed systems, we extended Creol's operational semantics with a notion of time. We exploit the framework of a language interpreter to use a lightweight notion of time, in contrast to that needed for a general purpose specification language. This paper presents a timed extension of Creol, including the semantics and the implementation strategy, and discusses its properties using an extended example. The approach can be generalized to other concurrent object or actor-based systems.

Definition of programming languages consists of the formal definition of syntax and semantics. One of the most popular semantic methods used in various stages of software engineering is structural operational semantics. It describes program behavior in the form of state changes after execution of elementary steps of program. This feature makes structural operational semantics useful for implementation of programming languages and also for verification purposes. In our paper we present a new approach to structural operational semantics. We model behavior of programs in category of states, where objects are states, an abstraction of computer memory and morphisms model state changes, execution of a program in elementary steps. The advantage of using categorical model is its exact mathematical structure with many useful proved properties and its graphical illustration of program behavior as a path, i.e. a composition of morphisms. Our approach is able to accentuate dynamics of structural operational semantics. For simplicity, we assume that data are intuitively typed. Visualization and facility of our model is not only a new model of structural operational semantics of imperative programming languages but it can also serve for education purposes.

In the dynamic field of programming education, integrating artificial intelligence (AI) tools has started to play a significant role in enhancing learning experiences. This paper presents a case study conducted during a foundational programming course for first-year students in higher education, where students were encouraged to utilize generative artificial intelligence programming copilot extensions in their programming IDE and browser-based generative AI tools as supportive AI tools. The primary objective was to observe the impact of AI on the learning curve and the overall educational experience.Key findings suggest that the introduction of AI tools significantly altered the learning experience for students. Many who initially struggled with grasping elementary programming concepts found that AI support made understanding basic programming concepts much easier, enhancing their confidence and skills. This was particularly evident in the reduced levels of anxiety typically associated with early programming learning, as the AI copilot provided a non-judgmental, always-available source for clarifying doubts, including queries that students might hesitate to ask in a traditional classroom setting.Notably, some students leveraged the AI to generate similar exercise problems, reinforcing their understanding and skills. The AI's capability to address basic queries also freed up the instructor's time, allowing for more personalized student guidance in more advanced problems. This shift in the instructional dynamic further contributed to a learning environment where students felt more comfortable engaging with complex topics, thereby reducing the psychological barriers often linked with early-stage programming education.The course's structure, enriched by AI, enabled students to delve into more complex programming constructs earlier than traditional curricula would allow. For instance, students were tasked with simulating basic e-commerce operations, such as user registration, product browsing, and cart functionalities. These practical challenges naturally introduced advanced concepts like external data storage, unit testing, and user interface design, which are typically reserved for more advanced courses. With the help of generative AI programming copilot tools, students at any programming skill level were able to develop nearly functional complex structures. Interestingly, even when their projects were not fully functional, students remained motivated. Instead of feeling discouraged by these imperfect outcomes, they showed resilience and a keen interest in understanding and improving their code. This reaction is a significant shift from traditional learning settings, where unfinished or flawed projects often lead to increased anxiety or a drop in motivation.Furthermore, the AI's proactive suggestions inspired students to explore beyond the curriculum. Advanced learners delved into databases, cryptography libraries in Python, and even more advanced user interface design, ensuring that they remained engaged and challenged. This elementary course, enhanced by generative AI tools, also inspired students to learn other programming languages since they now learned that individual learning is more available with the aid of generative AI.In conclusion, the integration of AI in programming education offers a promising avenue for enhancing both the learning experience and outcomes. This case study underscores the potential of AI to revolutionize traditional teaching methodologies, fostering a more dynamic, responsive, and inclusive learning environment.This paper handles the results, possibilities and challenges of AI empowered education in programming. It also gives practical examples as well as future research perspectives.

In order to develop courses related to artificial intelligence and mathematics, this study provides plans for the composition and operation of courses related to artificial intelligence and mathematics in college general mathematics by analyzing the mathematics curriculum, artificial intelligence and mathematics-related research, and selecting learning elements and contents. The content needed to deal with the principles of artificial intelligence in mathematics is mainly related to calculus, probability and statistics, and linear algebra. Such mathematical learning content is one of the functions of artificial intelligence. Since it is necessary for analysis and expression, neural networks, clustering, unsupervised learning, and optimization, these contents must be included in artificial intelligence and mathematics-related courses in college general mathematics. In addition, in courses related to artificial intelligence and mathematics, it is difficult for students to learn various topics such as linear algebra and multi-variable calculus, which are essential as basic mathematics for understanding machine learning, all in one semester. Thus, in this study, I propose that we divide the course into two subjects, <Artificial Intelligence Mathematics 1> and <Artificial Intelligence Mathematics 2>, so that college students can select and take the courses according to their abilities and needs. Lastly, while theory-oriented classes are essential for understanding the principles of artificial intelligence in artificial intelligence and mathematics-related courses, applied learning is also crucial. This includes learning the basics of Python, a widely used programming language, for data analysis, data organization, and preprocessing. Additionally, applying these skills in real-life projects involving data analysis, artificial intelligence, and deep learning is necessary for comprehensive education.

The job of the constraint programmer is to use mathematical constraints to model real world constraints and objects. In this book, Kim Marriott and Peter Stuckey provide the first comprehensive introduction to the discipline of constraint programming and, in particular, constraint logic programming. The book covers the necessary background material from artificial intelligence, logic programming, operations research, and mathematical programming. Topics discussed range from constraint-solving techniques to programming methodologies for constraint programming languages. Because there is not yet a universally used syntax for constraint logic programming languages, the authors present the programs in a way that is independent of any existing programming language. Practical exercises cover how to use the book with a number of existing constraint languages.

Recently a logic programming language AC was proposed by Mellarkod et al. (2008) to integrate answer set programming (ASP) and constraint logic programming. Similarly, Gebser et al. (2009) proposed a CLINGCON language integrating ASP and finite domain constraints. These languages allow new efficient inference algorithms that combine traditional ASP procedures and other methods in constraint programming. In this paper we show that a transition system introduced by Nieuwenhuis et al. (2006) to model SAT solvers can be extended to model the "hybrid" Acsolver algorithm by Mellarkod et al. developed for simple AC programs and the Clingcon algorithm by Gebser et al. for clingcon programs. We define weakly-simple programs and show how the introduced transition systems generalize the Acsolver and Clingcon algorithms to such programs. Finally, we state the precise relation between AC and CLINGCON languages and the Acsolver and Clingcon algorithms.

Der Ausdruck Quality of Service (QoS) beschreibt die Güte eines erbrachten Dienstes. QoS beschreibt Eigenschaften wie Antwortzeit, Verfügbarkeit, den Grad der Nachrichten-Verschlüsselung oder den Durchsatz. QoS ist sowohl für Multi-Media Anwendungen (Audio- und Video-Übertragung) als auch für Geschäftsanwendungen wichtig. Die vorgelegte Arbeit konzentriert sich dabei auf das Feld der Geschäftsanwendungen. Solche Anwendungen arbeiten mit Transaktionen wie etwa dem Bestellen eines Produkts oder der Überweisung von Geld zwischen Konten. QoS Eigenschaften solcher Anwendungen sind beispielsweise die Anzahl an Transaktionen während eines Zeitintervalls, die maximale Anzahl gleichzeitig mit dem System arbeitender Nutzer, oder die zu erwartende Verfügbarkeit. Durch Middleware kann die Realisierung von Verteilung vor dem Programmierer verborgen werden. In einer idealen Welt würde Middleware dasselbe für QoS leisten. Das heißt, der Entwickler spezifiziert nur die gewünschte Dienstgüte und kümmert sich nicht darum, wie sie realisiert wird. Das ist so aber nicht möglich, denn die zu erbringende Dienstgüte hat massive Auswirkungen auf das Design einer Applikation. Daher muss QoS schon in der Design-Phase angegangen werden, was mit einer rein Middleware-gestützten Herangehensweise nicht möglich ist. Die vorgelegte Arbeit zeigt, wie dieses Problem durch einen modellgetriebenen Ansatz behoben werden kann. Die Entwicklung beginnt dann mit einem Plattform-unabhängigen Modell (PIM), welches das Verhalten und die QoS Eigenschaften der Applikation beschreibt. Dieses Modell wird automatisch durch eine Modell-Transformation in ein Plattform-spezifisches Modell (PSM) umgewandelt. Das PSM beschreibt das Design einer Implementierung für eine spezifische Plattform und berücksichtigt dabei die im PIM beschriebenen QoS-Eigenschaften. Um dieses Szenario in der Praxis anwenden zu können, müssen zwei Probleme gelöst werden: das Modellieren von QoS Eigenschaften und die Modell-Transformation. Gegenwärtig erfordert das Erstellen einer Modell-Transformation detailliertes Wissen über die Modellierungssprache und ihre Interna. Um das zu vereinfachen, wurde im Rahmen dieser Arbeit die visuelle Regelbasierte Transformationssprache Kafka entwickelt. Kafka und die zugehörigen Werkzeuge bauen auf Graphtransformations-Theorie auf. Kafka vereinfacht das Erstellen von Transformationen weil es auf der Notation des PIM und PSM aufbaut. Daher muss der Entwickler nichts von den Interna (etwa dem Meta-Modell) verstehen. Um PIMs von QoS-fähigen Applikationen zu erstellen, wurde die Modellierungssprache PIQML entwickelt, welche auf UML 2.0 Komponenten, Hierarchischen Nachrichten Sequenz Diagrammen (HMSCs) und einer neuen Meta-Modell Erweiterung für QoS Verträge basiert. Die vorgelegte Arbeit zeigt, wie PIQML Modelle auf verschiedene Zielplattformen (Programmiersprachen und Middleware Produkte) abgebildet werden können. Basierend auf PIQML und Kafka wurde das Werkzeug Kase entwickelt, welches das Editieren von PIQML Modellen (PIMs), UML Modellen (PSMs) und Kafka Transformationen integriert. Das Ergebnis ist eine integrierte Werkzeug-Kette für das modellgetriebene Entwickeln QoS-fähiger verteilter Applikationen.

Graph transformation has recently become more and more popular as a general, rule-based visual specification paradigm to formally capture (a) requirements or behavior of user models (on the model-level), and (b) the operational semantics of modeling languages (on the meta-level) as demonstrated by benchmark applications around the Unified Modeling Language (UML). The current paper focuses on the model checking-based automated formal verification of graph transformation systems used either on the model-level or meta-level. We present a general translation that inputs (i) a metamodel of an arbitrary visual modeling language, (ii) a set of graph transformation rules that defines a formal operational semantics for the language, and (iii) an arbitrary well-formed model instance of the language and generates a transitions system (TS) that serve as the underlying mathematical specification formalism of various model checker tools. The main theoretical benefit of our approach is an optimization technique that projects only the dynamic parts of the graph transformation system into the target transition system, which results in a drastical reduction in the state space. The main practical benefit is the use of existing back-end model checker tools, which directly provides formal verification facilities (without additional efforts required to implement an analysis tool) for many practical applications captured in a very high-level visual notation. The practical feasibility of the approach is demonstrated by modeling and analyzing the well-known verification benchmark of dining philosophers both on the model and meta-level.

We study hyper transition systems as a formalism to give semantics to specification languages which support both unbounded angelic and unbounded demonic non-determinism as well as recursion. Hyper transition are a generalization of transition systems and are suited for the specification of computations by means of properties that atomic steps in a computation have to satisfy. As an application we use a hyper transition system to give an operational semantics to the language of Back's refinement calculus. This operational semantics abstracts from the internal configurations and we prove it to be equivalent to the standard weakest precondition semantics. Finally, we propose a refinement relation that preserves the atomic step of a computation and generalizes the simulation relation on ordinary transition systems. This can be used to augment specification languages with a form of concurrency.