QUICKXPLAIN
From MaRDI portal
Cited in
(54)- The KB paradigm and its application to interactive configuration
- Learning cluster-based structure to solve constraint satisfaction problems
- Memory-limited model-based diagnosis
- Fast, flexible MUS enumeration
- Propositional SAT solving
- Computational approaches to finding and measuring inconsistency in arbitrary knowledge bases
- Progress towards the Holy Grail
- Strengthening of feasibility cuts in logic-based benders decomposition
- Reasoning about strong inconsistency in ASP
- SAT-based rigorous explanations for decision lists
- Debugging non-ground ASP programs: technique and graphical tools
- SAT-Based Horn Least Upper Bounds
- Explaining hierarchical multi-linear models
- A constraint programming approach to the additional relay placement problem in wireless sensor networks
- On getting rid of the preprocessing minimization step in MUC-finding algorithms
- MCS Extraction with Sublinear Oracle Queries
- Optimal resource allocation and scheduling for the CELL BE platform
- Reasoning from last conflict(s) in constraint programming
- Deletion presolve for accelerating infeasibility diagnosis in optimization models
- LoCo—A Logic for Configuration Problems
- Extending linear relaxation for non-square matrices and soft constraints
- Reformulating table constraints using functional dependencies-an application to explanation generation
- Pellet
- Algorithms for computing minimal equivalent subformulas
- Preference reasoning with soft constraints in constraint-based recommender systems
- SOCRATES
- linprog
- Ltur
- AMUSE
- CEL
- HermiT
- MUSer2
- BEACON
- Just
- On improving MUS extraction algorithms
- ELK
- MERGEXPLAIN
- OntoDebug
- EL2MCS
- PULi
- asprin
- spock
- MiniBrass
- circumscriptino
- hclasp
- LP2SAT
- HiRise
- Efficient combination of decision procedures for MUS computation
- HgMUS
- Preference-Based Problem Solving for Constraint Programming
- Minimal sets on propositional formulae. Problems and reductions
- Model enumeration in propositional circumscription via unsatisfiable core analysis
- Enumerating justifications using resolution
- Efficient MUS enumeration of Horn formulae with applications to axiom pinpointing
This page was built for software: QUICKXPLAIN
