arXiv AI By Amir Aavani

The $\mathbf{P}$-Completeness of Inverted Index Traversal: On the Complexity of Evaluating Boolean Query DAGs

Read the original on arXiv AI →

arXiv:2601. 18747v2 Announce Type: replace-cross Abstract: Modern AI agents increasingly rely on search infrastructure to execute complex, neuro-symbolic reasoning workflows.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI
Jul 28

Answering Path Queries under Linear and Guarded Existential Rules

arXiv:2607. 22636v1 Announce Type: new Abstract: Ontology-mediated query answering is concerned with the problem of answering queries over knowledge bases consisting of a database instance and an ontology.

By Jean-Fran\c{c}ois Baget (LIRMM, Inria, University of Montpellier, CNRS, France), Meghyn Bienvenu (Univ. Bordeaux, CNRS, Bordeaux INP, LaBRI, France), Marie-Laure Mugnier (LIRMM, Inria, University of Montpellier, CNRS, France), Micha\"el Thomazo (Inria, DIENS, ENS, PSL University, CNRS, France)
arXiv Computation and Language
Aug 28

Neuro-symbolic PRM: Enhancing Scientific Reasoning via Structured Traces and Symbolic Verification

The paper introduces a neuro‑symbolic framework for scientific reasoning that separates symbolic validity and semantic groundedness. A deterministic symbolic verifier acts as a hard filter to guarantee syntactic and arithmetic correctness, while a Process Reward Model (PRM) is trained on verifier‑accepted steps to assess contextual grounding. The authors propose Counterfactual Symbolic Perturbation (CSP) to generate hard negative examples that pass the verifier but are logically flawed, enabling efficient PRM training and a verifier‑first constrained search at inference.

By Yuxin Zi, Cong Xu, Suparna Bhattacharya, Martin Foltin, Amit Sheth