:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Ngouonou, Jovial Cheukam, Gindullin, Ramiz, Quimper, Claude-Guy, Beldiceanu, Nicolas, Douence, Remi
Format:	Preprint
Publié:	2025
Sujets:	Artificial Intelligence F.2.2, F.4.1
Accès en ligne:	https://arxiv.org/abs/2511.00194
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

$γ(3,4)$ `Attention' in Cognitive Agents: Ontology-Free Knowledge Representations With Promise Theoretic Semantics
par: Burgess, Mark
Publié: (2025)

Superpolynomial Length Lower Bounds for Tree-Like Semantic Proof Systems with Bounded Line Size
par: de Rezende, Susanna F., et autres
Publié: (2026)

Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs
par: de Rezende, Susanna F., et autres
Publié: (2019)

Unravelling Abstract Cyclic Proofs into Proofs by Induction
par: Grotenhuis, Lide, et autres
Publié: (2026)

On The Role of Intentionality in Knowledge Representation: Analyzing Scene Context for Cognitive Agents with a Tiny Language Model
par: Burgess, Mark
Publié: (2025)

ConfigSpec: Profiling-Based Configuration Selection for Distributed Edge--Cloud Speculative LLM Serving
par: Li, Xiangchen, et autres
Publié: (2026)

Constant time testability of first-order logic with modulo counting on finitary graphs
par: Adler, Isolde, et autres
Publié: (2026)

MathPartner: An Artificial Intelligence Cloud Service
par: Malaschonok, Gennadi, et autres
Publié: (2024)

Agent Semantics, Semantic Spacetime, and Graphical Reasoning
par: Burgess, Mark
Publié: (2025)

Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz
par: Conneryd, Jonas, et autres
Publié: (2025)

On bounded depth proofs for Tseitin formulas on the grid; revisited
par: Håstad, Johan, et autres
Publié: (2022)

Clique Is Hard on Average for Sherali-Adams with Bounded Coefficients
par: de Rezende, Susanna F., et autres
Publié: (2024)

Supercritical Tradeoffs for Monotone Circuits
par: Göös, Mika, et autres
Publié: (2024)

Introducing The Maximum Common Bigraph Problem
par: Burns, Kyle, et autres
Publié: (2026)

Argumentation and Machine Learning
par: Rago, Antonio, et autres
Publié: (2024)

On the Satisfaction Probabilities of $k$-CNF Formulas
par: Tantau, Till
Publié: (2022)

The Fluted Fragment with Transitive Relations
par: Pratt-Hartmann, Ian, et autres
Publié: (2020)

i-QLS: Quantum-supported Algorithm for Least Squares Optimization in Non-Linear Regression
par: Venkatesh, Supreeth Mysore, et autres
Publié: (2025)

Toward Quantum Utility in Finance: A Robust Data-Driven Algorithm for Asset Clustering
par: Sharma, Shivam, et autres
Publié: (2025)

Formally Verifying the Safety of Pipelined Moonshot Consensus Protocol
par: Praveen, M., et autres
Publié: (2024)

IntSat: Integer Linear Programming by Conflict-Driven Constraint-Learning
par: Nieuwenhuis, Robert, et autres
Publié: (2024)

On the Realizability of Prime Conjectures in Heyting Arithmetic
par: Rosko, Milan
Publié: (2025)

Inverse-Free Wilson Loops for Transformers: A Practical Diagnostic for Invariance and Order Sensitivity
par: Chang, Edward Y., et autres
Publié: (2025)

The Equivalence Theorem: First-Class Relationships for Structurally Complete Database Systems
par: Alford, Matthew
Publié: (2026)

Learning-Infused Formal Reasoning: From Contract Synthesis to Artifact Reuse and Formal Semantics
par: Beg, Arshad, et autres
Publié: (2026)

Working Document -- Formalising Software Requirements with Large Language Models
par: Beg, Arshad, et autres
Publié: (2025)

Evaluating LLM-Generated ACSL Annotations for Formal Verification
par: Beg, Arshad, et autres
Publié: (2026)

Formalising Software Requirements using Large Language Models
par: Beg, Arshad, et autres
Publié: (2025)

Graph Construction and Matching for Imperative Programs using Neural and Structural Methods
par: Beg, Arshad, et autres
Publié: (2026)

WISP: Waste- and Interference-Suppressed Distributed Speculative LLM Serving at the Edge via Dynamic Drafting and SLO-Aware Batching
par: Li, Xiangchen, et autres
Publié: (2026)

Locality, Consistency, and the Tractability Frontier
par: Simas, Tristan
Publié: (2026)

A Complexity Dichotomy for Temporal Valued Constraint Satisfaction Problems
par: Bodirsky, Manuel, et autres
Publié: (2024)

Deducibility in the full Lambek calculus with weakening is HAck-complete
par: Greati, Vitor, et autres
Publié: (2024)

Hypersequent Calculi Have Ackermannian Complexity
par: Balasubramanian, A. R., et autres
Publié: (2026)

A Resolution-Based Interactive Proof System for UNSAT
par: Czerner, Philipp, et autres
Publié: (2024)

CLS-CAD: Synthesizing CAD Assemblies in Fusion 360
par: Chaumet, Constantin, et autres
Publié: (2023)

A knowledge-driven framework for synthesizing designs from modular components
par: Chaumet, Constantin, et autres
Publié: (2023)

Counting Solutions to Conjunctive Queries: Structural and Hybrid Tractability
par: Chen, Hubie, et autres
Publié: (2023)

When do homomorphism counts help in query algorithms?
par: Cate, Balder ten, et autres
Publié: (2023)