arXiv:2603. 13854v2 Announce Type: replace-cross Abstract: We introduce power term polynomial algebra, a representation language for Boolean formulae designed to bridge conjunctive normal form (CNF) and algebraic normal form (ANF).
By Emanuele Sansone, Armando Solar-Lezama
arXiv:2608. 04945v1 Announce Type: cross Abstract: The emergence of the ISO standard GQL introduces a powerful query language extending first-order logic with controlled recursion, raising the question of its applicability to evaluation of ontology-mediated queries (OMQs).
By David Carral, Calixte Gruson, Quentin Mani\`ere
arXiv:2608. 08118v1 Announce Type: new Abstract: There are several methods for searching for graphs with prescribed properties, such as SAT solvers and specialized generators.
By David Seka, Stefan Szeider
arXiv:2407. 15510v2 Announce Type: replace Abstract: Abstraction is key to human and artificial intelligence as it allows one to identify common structure in otherwise distinct objects or situations.
By Christian Anti\'c
arXiv:2608. 13433v1 Announce Type: cross Abstract: Transformer-based language models are known to sometimes generalize to sequences longer than seen during training, but we lack a precise characterization of which tasks admit length generalization.
By Andy Yang, Blerta Veseli, Corentin Barloy, Micha\"el Cadilhac, Andreas Krebs, Charles Paperman, Howard Straubing, Michael Hahn
The emergence of the ISO standard GQL introduces a powerful query language extending first-order logic with controlled recursion, raising the question of its applicability to evaluation of ontology-mediated queries (OMQs). We focus on OMQs consisting of atomic queries over ontologies expressed in Horn-ALCHI, an expressive Description Logic that is not, in general, first-order rewritable.