Discovery of Minimal Unsatisfiable Subsets of Constraints Using Hitting Set Dualization

No abstract is available for this paper.

• Publication year

  2005

• Venue

  International Symposium on Practical Aspects of Declarative Languages

• Publication date

  2005-01-10

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/978-3-540-30557-6_14
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Advances in frequent itemset mining implementations: report on FIMI'03

  2004cited by this paper
• Discovering all most specific sentences

  2003influential reference
• Advances in Frequent Itemset Mining Implementations: Introduction to FIMI03

  2003cited by this paper
• Type error slicing in implicitly typed higher-order languages

  2003cited by this paper
• Finding all minimal unsatisfiable subsets

  2003cited by this paper
• Detailed Description of an Algorithm for Enumeration of Maximal Frequent Sets with Irredundant Dualization

  2003influential reference
• A fast algorithm for computing hypergraph transversals and its application in mining emerging patterns

  2003cited by this paper
• Proceedings of the ICDM 2003 Workshop on Frequent Itemset Mining Implementations (FIMI'03)

  2003cited by this paper
• Efficient Intelligent Backtracking Using Linear Programming

  2002cited by this paper
• Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph

  2001cited by this paper
• Deriving minimal conflict sets by CS-trees with mark set in diagnosis from first principles

  1999cited by this paper
• GRASP-A new search algorithm for satisfiability

  1996cited by this paper
• On the Complexity of Dualization of Monotone Disjunctive Normal Forms

  1996cited by this paper
• Identifying the Minimal Transversals of a Hypergraph and Related Problems

  1995cited by this paper
• A Theory of Measurement in Diagnosis from First Principles

  1994cited by this paper
• A Theory of Diagnosis from First Principles

  1986influential reference
• Linear unification

  1976cited by this paper

• A Simple and Effective ASP-Based Tool for Enumerating Minimal Hitting Sets

  2025cites this paper
• G-CSEA: A Graph-Based Conflict Set Extraction Algorithm for Identifying Infeasibility in Pseudo-Boolean Models

  2025cites this paper
• Learning to resolve inconsistencies in qualitative constraint networks

  2025cites this paper
• An ASP-Based Framework for MUSes

  2025cites this paper
• Most General Explanations of Tree Ensembles (Extended Version)

  2025cites this paper
• Abductive Explanations of Classifiers Under Constraints: Complexity and Properties

  2024cites this paper
• A Reinforcement Learning Approach for Resolving Inconsistencies in Qualitative Constraint Networks

  2024cites this paper
• Formal Explanations for Neuro-Symbolic AI

  2024cites this paper
• Active Disjunctive Constraint Acquisition

  2023influential citation
• Anytime Approximate Formal Feature Attribution

  2023cites this paper
• Hashing-based approximate counting of minimal unsatisfiable subsets

  2023cites this paper
• Memory-Limited Model-Based Diagnosis (Extended Abstract)

  2023cites this paper
• Efficient Reasoning about Infeasible One Machine Sequencing

  2023cites this paper
• OuterCount: A First-Level Solution-Counter for Quantified Boolean Formulas

  2022cites this paper
• Logic-Based Explainability in Machine Learning

  2022cites this paper
• Eliminating The Impossible, Whatever Remains Must Be True

  2022cites this paper
• Lightweight axiom pinpointing via replicated driver and customized SAT-solving

  2022cites this paper
• On Decomposition of Maximal Satisfiable Subsets

  2021cites this paper
• Secure data outsourcing in presence of the inference problem: A graph-based approach

  2021cites this paper
• How to Approximate Leximax-optimal Solutions

  2021cites this paper
• A Progressive Search Algorithm for the Minimum Hitting Set Problem

  2021cites this paper
• Timed Automata Robustness Analysis via Model Checking

  2021cites this paper
• Explanation in Constraint Satisfaction: A Survey

  2021influential citation
• Counting Minimal Unsatisfiable Subsets

  2021cites this paper
• Counting Maximal Satisfiable Subsets

  2021influential citation
• SAT-Based Rigorous Explanations for Decision Lists

  2021cites this paper
• Pattern Recognition on Oriented Matroids: Symmetric Cycles in the Hypercube Graphs. V

  2021cites this paper
• Inductive Validity Cores

  2021cites this paper
• Collaborative duty rostering in health care professions

  2020cites this paper
• Constraint Caching Revisited

  2020cites this paper
• Replication-Guided Enumeration of Minimal Unsatisfiable Subsets

  2020cites this paper
• NASA Formal Methods: 12th International Symposium, NFM 2020, Moffett Field, CA, USA, May 11–15, 2020, Proceedings

  2020cites this paper
• Reasoning About Inconsistent Formulas

  2020cites this paper
• A memetic algorithm for restoring feasibility in scheduling with limited makespan

  2020cites this paper
• Reasoning About Strong Inconsistency in ASP

  2020cites this paper
• Preference-based Conflict Resolution for Collaborative Configuration of Product Lines

  2020cites this paper
• Rotation Based MSS/MCS Enumeration ∗

  2020cites this paper
• MUST: Minimal Unsatisfiable Subsets Enumeration Tool

  2020cites this paper
• From Contrastive to Abductive Explanations and Back Again

  2020cites this paper
• Core-guided method for constraint-based multi-objective combinatorial optimization

  2020cites this paper
• On Relating 'Why?' and 'Why Not?' Explanations

  2020influential citation
• Model-Based Diagnosis with Multiple Observations

  2019influential citation
• Accelerating MUS enumeration by inconsistency graph partitioning

  2019cites this paper
• On Relating Explanations and Adversarial Examples

  2019cites this paper
• Constraint-Based Techniques in Stochastic Local Search MaxSAT Solving

  2019cites this paper
• Chasing Minimal Inductive Validity Cores in Hardware Model Checking

  2019influential citation
• Chair for Automata Theory LTCS – Report Pinpointing in Terminating Forest Tableaux

  2019cites this paper
• Integrating Pseudo-Boolean Constraint Reasoning in Multi-Objective Evolutionary Algorithms

  2019cites this paper
• Understanding Inconsistency - A Contribution to the Field of Non-monotonic Reasoning

  2019cites this paper
• Strong inconsistency

  2019cites this paper
• Formal Verification of Decision-Tree Ensemble Model and Detection of its Violating-input-value Ranges

  2019cites this paper
• Implicit Hitting Set Algorithms for Constraint Optimization

  2019cites this paper
• Optimised constraint solving for real-world problems

  2019influential citation
• Repairing Argumentation Frameworks

  2019cites this paper
• Stratification for Constraint-Based Multi-Objective Combinatorial Optimization

  2018cites this paper
• On the Superiority of Conflict-Driven Search in MUS Enumeration

  2018cites this paper
• A Hybrid Approach to Optimization in Answer Set Programming

  2018cites this paper
• FMUS2: An Efficient Algorithm to Compute Minimal Unsatisfiable Subsets

  2018cites this paper
• Artificial Intelligence and Symbolic Computation

  2018influential citation
• Multi-Objective Optimization Through Pareto Minimal Correction Subsets

  2018cites this paper
• SAT-based Analysis, (Re-)Configuration & Optimization in the Context of Automotive Product documentation

  2018cites this paper
• Finding All Minimal Safe Inductive Sets

  2018cites this paper
• Graph Based Proactive Secure Decomposition Algorithm for Context Dependent Attribute Based Inference Control Problem

  2018cites this paper
• Premise Set Caching for Enumerating Minimal Correction Subsets

  2018influential citation
• Enhancing Constraint-Based Multi-Objective Combinatorial Optimization

  2018cites this paper
• Minimal sets on propositional formulae. Problems and reductions

  2017cites this paper
• Consistency checking in requirements analysis

  2017cites this paper
• Improving MCS Enumeration via Caching

  2017influential citation
• Debugging EL+ Ontologies through Horn MUS Enumeration

  2017cites this paper
• Model Based Diagnosis of Multiple Observations with Implicit Hitting Sets

  2017influential citation
• Resolving Over-Constrained Temporal Problems with Uncertainty through Conflict-Directed Relaxation

  2017cites this paper
• Introducing Pareto Minimal Correction Subsets

  2017cites this paper
• Recursive Online Enumeration of All Minimal Unsatisfiable Subsets

  2017influential citation
• Addressing Challenges in Healthcare Provider Scheduling

  2017cites this paper
• Debugging Unsatisfiable Constraint Models

  2017influential citation
• New Methods for Resolving Conflicting Requests with Examples from Medical Residency Scheduling

  2017cites this paper
• Finding a Collection of MUSes Incrementally

  2016cites this paper
• Implicit Hitting Set Algorithms for Reasoning Beyond NP

  2016cites this paper
• Tunable Online MUS/MSS Enumeration

  2016cites this paper
• BEACON: An Efficient SAT-Based Tool for Debugging EL^+ Ontologies

  2016cites this paper
• Propositional Abduction with Implicit Hitting Sets

  2016influential citation
• An Algorithm to Compute Minimal Unsatisfiable Subsets for a Decidable Fragment of First-Order Formulas

  2016cites this paper
• Using Local Search to Find and MUSes

  2016cites this paper
• Type Error Diagnosis for Embedded DSLs by Two-Stage Specialized Type Rules

  2016cites this paper
• On the Extraction of One Maximal Information Subset That Does Not Conflict with Multiple Contexts

  2016cites this paper
• On the query complexity of selecting minimal sets for monotone predicates

  2016cites this paper
• Finding Boundary Elements in Ordered Sets with Application to Safety and Requirements Analysis

  2016cites this paper
• Scheduling Medical Residents With Conflicting Requests For Time Off

  2016cites this paper
• MCS Extraction with Sublinear Oracle Queries

  2016influential citation
• Collaborative Diagnosis of Over-Subscribed Temporal Plans

  2016cites this paper
• The role of unsatisfiable Boolean constraints in lightweight description logics

  2016cites this paper
• Maximal falsifiability

  2015influential citation
• Inconsistency-based Ranking of Knowledge Bases

  2015cites this paper
• CoQuiAAS: A Constraint-Based Quick Abstract Argumentation Solver

  2015cites this paper
• AuRUS: explaining the validation of UML/OCL conceptual schemas

  2015cites this paper
• A New Approach to Partial MUS Enumeration

  2015cites this paper
• The OWL Explanation Workbench : A toolkit for working with justifications for entailments in OWL ontologies

  2015cites this paper
• Efficient Axiom Pinpointing with EL2MCS

  2015cites this paper
• Efficient MUS Enumeration of Horn Formulae with Applications to Axiom Pinpointing

  2015cites this paper
• Fast, flexible MUS enumeration

  2015cites this paper