Extracting Policies from Quantified Answer Set Programs
By: Martín Diéguez, Igor Stéphan
Potential Business Impact:
Finds best plans for making decisions.
Quantified Answer Set Programming (QASP) extends Answer Set Programming (ASP) by allowing quantification over propositional variables, similar to Quantified Boolean Formulas (QBF). In this paper, we interpret models of QASP formulas in terms of policies, which represent decision-making strategies that determine how existentially quantified variables should be assigned, given the conditions set by universally quantified variables. As a main contribution, we present an algorithm for policy extraction under QASP semantics, inspired by the Equilibrium Logic semantics for general ASP theories.
Similar Papers
Relating Answer Set Programming and Many-sorted Logics for Formal Verification
Logic in Computer Science
Makes smart computer programs easier to check.
A framework for Conditional Reasoning in Answer Set Programming
Artificial Intelligence
Lets computers reason with "if this, then that" rules.
Formally Explaining Decision Tree Models with Answer Set Programming
Artificial Intelligence
Explains complex computer guesses for safety.