Sciweavers

Share
LANMR
2004

Computing Preferred Safe Beliefs

9 years 9 months ago
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.
Luis A. Montiel, Juan A. Navarro
Added 31 Oct 2010
Updated 31 Oct 2010
Type Conference
Year 2004
Where LANMR
Authors Luis A. Montiel, Juan A. Navarro
Comments (0)
books