Cover Image

On Enumerating Short Projected Models

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Möhle, Sibylle, Sebastiani, Roberto, Biere, Armin
Format:	Preprint
Published:	2021
Subjects:	Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Disjoint Projected Enumeration for SAT and SMT without Blocking Clauses
by: Spallitta, Giuseppe, et al.
Published: (2024)

Disjoint Partial Enumeration without Blocking Clauses
by: Spallitta, Giuseppe, et al.
Published: (2023)

Entailment vs. Verification for Partial-assignment Satisfiability and Enumeration
by: Sebastiani, Roberto
Published: (2025)

Exploiting Partial-Assignment Enumeration in Optimization Modulo Theories
by: Masina, Gabriele, et al.
Published: (2025)

Beyond Eager Encodings: A Theory-Agnostic Approach to Theory-Lemma Enumeration in SMT
by: Civini, Emanuele, et al.
Published: (2026)

On CNF Conversion for SAT and SMT Enumeration
by: Masina, Gabriele, et al.
Published: (2023)

SAT Solving for Variants of First-Order Subsumption
by: Coutelier, Robin, et al.
Published: (2024)

Extending CDCL-based Model Enumeration with Weights
by: Spallitta, Giuseppe, et al.
Published: (2026)

Enumerating Independent Linear Inferences
by: Das, Anupam, et al.
Published: (2021)

From MBQI to Enumerative Instantiation and Back
by: Dančo, Marek, et al.
Published: (2025)

Canonical Decision Diagrams Modulo Theories
by: Michelutti, Massimo, et al.
Published: (2024)

FO-Query Enumeration over SLP-Compressed Structures of Bounded Degree
by: Lohrey, Markus, et al.
Published: (2025)

A Simple and Effective ASP-Based Tool for Enumerating Minimal Hitting Sets
by: Kabir, Mohimenul, et al.
Published: (2025)

Model Enumeration of Two-Variable Logic with Quadratic Delay Complexity
by: Meng, Qiaolan, et al.
Published: (2025)

Enumerating Minimal Unsatisfiable Cores of LTLf formulas
by: Ielo, Antonio, et al.
Published: (2024)

Verification of E-Voting Algorithms in Dafny
by: Büttner, Robert, et al.
Published: (2025)

Using Color Refinement to Boost Enumeration and Counting for Acyclic CQs of Binary Schemas
by: Riveros, Cristian, et al.
Published: (2024)

Incremental SAT-Based Enumeration of Solutions to the Yang-Baxter Equation
by: Van Caudenberg, Daimy, et al.
Published: (2025)

Short proofs without interference
by: Rebola-Pardo, Adrian
Published: (2025)

Lean on Vampire Proofs (Short Paper)
by: Bodingbauer, Jonas, et al.
Published: (2026)

Computing Short SAT Implicants via Ising/QUBO Encodings
by: Spallitta, Giuseppe, et al.
Published: (2026)

Hypergraph Neural Networks Accelerate MUS Enumeration
by: Ijima, Hiroya, et al.
Published: (2026)

CTL* Model Checking on Infinite Families of Finite-State Labeled Transition Systems (Technical Report)
by: Pettinau, Roberto, et al.
Published: (2026)

Experimental Results for Vampire on the Equational Theories Project
by: Janota, Mikoláš
Published: (2025)

Terminating Hybrid Tableaus for Ordered Models
by: Nishimura, Yuki
Published: (2025)

Prime Factorization in Models of PV$_1$
by: Ježil, Ondřej
Published: (2025)

A Logic of Secrecy on Simplicial Models
by: Wang, Shanxia
Published: (2026)

Modelling of logical systems by means of their fragments
by: Rybakov, Mikhail
Published: (2025)

The Pebble-Relation Comonad in Finite Model Theory
by: Montacute, Yoàv, et al.
Published: (2021)

Ranked Enumeration for MSO on Trees via Knowledge Compilation
by: Amarilli, Antoine, et al.
Published: (2023)

An Enumerative Embedding of the Python Type System in ACL2s
by: Xifaras, Samuel, et al.
Published: (2025)

Embedded Finite Models Beyond Restricted Quantifier Collapse
by: Benedikt, Michael, et al.
Published: (2023)

MSO Queries on Trees: Enumerating Answers under Updates Using Forest Algebras
by: Kleest-Meißner, Sarah, et al.
Published: (2022)

Complexity of the Model Checking problem for inquisitive propositional and modal logic
by: Grilletti, Gianluca, et al.
Published: (2024)

Model Checking as Program Verification by Abstract Interpretation (Extended Version)
by: Baldan, Paolo, et al.
Published: (2025)

Project and Conquer: Fast Quantifier Elimination for Checking Petri Net Reachability
by: Amat, Nicolas, et al.
Published: (2024)

Towards Projected and Incremental Pseudo-Boolean Model Counting
by: Yang, Suwei, et al.
Published: (2024)

Finding Bugs in Short Proofs: The Metamathematics of Resolution Lower Bounds
by: Li, Jiawei, et al.
Published: (2024)

Sequent Calculi for Data-Aware Modal Logics
by: Areces, Carlos, et al.
Published: (2025)

Enumeration and updates for conjunctive linear algebra queries through expressibility
by: Muñoz, Thomas, et al.
Published: (2023)