The following pages link to QUICKXPLAIN (Q40339):
Displayed 31 items.
- Fast, flexible MUS enumeration (Q272009) (← links)
- Computational approaches to finding and measuring inconsistency in arbitrary knowledge bases (Q459042) (← links)
- Algorithms for computing minimal equivalent subformulas (Q460638) (← links)
- Optimal resource allocation and scheduling for the CELL BE platform (Q545538) (← links)
- Preference reasoning with soft constraints in constraint-based recommender systems (Q606917) (← links)
- Learning cluster-based structure to solve constraint satisfaction problems (Q647439) (← links)
- Extending linear relaxation for non-square matrices and soft constraints (Q738985) (← links)
- On getting rid of the preprocessing minimization step in MUC-finding algorithms (Q903912) (← links)
- A constraint programming approach to the additional relay placement problem in wireless sensor networks (Q903915) (← links)
- Reformulating table constraints using functional dependencies-an application to explanation generation (Q941813) (← links)
- Reasoning from last conflict(s) in constraint programming (Q1045989) (← links)
- Progress towards the Holy Grail (Q1616388) (← links)
- Minimal sets on propositional formulae. Problems and reductions (Q1677431) (← links)
- Enumerating justifications using resolution (Q1799123) (← links)
- Strengthening of feasibility cuts in logic-based benders decomposition (Q2117199) (← links)
- SAT-based rigorous explanations for decision lists (Q2118305) (← links)
- Memory-limited model-based diagnosis (Q2124447) (← links)
- Reasoning about strong inconsistency in ASP (Q2661359) (← links)
- MCS Extraction with Sublinear Oracle Queries (Q2818026) (← links)
- LoCo—A Logic for Configuration Problems (Q2946729) (← links)
- On Improving MUS Extraction Algorithms (Q3007681) (← links)
- Propositional SAT Solving (Q3176367) (← links)
- Explaining Hierarchical Multi-linear Models (Q3297809) (← links)
- Efficient MUS Enumeration of Horn Formulae with Applications to Axiom Pinpointing (Q3453236) (← links)
- SAT-Based Horn Least Upper Bounds (Q3453244) (← links)
- Efficient Combination of Decision Procedures for MUS Computation (Q3655210) (← links)
- Model enumeration in propositional circumscription via unsatisfiable core analysis (Q4592705) (← links)
- The KB paradigm and its application to interactive configuration (Q4593081) (← links)
- Deletion Presolve for Accelerating Infeasibility Diagnosis in Optimization Models (Q5131703) (← links)
- Debugging Non-ground ASP Programs: Technique and Graphical Tools (Q5197755) (← links)
- Preference-Based Problem Solving for Constraint Programming (Q5302728) (← links)