Image de couverture de livre

Gateways to Tractability for Satisfiability in Pearl's Causal Hierarchy

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Ganian, Robert, Gründel, Marlene, Wietheger, Simon
Format:	Preprint
Publié:	2025
Sujets:	Artificial Intelligence Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

From Probability to Counterfactuals: the Increasing Complexity of Satisfiability in Pearl's Causal Hierarchy
par: Dörfler, Julian, et autres
Publié: (2024)

A Structural Complexity Analysis of Hierarchical Task Network Planning
par: Brand, Cornelius, et autres
Publié: (2024)

Bilateral Treewidth for QBF: Where Strategies and Resolution Meet
par: Ganian, Robert, et autres
Publié: (2026)

Probabilistic and Causal Satisfiability: Constraining the Model
par: Bläser, Markus, et autres
Publié: (2025)

Pathways to Tractability for Geometric Thickness
par: Depian, Thomas, et autres
Publié: (2024)

The Limits of Tractable Marginalization
par: Broadrick, Oliver, et autres
Publié: (2025)

The Complexity of Optimizing Atomic Congestion
par: Brand, Cornelius, et autres
Publié: (2023)

Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity
par: Ganian, Robert, et autres
Publié: (2025)

Solving Satisfiability Modulo Counting for Symbolic and Statistical AI Integration With Provable Guarantees
par: Li, Jinzhao, et autres
Publié: (2023)

The Computational Complexity of Satisfiability in State Space Models
par: Alsmann, Eric, et autres
Publié: (2025)

Transformer Encoder Satisfiability: Complexity and Impact on Formal Reasoning
par: Sälzer, Marco, et autres
Publié: (2024)

On the Complexity of Identification in Linear Structural Causal Models
par: Dörfler, Julian, et autres
Publié: (2024)

A Provable Expressiveness Hierarchy in Hybrid Linear-Full Attention
par: Ye, Xiaowei, et autres
Publié: (2026)

The Descriptive Complexity of Relation Modification Problems
par: Chudigiewitsch, Florian, et autres
Publié: (2026)

Debate is efficient with your time
par: Brown-Cohen, Jonah, et autres
Publié: (2026)

On Probabilistic and Causal Reasoning with Summation Operators
par: Ibeling, Duligur, et autres
Publié: (2024)

A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics
par: Kazakov, Yevgeny, et autres
Publié: (2009)

A Parameterized-Complexity Framework for Finding Local Optima
par: Ganian, Robert, et autres
Publié: (2026)

Forgetting in short and heterogeneous sequences of belief revisions
par: Liberatore, Paolo
Publié: (2025)

Value Iteration with Guessing for Markov Chains and Markov Decision Processes
par: Chatterjee, Krishnendu, et autres
Publié: (2025)

Structure-Aware Encodings of Argumentation Properties for Clique-width
par: Mahmood, Yasir, et autres
Publié: (2025)

On the Holographic Geometry of Deterministic Computation
par: Nye, Logan
Publié: (2025)

Complexity Results of Persuasion
par: Grastien, Alban
Publié: (2025)

Training Cross-Morphology Embodied AI Agents: From Practical Challenges to Theoretical Foundations
par: Liu, Shaoshan, et autres
Publié: (2025)

A Quantale-Weakness Route to $P \neq NP$ via CD Evidence Normalization and Gauge-Buffered Locked Ensembles
par: Goertzel, Ben
Publié: (2025)

Solving Multiagent Path Finding on Highly Centralized Networks
par: Fioravantes, Foivos, et autres
Publié: (2024)

Strongly Polynomial Time Complexity of Policy Iteration for $L_\infty$ Robust MDPs
par: Asadi, Ali, et autres
Publié: (2026)

Clausal Deletion Backdoors for QBF: a Parameterized Complexity Approach
par: Eriksson, Leif, et autres
Publié: (2026)

Over the Edge of Chaos? Excess Complexity as a Roadblock to Artificial General Intelligence
par: Susnjak, Teo, et autres
Publié: (2024)

CSPs with Few Alien Constraints
par: Jonsson, Peter, et autres
Publié: (2024)

Prime Successor Irreducibility: Turing Machine Complexity, Kolmogorov Complexity, and Weakness-Based Formulations
par: Goertzel, Ben, et autres
Publié: (2026)

Probabilistic Generating Circuits -- Demystified
par: Agarwal, Sanyam, et autres
Publié: (2024)

The Computational Boundary of Inference: Capability Internalization, Training, and the Turing Jump
par: Lu, Chien-Ping
Publié: (2026)

Parameterized Complexity Of Representing Models Of MSO Formulas
par: Kučera, Petr, et autres
Publié: (2026)

An extended Knowledge Compilation Map for Conditional Preference Statements-based and Generalized Additive Utilities-based Languages
par: Fargier, Hélène, et autres
Publié: (2021)

Complexity of Scheduling Charging in the Smart Grid
par: de Weerdt, Mathijs, et autres
Publié: (2017)

Diversity of Extensions in Abstract Argumentation
par: Fichte, Johannes K., et autres
Publié: (2026)

ActionReasoningBench: Reasoning about Actions with and without Ramification Constraints
par: Handa, Divij, et autres
Publié: (2024)

Solving Quantified Boolean Formulas with Few Existential Variables
par: Eriksson, Leif, et autres
Publié: (2024)

Social Distancing Induced Coronavirus Optimization Algorithm (COVO): Application to Multimodal Function Optimization and Noise Removal
par: Varma, Om Ramakisan, et autres
Publié: (2024)