1,721,025 research outputs found
NeVer: a tool for artificial neural networks verification
No full textThe adoption of Artificial Neural Networks (ANNs) in safety-related ap-
plications is often avoided because it is difficult to rule out possible misbehaviors with
traditional analytical or probabilistic techniques. In this paper we present NeVer, our
tool for checking safety of ANNs. NeVer encodes the problem of verifying safety of
ANNs into the problem of satisfying corresponding Boolean combinations of linear
arithmetic constraints. We describe the main verification algorithm and the structure
of NeVer. We present also empirical results confirming the effectiveness of NeVer
on realistic case studies
Checking safety of neural networks with SMT solvers: a comparative evaluation
No full textIn this paper we evaluate state-of-the-art SMT solvers on encodings of verification problems involving Multi-Layer Perceptrons (MLPs), a widely used type of neural network. Verification is a key technology to foster adoption of MLPs in safety-related applications, where stringent requirements about performance and robustness must be ensured and demonstrated. While safety problems for MLPs can be attacked solving Boolean combinations of linear arithmetic constraints, the generated encodings are hard for current state-of-the-art SMT solvers, limiting our ability to verify MLPs in practice
Key Metalogical Propositions on a Variant of Hilbert’s Epsilon-Calculus
No full textHilbert’s ε-operator, a foundational device for forming indefinite descriptions, has long been overshadowed
by standard quantifiers in first-order logic. However, its capacity to eliminate quantifiers and reframe logical
derivations makes it a compelling tool for alternative proof strategies and automated reasoning. This paper revisits
the ε-calculus, offering a streamlined proof of completeness adapted from Hasenjaeger’s 1953 approach. Building
on earlier work by Leisenring, Davis, and Fechter, we present a variant of the ε-calculus that omits all predicate
symbols aside from equality. The development follows the conventional structure of logical systems—syntax,
semantics, and deductive calculus—culminating in a soundness and completeness result. The aim is to reaffirm
the ε-operator’s relevance in the foundations of logic through a simplified and accessible formal treatment
Ensuring safety of policies learned by reinforcement: Reaching objects in the presence of obstacles with the iCub
No full textDiophantine Modeling of Provability in Algebraic Logic
No full textIt has long been established that the set Th of theorems in an axiomatic formal theory is recursively enumerable
(r.e.). Building upon the Davis-Putnam-Robinson-Matiyasevich theorem, which states that every r.e. set is
Diophantine, this paper explores the complexity of representing Th through a Diophantine equation D = 0.
We contend that a good trade-off between two primary measures of the complexity of the representation,
which are the number of unknowns and the degree of the polynomial D, should aim at the transparency of
the representation. Our work builds on a previous construction, notably that of M. Carl and B.Z. Moroz, who
have provided a Diophantine representation of the sentences provable in the Gödel-Bernays class theory (NBG)
within first-order predicate calculus. In contrast, our Diophantine representation of NBG relies on a modernized
version of Schröder’s algebra of relations, specifically the L× equational calculus proposed by A. Tarski and S.
Givant. Additionally, we replace NBG’s traditional axioms with an alternative axiomatization by H. Friedmann.
These changes reduce the complexity of the Diophantine representation of NBG’s provability, while maintaining
equivalence to more classical formalizations. While we provide only preliminary insights into this novel equational
axiomatization, we report on initial experiments with these axioms using the Vampire theorem prover
Weighted Assumption Based Argumentation to reason about ethical principles and actions
No full textWeaugment Assumption Based Argumentation (ABA for short) with weighted argumentation. In a nutshell, we assign weights to arguments and then derive the weight of attacks between ABA arguments. We illustrate our proposal through running examples in the field of ethical reasoning, and present an implementation based on Answer Set Programming
From Blueprint Personas to Epistemic Agents: A Comparative Study of ASP-Based and L-DINF-Based Approaches to Medical Appointment Scheduling
No full textThis paper investigates the evolution from a medical appointment scheduling framework based on Answer Set
Programming (ASP) integrated with Blueprint Personas to a more cognitively rich, agent-based scheduling system
employing the L-DINF epistemic logic framework. We illustrate how agent-oriented models incorporating beliefs,
intentions, and dynamic reasoning capabilities can effectively enhance or replace the persona-based constraint
optimization traditionally used. Key advantages of the L-DINF model, such as improved adaptability, enhanced
explainability, and more human-like decision-making, are emphasized. Furthermore, a structured translation
methodology from static personas into dynamic epistemic agents is proposed, accompanied by a modular logical
architecture supporting real-time, responsive scheduling
Going Beyond Counting First Authors in Author Co-citation Analysis
Full text linkThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
An ASP-based Approach to UAM Strategic Deconfliction: preliminary results
No full textUrban Air Mobility (UAM) promises to revolutionize transportation in metropolitan areas by introducing “air taxis” for passenger and cargo transport. However, the envisioned dense operations of UAM vehicles in lowaltitude airspace pose unprecedented challenges for air traffic management (ATM). The Strategic Deconfliction (SD) problem in UAM is about designing the pre-flight “air traffic plan” for potentially hundreds or thousands of simultaneous urban flights, allocating routes, times, and resources in a way that guarantees separation and operational feasibility before any aircraft even leaves the ground. This short paper presents an approach based on Answer Set Programming (ASP) to solve the SD problem in UAM and reports preliminary results on a use case. In particular, the modelling choices will be described with regard to the air network topology, the fleet of drones to be scheduled and the SD proble
- …
