Cover Image

The Limitations and Power of NP-Oracle-Based Functional Synthesis Techniques

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Juba, Brendan, Meel, Kuldeep S.
Format:	Preprint
Published:	2025
Subjects:	Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

An Approximate Skolem Function Counter
by: Shaw, Arijit, et al.
Published: (2023)

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

An ASP-Based Framework for MUSes
by: Kabir, Mohimenul, et al.
Published: (2025)

On Lower Bounding Minimal Model Count
by: Kabir, Mohimenul, et al.
Published: (2024)

Approximate SMT Counting Beyond Discrete Domains
by: Shaw, Arijit, et al.
Published: (2025)

Model Counting in the Wild
by: Shaw, Arijit, et al.
Published: (2024)

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

Efficient Volume Computation for SMT Formulas
by: Shaw, Arijit, et al.
Published: (2025)

On Top-Down Pseudo-Boolean Model Counting
by: Yang, Suwei, et al.
Published: (2025)

Assessing the Quality of Binomial Samplers: A Statistical Distance Framework
by: Sarkar, Uddalok, et al.
Published: (2025)

Counting Answer Sets of Disjunctive Answer Set Programs
by: Kabir, Mohimenul, et al.
Published: (2025)

Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks
by: Kabir, Mohimenul, et al.
Published: (2025)

CNFs and DNFs with Exactly $k$ Solutions
by: Chandran, L. Sunil, et al.
Published: (2025)

Towards Practical Zero-Knowledge Proof for PSPACE
by: Karthikeyan, Ashwin, et al.
Published: (2025)

Towards Practical First-Order Model Counting
by: Kidambi, Ananth K., et al.
Published: (2025)

A faster FPRAS for #NFA
by: Meel, Kuldeep S., et al.
Published: (2023)

Counting and Sampling Traces in Regular Languages
by: de Colnet, Alexis, et al.
Published: (2025)

Formally Certified Approximate Model Counting
by: Tan, Yong Kiam, et al.
Published: (2024)

Oracle modalities
by: Swan, Andrew W
Published: (2024)

Efficient Certified Reasoning for Binarized Neural Networks
by: Yang, Jiong, et al.
Published: (2025)

Filling in the semantics for intuitionistic conditional logic
by: Dufty, Brendan, et al.
Published: (2025)

Integer Linear-Exponential Programming in NP by Quantifier Elimination
by: Chistikov, Dmitry, et al.
Published: (2024)

Limits with Signed Digit Streams
by: Wiesnet, Franziskus
Published: (2018)

SAT-Based Techniques for Lexicographically Smallest Finite Models
by: Janota, Mikoláš, et al.
Published: (2025)

LLM-Powered Automatic Theorem Proving and Synthesis for Hybrid Systems and Game
by: Kabra, Aditi, et al.
Published: (2026)

Consistent Update Synthesis via Privatized Beliefs
by: Schlögl, Thomas, et al.
Published: (2024)

When Symmetry Yields NP-Hardness: Affine ML-SAT on S5 Frames
by: Krebs, Andreas, et al.
Published: (2025)

Beyond Ability: The Four-Fold Spectrum of Power and the Logic of Full Inability
by: Wang, Shanxia
Published: (2026)

Limits of structures and Total NP Search Problems
by: Ježil, Ondřej
Published: (2023)

Proof-Theoretic Functional Completeness for the Connexive Logic C
by: Ayhan, Sara, et al.
Published: (2025)

Potential for Polynomial Solution for NP-Complete Problems using Quantum Computation
by: Badihian, Neema Rustin
Published: (2025)

Structural Origin and the Minimal Syntax of NP-Hardness: Analysis of SAT from Syntactic Generativity and Compositional Collapse
by: Nishiyama, Yumiko
Published: (2025)

Explainability-Driven Quality Assessment for Rule-Based Systems
by: Seneviratne, Oshani, et al.
Published: (2025)

Synthesiz3 This: an SMT-Based Approach for Synthesis with Uncomputable Symbols
by: Hozzová, Petra, et al.
Published: (2025)

Functional variant of Polynomial Analogue of Gandy's Fixed Point Theorem
by: Nechesov, Andrey
Published: (2024)

Base-extension Semantics for Modal Logic
by: Eckhardt, Timo, et al.
Published: (2024)

'Put the Car on the Stand': SMT-based Oracles for Investigating Decisions
by: Judson, Samuel, et al.
Published: (2023)

Base-extension Semantics for Intuitionistic Modal Logics
by: Buzoku, Yll, et al.
Published: (2025)

Satisfiability for Knowing How over Linear Plans is NP-complete
by: Areces, Carlos, et al.
Published: (2026)

Efficient Ranking Function-Based Termination Analysis with Bi-Directional Feedback
by: Sarita, Yasmin, et al.
Published: (2024)