Computing Preferred Safe Beliefs

We recently proposed a definition of a language for nonmonotonic reasoning based on intuitionistic logic. Our main idea is a generalization of the notion of answer sets for arbitrary propositional theories. We call this extended framework safe beliefs. We present an algorithm, based on the Davis-Putnam (DP) method, to compute safe beliefs for arbitrary propositional theories. We briefly discuss some ideas on how to extend this paradigm to incorporate preferences.

• Type: Conference
• Year: 2004
• Where: LANMR
• Authors: Luis A. Montiel, Juan A. Navarro
• Keywords: Arbitrary Propositional Theories, Framework Safe Beliefs, LANMR 2004, LANMR 2007, Safe Beliefs