Image de couverture de livre

SAT-Based Techniques for Lexicographically Smallest Finite Models

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Janota, Mikoláš, Chow, Choiwah, Araújo, João, Codish, Michael, Vojtěchovský, Petr
Format:	Preprint
Publié:	2025
Sujets:	Logic in Computer Science
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Cube-based Isomorph-free Finite Model Finding
par: Chow, Choiwah, et autres
Publié: (2025)

Complete Symmetry Breaking for Finite Models
par: Dančo, Marek, et autres
Publié: (2025)

Breaking Symmetries with Involutions
par: Codish, Michael, et autres
Publié: (2025)

Breaking Symmetries from a Set-Covering Perspective
par: Codish, Michael, et autres
Publié: (2025)

Experimental Results for Vampire on the Equational Theories Project
par: Janota, Mikoláš
Publié: (2025)

Case Study: Saturations as Explicit Models in Equational Theories
par: Janota, Mikoláš, et autres
Publié: (2026)

LLM2SMT: Building an SMT Solver with Zero Human-Written Code
par: Janota, Mikoláš, et autres
Publié: (2026)

Towards Learning Infinite SMT Models (Work in Progress)
par: Janota, Mikoláš, et autres
Publié: (2025)

Quantifier Instantiations: To Mimic or To Revolt?
par: Jakubův, Jan, et autres
Publié: (2025)

From MBQI to Enumerative Instantiation and Back
par: Dančo, Marek, et autres
Publié: (2025)

First Experiments with Neural cvc5
par: Piepenbrock, Jelle, et autres
Publié: (2025)

CFaults: Model-Based Diagnosis for Fault Localization in C Programs with Multiple Test Cases
par: Orvalho, Pedro, et autres
Publié: (2024)

Symbolic Computation for All the Fun
par: Brown, Chad E., et autres
Publié: (2024)

Breaking Symmetries in Quantified Graph Search: A Comparative Study
par: Janota, Mikoláš, et autres
Publié: (2025)

Inductive Satisfiability Certification for Universal Quantifiers and Uninterpreted Function Symbols
par: Ratschan, Stefan, et autres
Publié: (2026)

Reintroducing the Second Player in EPR
par: Chew, Leroy, et autres
Publié: (2026)

Model-Based Diagnosis with Multiple Observations: A Unified Approach for C Software and Boolean Circuits
par: Orvalho, Pedro, et autres
Publié: (2025)

Solving Hard Mizar Problems with Instantiation and Strategy Invention
par: Jakubův, Jan, et autres
Publié: (2024)

SMT and Functional Equation Solving over the Reals: Challenges from the IMO
par: Brown, Chad E., et autres
Publié: (2025)

Machine Learning for Quantifier Selection in cvc5
par: Jakubův, Jan, et autres
Publié: (2024)

SAT-Based Subsumption Resolution
par: Coutelier, Robin, et autres
Publié: (2024)

SAT + NAUTY: Orderly Generation of Small Kochen-Specker Sets Containing the Smallest State-independent Contextuality Set
par: Li, Zhengyu, et autres
Publié: (2026)

RustSAT: A Library For SAT Solving in Rust
par: Jabs, Christoph
Publié: (2025)

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

Embedded Finite Models Beyond Restricted Quantifier Collapse
par: Benedikt, Michael, et autres
Publié: (2023)

SAT Solving for Variants of First-Order Subsumption
par: Coutelier, Robin, et autres
Publié: (2024)

Logic Optimization Meets SAT: A Novel Framework for Circuit-SAT Solving
par: Shi, Zhengyuan, et autres
Publié: (2024)

Life span of SAT techniques
par: Fleury, Mathias, et autres
Publié: (2024)

GaloisSAT: Differentiable Boolean Satisfiability Solving via Finite Field Algebra
par: Kim, Curie, et autres
Publié: (2026)

SAT-Inspired Higher-Order Eliminations
par: Blanchette, Jasmin, et autres
Publié: (2022)

Between proof construction and SAT-solving
par: Schubert, Aleksy, et autres
Publié: (2024)

The Pebble-Relation Comonad in Finite Model Theory
par: Montacute, Yoàv, et autres
Publié: (2021)

Compact SAT Encoding for Power Peak Minimization
par: Van Kieu, Tuyen, et autres
Publié: (2025)

Rethinking Clause Management for CDCL SAT Solvers
par: Cai, Yalun, et autres
Publié: (2026)

Empirical Impact of Dimensionality on Random Geometric SAT
par: Rädiker, Flora
Publié: (2026)

SAT-based Learning of Computation Tree Logic
par: Pommellet, Adrien, et autres
Publié: (2024)

parSAT: Parallel Solving of Floating-Point Satisfiability
par: Krahl, Markus, et autres
Publié: (2025)

Structure-Aware Computing, Partial Quantifier Elimination And SAT
par: Goldberg, Eugene
Publié: (2024)

DRAT Proofs of Unsatisfiability for SAT Modulo Monotonic Theories
par: Feng, Nick, et autres
Publié: (2024)

Approaching the Conway-99 problem using SAT solvers
par: Keramatipour, Ali
Publié: (2026)