DADalal Alrajeh

Dalal Alrajeh

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Dalal Alrajeh has a total of 26 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Data-Dependent Goal Modeling for ML-Enabled Law Enforcement Systems

    by Dalal Alrajeh, Vesna Nowack, Patrick Benjamin, Katie Thomas, William Hobson, Carolina Gutierrez Muñoz, Catherine Hamilton-Giachritsis, Juliane A. Kloess, Jessica Woodhams, Daniel Butler, et al.

    Investigating serious crimes is inherently complex and resource-constrained. Law enforcement agencies (LEAs) grapple with overwhelming volumes of offender and incident data, making effective suspect identification difficult. Although machine learning (ML)-enabled systems have been explored to support LEAs, several have failed in practice. This highlights the need to align system behavior with stakeholder goals early in development, motivating the use of Goal-Oriented Requirements Engineering (GORE). This paper reports our experience applying the GORE framework KAOS to designing an ML-enabled system for identifying suspects in online child sexual abuse. We describe how KAOS supported early requirements elaboration, including goal refinement, object modeling, agent assignment, and operationalization. A key finding is the central role of data elicitation: data requirements constrain refinement choices and candidate agents while influencing how goals are linked, operationalized, and satisfied. Conversely, goal elaboration and agent assignment shape data quality expectations and collection needs. Our experience highlights the iterative, bidirectional dependencies between goals, data, and ML performance. We contribute a reference model for integrating GORE with data-driven system development, and identify gaps in KAOS, particularly the need for explicit support for data elicitation and quality management. These insights inform future extensions of KAOS and, more broadly, the application of formal GORE methods to ML-enabled systems for high-stakes societal contexts.

  • Open Access

    Reasoning About Actual Causality in Answer Set Programming

    by Daniel Özcan, Dalal Alrajeh, Robert Craven

    Causal models provide a formal framework for identifying and reasoning about the causes of observed phenomena, making them valuable for decision-support contexts where understanding causality is essential. Yet applying these models in practice requires automated tools for key reasoning tasks. We present an Answer Set Programming (ASP)-based tool that supports three core capabilities for all acyclic binary causal models: (1) checking whether an event is an actual cause of another; (2) finding all minimal subsets of a failed candidate that do qualify as causes; and (3) inferring all actual causes of an outcome without assuming any candidate. Our tool is the first to support all three tasks within a unified framework, guaranteeing minimal contingency sets and outperforming prior implementations in both runtime and memory. We describe the system’s design and report on an empirical evaluation using existing benchmarks.


  • Open Access

    RNN Generalization to Omega-Regular Languages

    by Charles Pert, Dalal Alrajeh, Alessandra Russo

    Büchi automata (BAs) recognize $ω$-regular languages defined by formal specifications like linear temporal logic (LTL) and are commonly used in the verification of reactive systems. However, BAs face scalability challenges when handling and manipulating complex system behaviors. As neural networks are increasingly used to address these scalability challenges in areas like model checking, investigating their ability to generalize beyond training data becomes necessary. This work presents the first study investigating whether recurrent neural networks (RNNs) can generalize to $ω$-regular languages derived from LTL formulas. We train RNNs on ultimately periodic $ω$-word sequences to replicate target BA behavior and evaluate how well they generalize to out-of-distribution sequences. Through experiments on LTL formulas corresponding to deterministic automata of varying structural complexity, from 3 to over 100 states, we show that RNNs achieve high accuracy on their target $ω$-regular languages when evaluated on sequences up to $8 \times$ longer than training examples, with $92.6\%$ of tasks achieving perfect or near-perfect generalization. These results establish the feasibility of neural approaches for learning complex $ω$-regular languages, suggesting their potential as components in neurosymbolic verification methods.

  • Open Access

    Learning Neural Search Policies for Classical Planning

    by Pawel Gomoluch, Dalal Alrajeh, Alessandra Russo, Antonio Bucchiarone

    Heuristic forward search is currently the dominant paradigm in classical planning. Forward search algorithms typically rely on a single, relatively simple variation of best-first search and remain fixed throughout the process of solving a planning problem. Existing work combining multiple search techniques usually aims at supporting best-first search with an additional exploratory mechanism, triggered using a handcrafted criterion. A notable exception is very recent work which combines various search techniques using a trainable policy. It is, however, confined to a discrete action space comprising several fixed subroutines. In this paper, we introduce a parametrized search algorithm template which combines various search techniques within a single routine. The template's parameter space defines an infinite space of search algorithms, including, among others, BFS, local and random search. We further introduce a neural architecture for designating the values of the search parameters given the state of the search. This enables expressing neural search policies that change the values of the parameters as the search progresses. The policies can be learned automatically, with the objective of maximizing the planner's performance on a given distribution of planning problems. We consider a training setting based on a stochastic optimization algorithm known as the cross-entropy method (CEM). Experimental evaluation of our approach shows that it is capable of finding effective distribution-specific search policies, outperforming the relevant baselines.

  • Open Access

    Minimal Assumptions Refinement for GR(1) Specifications

    by Davide G. Cavezza, Dalal Alrajeh, Andras Gyorgy

    Reactive synthesis is concerned with finding a correct-by-construction controller from formal specifications, typically expressed in Linear Temporal Logic (LTL). The specifications describe assumptions about an environment and guarantees to be achieved by the controller operating in that environment. If a controller exists, given the assumptions, the specification is said to be realizable. This paper focuses on finding a minimal set of assumptions that guarantee realizability in the context of counterstrategy-guided assumption refinement procedures. Specifically, we introduce the notion of minimal assumptions refinements and provide an algorithm that provably computes these with little time overhead. We show experimentally, using common benchmarks, that embedding our algorithm in state-of-the-art approaches for assumption refinement results in consistently shorter solutions than without such embedding, and allows to explore a higher number of candidate solutions. We also propose a hybrid variant for dealing with the higher sparsity of solutions in the space of minimal refinements and show that its application speeds up the identification of a solution.


  • Open Access

    Learning Classical Planning Strategies with Policy Gradient

    by Pawel Gomoluch, Dalal Alrajeh, Alessandra Russo

    A common paradigm in classical planning is heuristic forward search. Forward search planners often rely on simple best-first search which remains fixed throughout the search process. In this paper, we introduce a novel search framework capable of alternating between several forward search approaches while solving a particular planning problem. Selection of the approach is performed using a trainable stochastic policy, mapping the state of the search to a probability distribution over the approaches. This enables using policy gradient to learn search strategies tailored to a specific distributions of planning problems and a selected performance metric, e.g. the IPC score. We instantiate the framework by constructing a policy space consisting of five search approaches and a two-dimensional representation of the planner's state. Then, we train the system on randomly generated problems from five IPC domains using three different performance metrics. Our experimental results show that the learner is able to discover domain-specific search strategies, improving the planner's performance relative to the baselines of plain best-first search and a uniform policy.

  • Open Access

    Interpolation-Based GR(1) Assumptions Refinement

    by Davide G. Cavezza, Dalal Alrajeh

    This paper considers the problem of assumptions refinement in the context of unrealizable specifications for reactive systems. We propose a new counterstrategy-guided synthesis approach for GR(1) specifications based on Craig's interpolants. Our interpolation-based method identifies causes for unrealizability and computes assumptions that directly target unrealizable cores, without the need for user input. Thereby, we discuss how this property reduces the maximum number of steps needed to converge to realizability compared with other techniques. We describe properties of interpolants that yield helpful GR(1) assumptions and prove the soundness of the results. Finally, we demonstrate that our approach yields weaker assumptions than baseline techniques, and finds solutions in case studies that are unsolvable via existing techniques.

  • Open Access

    A Weakness Measure for GR(1) Formulae

    by Davide G. Cavezza, Dalal Alrajeh, András György

    In spite of the theoretical and algorithmic developments for system synthesis in recent years, little effort has been dedicated to quantifying the quality of the specifications used for synthesis. When dealing with unrealizable specifications, finding the weakest environment assumptions that would ensure realizability is typically a desirable property; in such context the weakness of the assumptions is a major quality parameter. The question of whether one assumption is weaker than another is commonly interpreted using implication or, equivalently, language inclusion. However, this interpretation does not provide any further insight into the weakness of assumptions when implication does not hold. To our knowledge, the only measure that is capable of comparing two formulae in this case is entropy, but even it fails to provide a sufficiently refined notion of weakness in case of GR(1) formulae, a subset of linear temporal logic formulae which is of particular interest in controller synthesis. In this paper we propose a more refined measure of weakness based on the Hausdorff dimension, a concept that captures the notion of size of the omega-language satisfying a linear temporal logic formula. We identify the conditions under which this measure is guaranteed to distinguish between weaker and stronger GR(1) formulae. We evaluate our proposed weakness measure in the context of computing GR(1) assumptions refinements.

  • Open Access

    Towards learning domain-independent planning heuristics

    by Pawel Gomoluch, Dalal Alrajeh, Alessandra Russo, Antonio Bucchiarone

    Automated planning remains one of the most general paradigms in Artificial Intelligence, providing means of solving problems coming from a wide variety of domains. One of the key factors restricting the applicability of planning is its computational complexity resulting from exponentially large search spaces. Heuristic approaches are necessary to solve all but the simplest problems. In this work, we explore the possibility of obtaining domain-independent heuristic functions using machine learning. This is a part of a wider research program whose objective is to improve practical applicability of planning in systems for which the planning domains evolve at run time. The challenge is therefore the learning of (corrections of) domain-independent heuristics that can be reused across different planning domains.