Image de couverture de livre

Epistemic Logic Programs: Non-Ground and Counting Complexity

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Eiter, Thomas, Fichte, Johannes K., Hecher, Markus, Woltran, Stefan
Format:	Preprint
Publié:	2025
Sujets:	Logic in Computer Science 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

Rejection in Abstract Argumentation: Harder Than Acceptance?
par: Fichte, Johannes K., et autres
Publié: (2024)

The Model Counting Competitions 2021-2023
par: Fichte, Johannes K., et autres
Publié: (2025)

Automated Hybrid Grounding Using Structural and Data-Driven Heuristics
par: Beiser, Alexander, et autres
Publié: (2025)

Complexity of Faceted Explanations in Propositional Abduction
par: Schmidt, Johannes, et autres
Publié: (2025)

The Model Counting Competition 2020
par: Fichte, Johannes K., et autres
Publié: (2020)

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

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

Compilation and Fast Model Counting beyond CNF
par: de Colnet, Alexis, et autres
Publié: (2025)

Data Complexity in Expressive Description Logics With Path Expressions
par: Bednarczyk, Bartosz
Publié: (2024)

Epistemic Skills: Reasoning about Knowledge and Oblivion
par: Liang, Xiaolong, et autres
Publié: (2025)

Answer-Set-Programming-based Abstractions for Reinforcement Learning
par: Bankosegger, Rafael, et autres
Publié: (2026)

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

Minimal Model Reasoning in Description Logics: Don't Try This at Home!
par: Di Stefano, Federica, et autres
Publié: (2025)

Spectra of Cardinality Queries over Description Logic Knowledge Bases
par: Manière, Quentin, et autres
Publié: (2024)

Extended Version of: On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions?
par: Hecher, Markus, et autres
Publié: (2024)

Epistemic Skills: Logical Dynamics of Knowing and Forgetting
par: Liang, Xiaolong, et autres
Publié: (2024)

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

Data-Complexity of the Two-Variable Fragment with Counting Quantifiers
par: Pratt-Hartmann, Ian
Publié: (2008)

Finite Groundings for ASP with Functions: A Journey through Consistency
par: Gerlach, Lukas, et autres
Publié: (2024)

Proof Complexity of Linear Logics
par: Tabatabai, Amirhossein Akbar, et autres
Publié: (2026)

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

On Deciding the Data Complexity of Answering Linear Monadic Datalog Queries with LTL Operators(Extended Version)
par: Artale, Alessandro, et autres
Publié: (2025)

Finite Variable Counting Logics with Restricted Requantification
par: Raßmann, Simon, et autres
Publié: (2024)

Fagin's Theorem for Semiring Turing Machines
par: Badia, Guillermo, et autres
Publié: (2025)

2-ASP(Q) programs with weak constraints: Complexity and efficient implementation
par: Cuteri, Andrea, et autres
Publié: (2026)

Complexity of the Guarded Two-Variable Fragment with Counting Quantifiers
par: Pratt-Hartmann, Ian
Publié: (2006)

Structure-Guided Automated Reasoning
par: Bannach, Max, et autres
Publié: (2023)

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

Reasoning About Knowledge on Regular Expressions is 2EXPTIME-complete
par: Ghosh, Avijeet, et autres
Publié: (2025)

A Theory of Formalisms for Representing Knowledge
par: Zhang, Heng, et autres
Publié: (2024)

Efficient Inference and Computation of Optimal Alternatives for Preference Languages Based On Lexicographic Models
par: Wilson, Nic, et autres
Publié: (2024)

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

Deductive Systems for Logic Programs with Counting
par: Fandinno, Jorge, et autres
Publié: (2025)

The Complexity and Expressive Power of Second-Order Extended Logic
par: Feng, Shiguang, et autres
Publié: (2022)

Solving Epistemic Logic Programs using Generate-and-Test with Propagation
par: Fandinno, Jorge, et autres
Publié: (2024)

FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming
par: Beniamini, Gal, et autres
Publié: (2025)

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

On the Complexity of the Numerically Definite Syllogistic and Related Fragments
par: Pratt-Hartmann, Ian
Publié: (2007)

Meta-Mathematics of Computational Complexity Theory
par: Oliveira, Igor C.
Publié: (2025)

The Scaling Properties of Implicit Deductive Reasoning in Transformers
par: Vompa, Enrico, et autres
Publié: (2026)