Skip to content
conftrace_

complexity analysis

95 papers

Papers

Revisiting Conjunctive Query Entailment for S AAAI 2026 Symmetries and Other Variations of “End-Recursive” HTN Problems: Mapping the Border Between Decidable and Undecidable Restrictions AAAI 2026 Towards Single Exponential Time for Temporal and Spatial Reasoning: A Study via Redundancy and Dynamic Programming AAAI 2026 A Structural Complexity Analysis of Hierarchical Task Network Planning IJCAI 2025 Checking Consistency of CP-Theory Preferences in Polynomial Time AAAI 2025 Fast Computing of Dung Semantics in Acyclic Probabilistic Argumentation Frameworks AAAI 2025 Initial Models and Serialisability in Abstract Dialectical Frameworks IJCAI 2025 Multi-Organizational Scheduling: Individual Rationality, Optimality, and Complexity IJCAI 2025 On Measuring Inconsistency in Graph Databases with Regular Path Constraints (Abstract Reprint) IJCAI 2025 Parameterized Complexity of Caching in Networks AAAI 2025 Reasoning Models Reason Well, Until They Don’t IJCNLP 2025 Robustness in Single-Audience Value-based Abstract Argumentation: Complexity Results IJCAI 2025 Shapley Value Computation in Ontology-Mediated Query Answering (Extended Abstract) IJCAI 2025 Verifying Quantized Graph Neural Networks is PSPACE-complete IJCAI 2025 Why Prompt Design Matters and Works: A Complexity Analysis of Prompt Search Space in LLMs ACL 2025 Complexity of Credulous and Skeptical Acceptance in Epistemic Argumentation Framework AAAI 2024 Computational Argumentation: Reasoning, Dynamics, and Supporting Explainability IJCAI 2024 Epistemic Logic Programs: Non-Ground and Counting Complexity IJCAI 2024 General Epistemic Abstract Argumentation Framework: Semantics and Complexity IJCAI 2024 Learning Partitions from Context NeurIPS 2024 Learning Planning Domains from Non-redundant Fully-Observed Traces: Theoretical Foundations and Complexity Analysis AAAI 2024 On the Computational Complexity of Plan Verification, (Bounded) Plan-Optimality Verification, and Bounded Plan Existence AAAI 2024 Optimisation and Approximation in Abstract Argumentation: The Case of Stable Semantics IJCAI 2024 Robust and Faster Zeroth-Order Minimax Optimization: Complexity and Applications NeurIPS 2024 Complexity of Efficient Outcomes in Binary-Action Polymatrix Games and Implications for Coordination Problems IJCAI 2023