Image de couverture de livre

Extending CDCL-based Model Enumeration with Weights

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Spallitta, Giuseppe, Vardi, Moshe Y.
Format:	Preprint
Publié:	2026
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

Computing Short SAT Implicants via Ising/QUBO Encodings
par: Spallitta, Giuseppe, et autres
Publié: (2026)

Understanding CDCL Solvers via Scalability Studies and Proofdoors
par: Zhang, Shimin, et autres
Publié: (2026)

Disjoint Partial Enumeration without Blocking Clauses
par: Spallitta, Giuseppe, et autres
Publié: (2023)

Disjoint Projected Enumeration for SAT and SMT without Blocking Clauses
par: Spallitta, Giuseppe, et autres
Publié: (2024)

Beyond Eager Encodings: A Theory-Agnostic Approach to Theory-Lemma Enumeration in SMT
par: Civini, Emanuele, et autres
Publié: (2026)

On CNF Conversion for SAT and SMT Enumeration
par: Masina, Gabriele, et autres
Publié: (2023)

Extending CDCL to disjunctions of parity equations
par: Beame, Paul, et autres
Publié: (2026)

Automata Linear Dynamic Logic on Finite Traces
par: Smith, Kevin W., et autres
Publié: (2021)

Verifying Equilibria in Finite-Horizon Probabilistic Concurrent Game Systems
par: Rajasekaran, Senthil, et autres
Publié: (2025)

LTLf Synthesis Under Unreliable Input
par: Hagemeier, Christian, et autres
Publié: (2024)

LTLf+ and PPLTL+: Extending LTLf and PPLTL to Infinite Traces
par: Aminof, Benjamin, et autres
Publié: (2024)

Proofdoors and Efficiency of CDCL Solvers
par: Singh, Sunidhi, et autres
Publié: (2026)

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

Revisiting Restarts of CDCL: Should the Search Information be Preserved?
par: Zhang, Xindi, et autres
Publié: (2024)

Canonical Decision Diagrams Modulo Theories
par: Michelutti, Massimo, et autres
Publié: (2024)

Multi-Property Synthesis
par: Weinhuber, Christoph, et autres
Publié: (2026)

Dynamic Programming for Symbolic Boolean Realizability and Synthesis
par: Lin, Yi, et autres
Publié: (2024)

Dynamic Boolean Synthesis with Zero-suppressed Decision Diagrams
par: Lin, Yi, et autres
Publié: (2025)

Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution
par: Beyersdorff, Olaf, et autres
Publié: (2021)

On-the-fly LTLf Synthesis under Partial Observability
par: Alon, Nadav, et autres
Publié: (2026)

Fast Obligation Translation and Synthesis
par: Duret-Lutz, Alexandre, et autres
Publié: (2026)

A Reinforcement Learning based Reset Policy for CDCL SAT Solvers
par: Li, Chunxiao, et autres
Publié: (2024)

On Enumerating Short Projected Models
par: Möhle, Sibylle, et autres
Publié: (2021)

Probabilistic-bit Guided CDCL for SAT Solving using Ising Consensus Assumptions
par: Bino, Melki
Publié: (2026)

On-the-fly Synthesis for LTL over Finite Traces: An Efficient Approach that Counts
par: Xiao, Shengping, et autres
Publié: (2024)

Enumerating Minimal Unsatisfiable Cores of LTLf formulas
par: Ielo, Antonio, et autres
Publié: (2024)

Enumerating Independent Linear Inferences
par: Das, Anupam, et autres
Publié: (2021)

Thinking Out of the Box: Hybrid SAT Solving by Unconstrained Continuous Optimization
par: Zhang, Zhiwei, et autres
Publié: (2025)

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

Extending Action Logic with Omega Iteration
par: Pshenitsyn, Tikhon
Publié: (2025)

Extended multi-adjoint logic programming
par: Cornejo, M. Eugenia, et autres
Publié: (2024)

Refutation calculi for lattice-based logics: from display to tableaux
par: De Domenico, Andrea, et autres
Publié: (2026)

FO-Query Enumeration over SLP-Compressed Structures of Bounded Degree
par: Lohrey, Markus, et autres
Publié: (2025)

A Linear Temporal Logic of Frequencies on Series of Events
par: Antonelli, Melissa, et autres
Publié: (2026)

Justification Logic for Intuitionistic Modal Logic (Extended Technical Report)
par: Marin, Sonia, et autres
Publié: (2025)

A Simple and Effective ASP-Based Tool for Enumerating Minimal Hitting Sets
par: Kabir, Mohimenul, et autres
Publié: (2025)

Proof-theoretic Semantics for Intuitionistic Multiplicative Linear Logic (Extended Abstract)
par: Gheorghiu, Alexander V., et autres
Publié: (2023)

Model Enumeration of Two-Variable Logic with Quadratic Delay Complexity
par: Meng, Qiaolan, et autres
Publié: (2025)

Field Knowledge as a Dual to Distributed Knowledge: A Characterization by Weighted Modal Logic
par: Liang, Xiaolong, et autres
Publié: (2024)

Partially Finite Model Reasoning in Description Logics Extended Version
par: Gogacz, Tomasz, et autres
Publié: (2026)