:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Wilson, Nic, George, Anne-Marie
Formato:	Preprint
Publicado:	2024
Materias:	Logic in Computer Science Artificial Intelligence Computational Complexity
Acceso en línea:	https://arxiv.org/abs/2410.23913
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Towards Fast Algorithms for the Preference Consistency Problem Based on Hierarchical Models
por: George, Anne-Marie, et al.
Publicado: (2024)

Computation and Complexity of Preference Inference Based on Hierarchical Models
por: Wilson, Nic, et al.
Publicado: (2024)

On Middle Grounds for Preference Statements
por: George, Anne-Marie, et al.
Publicado: (2025)

On Probabilistic and Causal Reasoning with Summation Operators
por: Ibeling, Duligur, et al.
Publicado: (2024)

Spectra of Cardinality Queries over Description Logic Knowledge Bases
por: Manière, Quentin, et al.
Publicado: (2024)

The Computational Complexity of Satisfiability in State Space Models
por: Alsmann, Eric, et al.
Publicado: (2025)

Probabilistic and Causal Satisfiability: Constraining the Model
por: Bläser, Markus, et al.
Publicado: (2025)

Compilation and Fast Model Counting beyond CNF
por: de Colnet, Alexis, et al.
Publicado: (2025)

Minimal Model Reasoning in Description Logics: Don't Try This at Home!
por: Di Stefano, Federica, et al.
Publicado: (2025)

A Theory of Formalisms for Representing Knowledge
por: Zhang, Heng, et al.
Publicado: (2024)

Data Complexity in Expressive Description Logics With Path Expressions
por: Bednarczyk, Bartosz
Publicado: (2024)

Rejection in Abstract Argumentation: Harder Than Acceptance?
por: Fichte, Johannes K., et al.
Publicado: (2024)

Epistemic Skills: Reasoning about Knowledge and Oblivion
por: Liang, Xiaolong, et al.
Publicado: (2025)

Complexity of Faceted Explanations in Propositional Abduction
por: Schmidt, Johannes, et al.
Publicado: (2025)

Epistemic Logic Programs: Non-Ground and Counting Complexity
por: Eiter, Thomas, et al.
Publicado: (2025)

Solving Satisfiability Modulo Counting for Symbolic and Statistical AI Integration With Provable Guarantees
por: Li, Jinzhao, et al.
Publicado: (2023)

On Deciding the Data Complexity of Answering Linear Monadic Datalog Queries with LTL Operators(Extended Version)
por: Artale, Alessandro, et al.
Publicado: (2025)

Reasoning About Knowledge on Regular Expressions is 2EXPTIME-complete
por: Ghosh, Avijeet, et al.
Publicado: (2025)

2-ASP(Q) programs with weak constraints: Complexity and efficient implementation
por: Cuteri, Andrea, et al.
Publicado: (2026)

The Scaling Properties of Implicit Deductive Reasoning in Transformers
por: Vompa, Enrico, et al.
Publicado: (2026)

Transformer Encoder Satisfiability: Complexity and Impact on Formal Reasoning
por: Sälzer, Marco, et al.
Publicado: (2024)

Verifying Quantized GNNs With Readout Is Decidable But Highly Intractable
por: Chernobrovkin, Artem, et al.
Publicado: (2025)

Meta-Mathematics of Computational Complexity Theory
por: Oliveira, Igor C.
Publicado: (2025)

Data-Complexity of the Two-Variable Fragment with Counting Quantifiers
por: Pratt-Hartmann, Ian
Publicado: (2008)

On the Complexity of the Numerically Definite Syllogistic and Related Fragments
por: Pratt-Hartmann, Ian
Publicado: (2007)

FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming
por: Beniamini, Gal, et al.
Publicado: (2025)

Near-Optimal Encodings of Cardinality Constraints
por: Krapivin, Andrew, et al.
Publicado: (2026)

Optimal Lower Bounds for Symmetric Modular Circuits
por: Pago, Benedikt
Publicado: (2026)

Finding hardness reductions automatically using SAT solvers
por: Bergold, Helena, et al.
Publicado: (2024)

Specification and Automatic Verification of Computational Reductions
por: Grange, Julien, et al.
Publicado: (2024)

Logic and Computation through the Lens of Semirings
por: Barlag, Timon, et al.
Publicado: (2025)

Functional variant of Polynomial Analogue of Gandy's Fixed Point Theorem
por: Nechesov, Andrey
Publicado: (2024)

Feasibly Constructive Proof of Schwartz-Zippel Lemma and the Complexity of Finding Hitting Sets
por: Atserias, Albert, et al.
Publicado: (2024)

$Π_{2}^{P}$ vs PSpace Dichotomy for the Quantified Constraint Satisfaction Problem
por: Zhuk, Dmitriy
Publicado: (2024)

Proof Complexity of Linear Logics
por: Tabatabai, Amirhossein Akbar, et al.
Publicado: (2026)

An order out of nowhere: a new algorithm for infinite-domain CSPs
por: Mottet, Antoine, et al.
Publicado: (2023)

The Proof Analysis Problem
por: Arteche, Noel, et al.
Publicado: (2025)

Proof complexity of positive branching programs
por: Das, Anupam, et al.
Publicado: (2021)

Parallelism and Adaptivity in Student-Teacher Witnessing
por: Ježil, Ondřej, et al.
Publicado: (2026)

Effective Versions of Strong Measure Zero
por: Rayman, Matthew
Publicado: (2025)