Imagen de Portada

Artifact of ApproxASP– A Scalable Approximate Answer Set Counter

Fuente: Zenodo

Guardado en:

Detalles Bibliográficos
Autores principales:	Mohimenul, Kabir, Flavio, Everardo, Ankit, Shukla, Johannes K., Fichte, Markus, Hecher, Kuldeep S., Meel
Formato:	Recurso digital
Lenguaje:	inglés
Publicado:	Zenodo 2026
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

SharpASP Artifact
por: Mohimenul, Kabir, et al.
Publicado: (2026)

SharpASP Artifact
por: Mohimenul, Kabir, et al.
Publicado: (2025)

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

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

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

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

Answer Set Counting and its Applications
por: Kabir, Mohimenul
Publicado: (2025)

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

The Model Counting Competitions 2021-2023
por: Fichte, Johannes K., et al.
Publicado: (2025)

An Approximate Skolem Function Counter
por: Shaw, Arijit, et al.
Publicado: (2023)

The Model Counting Competition 2020
por: Fichte, Johannes K., et al.
Publicado: (2020)

Engineering an Exact Pseudo-Boolean Model Counter
por: Yang, Suwei, et al.
Publicado: (2023)

Diversity of Extensions in Abstract Argumentation
por: Fichte, Johannes K., et al.
Publicado: (2026)

Epistemic Logic Programs: Non-Ground and Counting Complexity
por: Eiter, Thomas, et al.
Publicado: (2025)

Rejection in Abstract Argumentation: Harder Than Acceptance?
por: Fichte, Johannes K., et al.
Publicado: (2024)

Structure-Aware Encodings of Argumentation Properties for Clique-width
por: Mahmood, Yasir, et al.
Publicado: (2025)

Minimal Model Counting via Knowledge Compilation
por: Kabir, Mohimenul
Publicado: (2024)

Engineering an Efficient Approximate DNF-Counter
por: Soos, Mate, et al.
Publicado: (2024)

Extended Version of: On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions?
por: Hecher, Markus, et al.
Publicado: (2024)

Finite Groundings for ASP with Functions: A Journey through Consistency
por: Gerlach, Lukas, et al.
Publicado: (2024)

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

Counting and Reasoning with Plans
por: Speck, David, et al.
Publicado: (2025)

ASP-FZN: A Translation-based Constraint Answer Set Solver
por: Eiter, Thomas, et al.
Publicado: (2025)

Facets in Argumentation: A Formal Approach to Argument Significance
por: Fichte, Johannes, et al.
Publicado: (2025)

ApproxJoin: Approximate Matching for Efficient Verification in Fuzzy Set Similarity Join
por: Mandulak, Michael, et al.
Publicado: (2025)

From Alternation to FPRAS: Toward a Complexity Classification of Approximate Counting
por: Hecher, Markus, et al.
Publicado: (2025)

Formally Solving Answer-Construction Problems in Lean
por: Sun, Jialiang, et al.
Publicado: (2025)

Model Counting in the Wild
por: Shaw, Arijit, et al.
Publicado: (2024)

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

The Limitations and Power of NP-Oracle-Based Functional Synthesis Techniques
por: Juba, Brendan, et al.
Publicado: (2025)

Approximating Queries on Probabilistic Graphs
por: Amarilli, Antoine, et al.
Publicado: (2023)

ApproxPilot: A GNN-based Accelerator Approximation Framework
por: Zhang, Qing, et al.
Publicado: (2024)

Towards practical FPRAS for #NFA: Exploiting the Power of Dependence
por: Meel, Kuldeep S., et al.
Publicado: (2025)

#CFG and #DNNF admit FPRAS
por: Meel, Kuldeep S., et al.
Publicado: (2024)

An FPRAS for Model Counting for Non-Deterministic Read-Once Branching Programs
por: Meel, Kuldeep S., et al.
Publicado: (2024)

Cplus2ASP: Computing Action Language C+ in Answer Set Programming
por: Babb, Joseph, et al.
Publicado: (2026)

ApproxDARTS: Differentiable Neural Architecture Search with Approximate Multipliers
por: Pinos, Michal, et al.
Publicado: (2024)

QuApprox: A Framework for Benchmarking the Approximability of Variational Quantum Circuit
por: Li, Jinyang, et al.
Publicado: (2024)

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

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