SearchSkip to Search Results
We examine various techniques in SAT-based (Satisfiability) planningand explore how they can be applied and further improved in the contextof ASP (Answer Set Programming). First, we look at the 2006 plannerSATPlan and show that their encoding, when translated directly intoASP, enjoys a...
Can efficient solvers be built for disjunctive hybrid MKNF knowledgebases? Recent breakthroughs in solver construction have proven AnswerSet Programming (ASP) to be a fruitful medium for tackling problemsthat lie within the lower two levels of the polynomial hierarchy. Thelogic of hybrid MKNF...