1 citations · 1 across the 3 of their papers we have counts for
6 papers · 1 filter
Counting Answer Sets of Disjunctive Answer Set Programs
Mohimenul Kabir, Supratik Chakraborty, Kuldeep S Meel
Answer Set Programming (ASP) provides a powerful declarative paradigm for knowledge representation and reasoning. Recently, counting answer sets has emerged as an important computa…
A Simple and Effective ASP-Based Tool for Enumerating Minimal Hitting Sets
Mohimenul Kabir, Kuldeep S Meel
The hitting set problem is a fundamental problem in computer science and mathematics. Given a family of sets over a universe of elements, a minimal hitting set is a subset-minimal…
Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks
Mohimenul Kabir, Van-Giang Trinh, Samuel Pastva +1
Boolean Networks (BNs) serve as a fundamental modeling framework for capturing complex dynamical systems across various domains, including systems biology, computational logic, and…
Minimal Model Counting via Knowledge Compilation
Mohimenul Kabir
Counting the number of models of a Boolean formula is a fundamental problem in artificial intelligence and reasoning. Minimal models of a Boolean formula are critical in various re…
On Lower Bounding Minimal Model Count
Mohimenul Kabir, Kuldeep S Meel
Minimal models of a Boolean formula play a pivotal role in various reasoning tasks. While previous research has primarily focused on qualitative analysis over minimal models; our s…
Exact ASP Counting with Compact Encodings
Mohimenul Kabir, Supratik Chakraborty, Kuldeep S Meel
Answer Set Programming (ASP) has emerged as a promising paradigm in knowledge representation and automated reasoning owing to its ability to model hard combinatorial problems from…