Skip to content
Channels - URSA: A System for Uniform Reduction to SAT :: FRELIP Discovery
Home
Search
Guides
Journals
Learning
FRELIP Discovery Search
Open Access Catalog for African Scholarship
Channels
URSA: A System for Uniform Reduction to SAT
Search for more channels:
Similar Items: URSA: A System for Uniform Reduction to SAT
Channel Options
View Record
Explore related channels
Quick Look
Formalization of Abstract State Transition Systems for SAT
Quick Look
Uniform Envelopes
Quick Look
SAT-Inspired Higher-Order Eliminations
Quick Look
Local Redundancy in SAT: Generalizations of Blocked Clauses
Quick Look
A Separator Theorem for Hypergraphs and a CSP-SAT Algorithm
Quick Look
A Flexible Proof Format for SAT Solver-Elaborator Communication
Quick Look
Localic completion of uniform spaces
Quick Look
Towards Uniform Certification in QBF
Quick Look
Indivisibility and uniform computational strength
Quick Look
Revisiting SAT-based Solvers: MaxSAT Rules and Core Sequences
Quick Look
Translation of Algorithmic Descriptions of Discrete Functions to SAT with Applications to Cryptanalysis Problems
Quick Look
Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies
Quick Look
Borel-piecewise continuous reducibility for uniformization problems
Quick Look
Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning
Quick Look
Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment?
Quick Look
Uniform Interpolants in EUF: Algorithms using DAG-representations
Quick Look
Uniform Reliability of Self-Join-Free Conjunctive Queries
Quick Look
Products of effective topological spaces and a uniformly computable Tychonoff Theorem
Quick Look
Electric Field Characteristics in Bubble Under Non-Uniform Field
Quick Look
SatRbedo: An R package for retrieving snow and ice albedo from optical satellite imagery
Quick Look
Infinitary Combinatory Reduction Systems: Confluence
Quick Look
MaxSAT Fuzzing and Delta Debugging
Quick Look
A type reduction theory for systems with replicated components
Quick Look
Alternating Quantifiers in Uniform One-Dimensional Fragments with an Excursion into Three-Variable Logic
Load more items
View Record
Prev
Explore related channels
Next