A Schema-aware Logic Reformulation for Graph Reachability
<|reference_start|>A Schema-aware Logic Reformulation for Graph Reachability: Graph reachability is the task of understanding whether two distinct points in a graph are interconnected by arcs to which in general a semantic is attached. Reachability has plenty of applications, ranging from motion planning to routing. Improving reachability requires structural knowledge of relations so as to avoid the complexity of traditional depth-first and breadth-first strategies, implemented in logic languages. In some contexts, graphs are enriched with their schema definitions establishing domain and range for every arc. The introduction of a schema-aware formalization for guiding the search may result in a sensitive improvement by cutting out unuseful paths and prioritising those that, in principle, reach the target earlier. In this work, we propose a strategy to automatically exclude and sort certain graph paths by exploiting the higher-level conceptualization of instances. The aim is to obtain a new first-order logic reformulation of the graph reachability scenario, capable of improving the traditional algorithms in terms of time, space requirements, and number of backtracks. The experiments exhibit the expected advantages of the approach in reducing the number of backtracks during the search strategy, resulting in saving time and space as well.<|reference_end|>
@article{di pierro2024a,
    title={A Schema-aware Logic Reformulation for Graph Reachability},
    author={Davide Di Pierro and Stefano Ferilli},
    journal={arXiv preprint arXiv:2410.02533},
    year={2024},
    archivePrefix={arXiv},
    eprint={2410.02533},
    primaryClass={cs.AI}
}