The proceedings contain 24 papers. The special focus in this conference is on programming. The topics include: Sound and Complete Concolic Testing for Higher-order Functions;strong-Separation logic;types for Complexit...
ISBN:
(纸本)9783030720186
The proceedings contain 24 papers. The special focus in this conference is on programming. The topics include: Sound and Complete Concolic Testing for Higher-order Functions;strong-Separation logic;types for Complexity of Parallel Computation in Pi-Calculus;checking Robustness Between Weak Transactional Consistency Models;verified Software Units;an Automated Deductive Verification Framework for Circuit-building Quantum Programs;nested Session Types;coupled Relational Symbolic Execution for Differential Privacy;graded Hoare logic and its Categorical Semantics;coupled relational symbolic execution for differential privacy;graded hoare logic and its categorical semantics;etaps foreword;preface;For a Few Dollars More: Verified Fine-Grained Algorithm Analysis Down to LLVM;run-time Complexity Bounds Using Squeezers;complete trace models of state and control;session Coalgebras: A Coalgebraic View on Session Types and Communication Protocols;correctness of Sequential Monte Carlo Inference for Probabilistic programming Languages;densities of Almost Surely Terminating Probabilistic Programs are Differentiable Almost Everywhere;graded Modal Dependent Type theory;automated Termination Analysis of Polynomial Probabilistic Programs;bayesian strategies: probabilistic programs as generalised graphical models;data Flow Analysis of Asynchronous Systems using Infinite Abstract Domains.
The issue of fairness is a well-known challenge in Machine Learning (ML) that has gained increased importance with the emergence of Large Language Models (LLMs) and generative AI. Algorithmic bias can manifest during ...
详细信息
Recently there has been an increasing interest in frameworks extending Dung's abstract Argumentation Framework (AF). Popular extensions include bipolar AFs and AFs with recursive attacks and necessary supports. Al...
详细信息
Recently there has been an increasing interest in frameworks extending Dung's abstract Argumentation Framework (AF). Popular extensions include bipolar AFs and AFs with recursive attacks and necessary supports. Although the relationships between AF semantics and Partial Stable Models (PSMs) of logic programs has been deeply investigated, this is not the case for more general frameworks extending AF. In this paper we explore the relationships between AF-based frameworks and PSMs. We show that every AF-based framework Delta can be translated into a logic programP(Delta)so that the extensions prescribed by different semantics of Delta coincide with subsets of the PSMs ofP(Delta). We provide a logicprogramming approach that characterizes, in an elegant and uniform way, the semantics of several AF-based frameworks. This result allows also to define the semantics for new AF-based frameworks, such as AFs with recursive attacks and recursive deductive supports.
Answer Set programming (ASP) is a popular declarative programming language for solving hard combinatorial problems. Although ASP has gained widespread acceptance in academic and industrial contexts, there are certain ...
详细信息
We propose a method for generating rule sets as global and local explanations for tree-ensemble learning methods using Answer Set programming (ASP). To this end, we adopt a decompositional approach where the split str...
详细信息
Reaction Systems (RSs) are a successful natural computing framework inspired by chemical reaction networks. A RS consists of a set of entities and a set of reactions. Entities can enable or inhibit each reaction, and ...
详细信息
ISBN:
(纸本)9783030904258;9783030904241
Reaction Systems (RSs) are a successful natural computing framework inspired by chemical reaction networks. A RS consists of a set of entities and a set of reactions. Entities can enable or inhibit each reaction, and are produced by reactions or provided by the environment. In a previous paper, we defined an original labelled transition system (LTS) semantics for RSs in the structural operational semantics (SOS) style. This approach has several advantages: (i) it provides a formal specification of the RS dynamics that enables the reuse of many formal analysis techniques and favors the implementation of tools, and (ii) it facilitates the definition of extensions of the RS framework by simply modifying some of the SOS rules in a modular way. In this paper, we demonstrate the extensibility of the framework by defining two quantitative variants of RSs: with reaction delays/durations, and with concentration levels. We provide a prototype logicprogramming implementation and apply our tool to a RS model of Th cells differentiation in the immune system.
Gamification has proven to be an effective tool in enhancing engagement and learning across various disciplines, particularly in complex fields like computer science and project management. This paper explores a novel...
详细信息
ISBN:
(数字)9798331539498
ISBN:
(纸本)9798331539504
Gamification has proven to be an effective tool in enhancing engagement and learning across various disciplines, particularly in complex fields like computer science and project management. This paper explores a novel approach to teaching foundational concepts in game design, algorithmic thinking, theory of computation, and project planning through the use of card-based games. By blending gamification with pedagogical strategies, this approach simplifies complex topics and foster interactive, hands-on learning experiences for students and professionals alike. The central problem addressed by this research is the challenge of engaging students with abstract or technical concepts, such as algorithmic logic, regular expressions, and project management methodologies. Traditional lecture-based teaching methods often struggle to maintain interest and facilitate deep understanding in these areas. As a solution, card games offer an interactive, visual, and structured way to present these topics in a more accessible and enjoyable format. The gamified approach encourages participation, reinforces learning through repetition, and provides immediate feedback, all of which are key elements in promoting student success. This paper outlines the design, implementation, and testing of four card games, each focused on a specific educational domain. The game-on-game design introduces students to core principles like mechanics, dynamics, and aesthetics (MDA) through a series of design challenges and player interactions. The game on algorithmic thinking encourages players to solve problems step-by-step, mimicking the logic flow found in programming. For the theory of computation, a card game based on regular expressions and automata theory allows students to practice building and recognizing patterns. Finally, the game on project planning introduces learners to critical project management tools such as task delegation, resource allocation, and time management, using a scenario-based gam
In Probabilistic logicprogramming (PLP) the most commonly studied inference task is to compute the marginal probability of a query given a program. In this paper, we consider two other important tasks in the PLP sett...
详细信息
In Probabilistic logicprogramming (PLP) the most commonly studied inference task is to compute the marginal probability of a query given a program. In this paper, we consider two other important tasks in the PLP setting: the Maximum-A-Posteriori (MAP) inference task, which determines the most likely values for a subset of the random variables given evidence on other variables, and the Most Probable Explanation (MPE) task, the instance of MAP where the query variables are the complement of the evidence variables. We present a novel algorithm, included in the PITA reasoner, which tackles these tasks by representing each problem as a Binary Decision Diagram and applying a dynamic programming procedure on it. We compare our algorithm with the version of ProbLog that admits annotated disjunctions and can perform MAP and MPE inference. Experiments on several synthetic datasets show that PITA outperforms ProbLog in many cases.
We give an overview of the theory and practice of second-order rewriting. Second-order rewriting methods have been demonstrated as useful that is applicable to important notions of programming languages such as logic ...
详细信息
ISBN:
(纸本)9783030590246;9783030590253
We give an overview of the theory and practice of second-order rewriting. Second-order rewriting methods have been demonstrated as useful that is applicable to important notions of programming languages such as logicprogramming, algebraic effects, quantum computation, and cyclic computation. We explain foundation and evolution of second-order rewriting by presenting the framework of second-order computation systems. We also demonstrate our system SOL of second-order laboratory through various programming language examples.
In this work, we show that both logicprogramming and abstract argumentation frameworks can be interpreted in terms of Nelson's constructive logic N4. We do so by formalizing, in this logic, two principles that we...
详细信息
暂无评论