Tootfinder

Counting Answer Sets of Disjunctive Answer Set Programs
Mohimenul Kabir, Supratik Chakraborty, Kuldeep S Meel
https://arxiv.org/abs/2507.11655 https://

Counting Answer Sets of Disjunctive Answer Set Programs
Answer Set Programming (ASP) provides a powerful declarative paradigm for knowledge representation and reasoning. Recently, counting answer sets has emerged as an important computational problem with applications in probabilistic reasoning, network reliability analysis, and other domains. This has motivated significant research into designing efficient ASP counters. While substantial progress has been made for normal logic programs, the development of practical counters for disjunctive logic pr…

ExpliCIT-QA: Explainable Code-Based Image Table Question Answering
Maximiliano Hormaz\'abal Lagos, \'Alvaro Bueno S\'aez, Pedro Alonso Doval, Jorge Alcalde Vesteiro, H\'ector Cerezo-Costas
https://arxiv.org/abs/2507.11694

ExpliCIT-QA: Explainable Code-Based Image Table Question Answering
We present ExpliCIT-QA, a system that extends our previous MRT approach for tabular question answering into a multimodal pipeline capable of handling complex table images and providing explainable answers. ExpliCIT-QA follows a modular design, consisting of: (1) Multimodal Table Understanding, which uses a Chain-of-Thought approach to extract and transform content from table images; (2) Language-based Reasoning, where a step-by-step explanation in natural language is generated to solve the prob…

From Grounding to Skolemization: A Logic-Constrained Vector Symbolic Architecture for Complex Query Answering
Yuyin Lu, Hegang Chen, Yanghui Rao
https://arxiv.org/abs/2509.10837

From Grounding to Skolemization: A Logic-Constrained Vector Symbolic Architecture for Complex Query Answering
Complex Query Answering (CQA) over incomplete Knowledge Graphs (KGs), typically formalized as reasoning with Existential First-Order predicate logic with one free variable (EFO$_1$), faces a fundamental trade-off between logical soundness and computational efficiency. This work establishes the Grounding-Skolemization dichotomy for systematically analyzing CQA methods through the lens of formal logic. While Grounding-based methods inherently suffer from combinatorial explosion, most Skolemizatio…

‘I don’t want their support anymore!’ says president, calling supporters demanding answers on Epstein files ‘weaklings’
Trump lashes out at supporters as poll says most Americans believe key details on Epstein being hidden: Latest updates | The Independent
https://www.independent.co.uk/news/world/americas/us-politics/trump-epstein-files-live-updates-b2790938.html

Anthem 2.0: Automated Reasoning for Answer Set Programming
Jorge Fandinno, Christoph Glinzer, Zachary Hansen, Jan Heuer, Yuliya Lierler, Vladimir Lifschitz, Torsten Schaub, Tobias Stolzmann
https://arxiv.org/abs/2507.11704

Anthem 2.0: Automated Reasoning for Answer Set Programming
Anthem 2.0 is a tool to aid in the verification of logic programs written in an expressive fragment of Clingo's input language named mini-gringo, which includes arithmetic operations and simple choice rules but not aggregates. It can translate logic programs into formula representations in the logic of here-and-there, and analyze properties of logic programs such as tightness. Most importantly, Anthem 2.0 can support program verification by invoking first-order theorem provers to confirm that a…

Ukraine meldet Toten nach Angriff
Bei einem russischen Raketenangriff auf die ukrainische Region Dnipropetrowsk ist nach Angaben des Gouverneurs ein Mensch getötet worden. Mindestens ein weiterer sei verletzt worden, teilte Serhij Lysak. Ein Lastwagen und ein Kleinbus seien beschädigt worden.
📑

Ukraine-Liveblog: ++ Trump gegen NATO-Sicherheitsgarantien für Ukraine ++
Auf dem Weg zum Treffen mit Russlands Präsident Putin hat sich US-Präsident Trump gegen Sicherheitsgarantien der NATO für die Ukraine ausgesprochen. Der ukrainische Präsident Selenskyj appellierte an Trump: "Wir zählen auf Amerika."

Isotopy versus equivariant isotopy in dimensions three and higher
Trent Lucas
https://arxiv.org/abs/2508.11104 https://arxiv.org/pdf/2508.11104

Isotopy versus equivariant isotopy in dimensions three and higher
Given a finite group action on a smooth manifold, we study the following question: if two equivariant diffeomorphisms are isotopic, must they be equivariantly isotopic? Birman-Hilden and Maclachlan-Harvey proved the answer is "yes" for most surfaces. By contrast, we give a general criterion in higher dimensions under which there are many equivariant diffeomorphisms which are isotopic but not equivariantly isotopic. Examples satisfying this criterion include branched covers of split links and "s…

Comment on Decidability of Quasi-Dense Modal Logics by Lyon and Ostropolski-Nalewaja
Olivier Gasquet
https://arxiv.org/abs/2507.11644 https://

Comment on Decidability of Quasi-Dense Modal Logics by Lyon and Ostropolski-Nalewaja
In \cite{Lyon24} the question of the decidability of quasi-dense modal logics is answered, and an upper bound in EXPSPACE is given. Unfortunately, authors' intricate proof contains a major flaw that cannot be fixed, leaving the question wide open. Once identified, this error roughly amounts to assuming that the union of two consistent sets is consistent, which is of course wrong.

Fine-grained Timing Analysis of Digital Integrated Circuits in Answer Set Programming
Alessandro Bertagnon, Marcello Dalpasso, Michele Favalli, Marco Gavanelli
https://arxiv.org/abs/2507.11150

Fine-grained Timing Analysis of Digital Integrated Circuits in Answer Set Programming
In the design of integrated circuits, one critical metric is the maximum delay introduced by combinational modules within the circuit. This delay is crucial because it represents the time required to perform a computation: in an Arithmetic-Logic Unit it represents the maximum time taken by the circuit to perform an arithmetic operation. When such a circuit is part of a larger, synchronous system, like a CPU, the maximum delay directly impacts the maximum clock frequency of the entire system. Ty…

Path-filtration for modal logics applied to revisiting quasi-dense logics
Olivier Gasquet
https://arxiv.org/abs/2507.11258 https://ar…

Path-filtration for modal logics applied to revisiting quasi-dense logics
In https://arxiv.org/pdf/2405.10094 (also published at LICS'24 conference), Lyon and Ostropolski-Nalewaja answer the question of the decidability of quasi-dense modallogics, and give an upper bound in EXPSPACE. Unfortunately, their intricate proof contains a major flaw that cannot be fixed, leaving the question wide open. In this paper we provide a correct and rather simple and direct proof of it by introducing a new variant of the well-know filtration method based on paths in a canonical model…