Skip to content
<title>Channels - Cross-Attention and Encoder-Decoder Transformers: A Logical Characterization :: FRELIP Discovery
Home
Search
Guides
Journals
Learning
FRELIP Discovery Search
Open Access Catalog for African Scholarship
Channels
Cross-Attention and Encoder-Decoder Transformers: A Logical Characterization
Search for more channels:
Similar Items: Cross-Attention and Encoder-Decoder Transformers: A Logical Characterization
Channel Options
View Record
Explore related channels
Quick Look
Computing Short SAT Implicants via Ising/QUBO Encodings
Quick Look
A Logic of Inability
Quick Look
ANDRE: An Attention-based Neuro-symbolic Differentiable Rule Extractor
Quick Look
Logics for Context-free Hyperproperties
Quick Look
Neural networks as fuzzy logic formulas
Quick Look
Goedel Logics: On the Elimination of The Absoluteness Operator
Quick Look
Set-like operations on propositional logic programs
Quick Look
A Fibrational Perspective on Differential Linear Logic
Quick Look
Lattice Deduction Transformers
Quick Look
Dsat: A Native SAT Solver for Discrete Logic
Quick Look
Separation Logic for Verifying Physical Collisions of CNC Programs
Quick Look
Quantum Bayesian Networks: Compositionality and Typing via Linear Logic
Quick Look
Value Functions for Temporal Logic: Optimal Policies and Safety Filters
Quick Look
Automaton-based Characterisations of First Order Logic over Infinite Trees
Quick Look
Beyond Ability: The Four-Fold Spectrum of Power and the Logic of Full Inability
Quick Look
Set Automata and Limits of Decidability of Two-Variable Logic on Data Words
Quick Look
The Scaling Properties of Implicit Deductive Reasoning in Transformers
Quick Look
Order-invariant cluster first-order logic on graph classes of bounded degree
Quick Look
On Higher-Order Probabilistic Verification via the Weighted Relational Model of Linear Logic
Quick Look
Tree transducers of linear size-to-height increase (and the additive conjunction of linear logic)
Quick Look
Constant time testability of first-order logic with modulo counting on finitary graphs
Quick Look
Decidability Results for Fragments of First-Order Logic via a Symbolic Model Property
Quick Look
A Fast Model Counting Algorithm for Two-Variable Logic with Counting and Modulo Counting Quantifiers
Quick Look
Paraconsistent Semantics for Extended Fuzzy Logic Programs via Approximation Fixpoint Theory [Extended Version]
Load more items
View Record
Prev
Explore related channels
Next
