Image de couverture de livre

On CNF Conversion for SAT and SMT Enumeration

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Masina, Gabriele, Spallitta, Giuseppe, Sebastiani, Roberto
Format:	Preprint
Publié:	2023
Sujets:	Logic in Computer Science 68R07 F.4.1
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

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

Simulating and model checking membrane systems using strategies in Maude
par: Rubio, Rubén, et autres
Publié: (2024)

Coinductive proof search for polarized logic with applications to full intuitionistic propositional logic
par: Santo, José Espírito, et autres
Publié: (2020)

Redundancy rules for MaxSAT
par: Bonacina, Ilario, et autres
Publié: (2025)

The Orientation Boundary for Step-Duplicating Recursors: Mechanized Impossibility, Escape, and Certification
par: Rahnama, Moses
Publié: (2025)

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

Graded Monad Coalgebras for Continuous-Time Transition Systems
par: Di Lavore, Elena, et autres
Publié: (2026)

Arithmetics within the Linear Time Hierarchy
par: Pollett, Chris
Publié: (2025)

Two-Level Type Theory and Applications
par: Annenkov, Danil, et autres
Publié: (2017)

Strategies, model checking and branching-time properties in Maude
par: Rubio, Rubén, et autres
Publié: (2024)

Model checking strategy-controlled systems in rewriting logic
par: Rubio, Rubén, et autres
Publié: (2024)

Metalevel transformation of strategies
par: Rubio, Rubén, et autres
Publié: (2024)

On the existence of strong proof complexity generators
par: Krajicek, Jan
Publié: (2022)

The equational theory of the Weihrauch lattice with (iterated) composition
par: Pradic, Cécilia
Publié: (2024)

Extensions of K5: Proof Theory and Uniform Lyndon Interpolation
par: van der Giessen, Iris, et autres
Publié: (2023)

Cardinality and Representation of Stone Relation Algebras
par: Furusawa, Hitoshi, et autres
Publié: (2023)

Satisfiability in Łukasiewicz logic and its unbounded relative
par: Haniková, Zuzana, et autres
Publié: (2025)

Semi-Substructural Logics à la Lambek
par: Wan, Cheng-Syuan
Publié: (2024)

A Non-Wellfounded and Labelled Sequent Calculus for Bimodal Provability Logic
par: Becker, Justus
Publié: (2025)

A Topological Rewriting of Tarski's Mereogeometry
par: Barlatier, Patrick, et autres
Publié: (2025)

Logic of Sets with Atoms
par: Masters, Jake
Publié: (2025)

Tractable and Intractable Entailment Problems in Separation Logic with Inductively Defined Predicates
par: Echenim, Mnacho, et autres
Publié: (2023)

Classification of Covering Spaces and Canonical Change of Basepoint
par: Wemmenhove, Jelle, et autres
Publié: (2024)

Structural focalization
par: Simmons, Robert J.
Publié: (2011)

A Qualitative Analysis of Kernel Extension for Higher Order Proof Checking
par: Wang, Shuai
Publié: (2024)

A proof complexity conjecture and the Incompleteness theorem
par: Krajicek, Jan
Publié: (2023)

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

Efficient Normalization of Linear Temporal Logic
par: Esparza, Javier, et autres
Publié: (2023)

A topological counterpart of well-founded trees in dependent type theory
par: Maietti, Maria Emilia, et autres
Publié: (2023)

A parametricity-based formalization of semi-simplicial and semi-cubical sets
par: Herbelin, Hugo, et autres
Publié: (2023)

CoLF Logic Programming as Infinitary Proof Exploration
par: Chen, Zhibo, et autres
Publié: (2025)

Dependently Sorted Nominal Signatures
par: Fernández, Maribel, et autres
Publié: (2025)

Satisfiability for Knowing How over Linear Plans is NP-complete
par: Areces, Carlos, et autres
Publié: (2026)

A Construction of the Lie Algebra of a Lie Group in Isabelle/HOL
par: Schmoetten, Richard, et autres
Publié: (2024)

The mu-calculus' Alternation Hierarchy is Strict over Non-Trivial Fusion Logics
par: Pacheco, Leonardo
Publié: (2025)

Apply2Isar: Automatically Converting Isabelle/HOL Apply-Style Proofs to Structured Isar
par: Binder, Sage, et autres
Publié: (2026)

Sensible Intersection Type Theories
par: Dezani-Ciancaglini, Mariangiola, et autres
Publié: (2026)

Who Wins the Multi-Structural Game?
par: Fagin, Ronald, et autres
Publié: (2025)

A Curiously Effective Backtracking Strategy for Connection Tableaux
par: Färber, Michael
Publié: (2021)