6 papers
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…
An ASP-Based Framework for MUSes
Mohimenul Kabir, Kuldeep S Meel
Given an unsatisfiable formula, understanding the core reason for unsatisfiability is crucial in several applications. One effective way to capture this is through the minimal unsa…
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…
Answer Set Counting and its Applications
Mohimenul Kabir
We have focused on Answer Set Programming (ASP), more specifically, answer set counting, exploring both exact and approximate methodologies. We developed an exact ASP counter, shar…
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…