Tootfinder

A General Framework of Epistemic Forgetting and its Instantiation by Ranking Functions
Christoph Beierle, Alexander Hahn, Diana Howey, Gabriele Kern-Isberner, Kai Sauerwald
https://arxiv.org/abs/2508.21441

A General Framework of Epistemic Forgetting and its Instantiation by Ranking Functions
Forgetting as a knowledge management operation deliberately ignores parts of the knowledge and beliefs of an agent, for various reasons. Forgetting has many facets, one may want to forget parts of the syntax, a proposition, or a conditional. In the literature, two main operators suitable for performing forgetting have been proposed and investigated in depth: First, variable elimination is a syntactical method that blends out certain atomic variables to focus on the rest of the language. It has …

Adaptive Monitoring and Real-World Evaluation of Agentic AI Systems
Manish Shukla
https://arxiv.org/abs/2509.00115 https://arxiv.org/pdf/2509.00115

Adaptive Monitoring and Real-World Evaluation of Agentic AI Systems
Agentic artificial intelligence (AI) -- multi-agent systems that combine large language models with external tools and autonomous planning -- are rapidly transitioning from research laboratories into high-stakes domains. Our earlier "Basic" paper introduced a five-axis framework and proposed preliminary metrics such as goal drift and harm reduction but did not provide an algorithmic instantiation or empirical evidence. This "Advanced" sequel fills that gap. First, we revisit recent benchmarks a…

Text-to-Code Generation for Modular Building Layouts in Building Information Modeling
Yinyi Wei, Xiao Li
https://arxiv.org/abs/2509.23713 https://arxiv.org…

Text-to-Code Generation for Modular Building Layouts in Building Information Modeling
We present Text2MBL, a text-to-code generation framework that generates executable Building Information Modeling (BIM) code directly from textual descriptions of modular building layout (MBL) design. Unlike conventional layout generation approaches that operate in 2D space, Text2MBL produces fully parametric, semantically rich BIM layouts through on-the-fly code instantiation. To address MBLs' unique challenges due to their hierarchical three-tier structure: modules (physical building blocks), …

Static Security Vulnerability Scanning of Proprietary and Open-Source Software: An Adaptable Process with Variants and Results
James J. Cusick
https://arxiv.org/abs/2509.16985 h…

Static Security Vulnerability Scanning of Proprietary and Open-Source Software: An Adaptable Process with Variants and Results
Software vulnerabilities remain a significant risk factor in achieving security objectives within software development organizations. This is especially true where either proprietary or open-source software (OSS) is included in the technological environment. In this paper an end-to-end process with supporting methods and tools is presented. This industry proven generic process allows for the custom instantiation, configuration, and execution of routinized code scanning for software vulnerabilit…

Dependently Sorted Nominal Signatures
Maribel Fern\'andez (King s College London, UK), Miguel Pagano (FAMAF - Universidad Nacional de C\'ordoba, Argentina), Nora Szasz (Universidad ORT Uruguay), \'Alvaro Tasistro (Universidad ORT Uruguay)
https://arxiv.org/abs/2510.12305

Dependently Sorted Nominal Signatures
We investigate an extension of nominal many-sorted signatures in which abstraction has a form of instantiation, called generalised concretion, as elimination operator (similarly to lambda-calculi). Expressions are then classified using a system of sorts and sort families that respects alpha-conversion (similarly to dependently-typed lambda-calculi) but not allowing names to carry abstraction sorts, thus constituting a first-order dependent sort system. The system can represent forms of judgemen…

Quantifier Instantiations: To Mimic or To Revolt?
Jan Jakub\r{u}v, Mikol\'a\v{s} Janota
https://arxiv.org/abs/2508.13811 https://arxiv.org/pdf/2508.138…

Quantifier Instantiations: To Mimic or To Revolt?
Quantified formulas pose a significant challenge for Satisfiability Modulo Theories (SMT) solvers due to their inherent undecidability. Existing instantiation techniques, such as e-matching, syntax-guided, model-based, conflict-based, and enumerative methods, often complement each other. This paper introduces a novel instantiation approach that dynamically learns from these techniques during solving. By treating observed instantiations as samples from a latent language, we use probabilistic con…

Solving Set Constraints with Comprehensions and Bounded Quantifiers
Mudathir Mohamed, Nick Feng, Andrew Reynolds, Cesare Tinelli, Clark Barrett, Marsha Chechik
https://arxiv.org/abs/2508.08496

Solving Set Constraints with Comprehensions and Bounded Quantifiers
Many real applications problems can be encoded easily as quantified formulas in SMT. However, this simplicity comes at the cost of difficulty during solving by SMT solvers. Different strategies and quantifier instantiation techniques have been developed to tackle this. However, SMT solvers still struggle with quantified formulas generated by some applications. In this paper, we discuss the use of set-bounded quantifiers, quantifiers whose variable ranges over a finite set. These quantifiers can…