QUICKXPLAIN

swMATH28625MaRDI QIDQ40339FDOQ40339

Author name not available (Why is that?)

Official website: https://dl.acm.org/citation.cfm?id=1597177

Cited In (54)

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

This page was built for software: QUICKXPLAIN