In spite of the recent improvements in the performance of Answer Set Programming (ASP) solvers, when the search space is sufficiently large, it is still possible for the search al...
— Developing a problem-domain independent methodology to automatically generate high performing solving strategies for specific problems is one of the challenging trends on hype...
Generic SAT solvers have been very successful in solving hard combinatorial problems in various application areas, including AI planning. There is potential for improved performanc...
Markov Logic Networks (MLNs) combine Markov Networks and first-order logic by attaching weights to firstorder formulas and viewing them as templates for features of Markov Networks...
A key factor that can dramatically reduce the search space during constraint solving is the criterion under which the variable to be instantiated next is selected. For this purpos...