Computing Preferred Safe Beliefs.
In: Osorio, M and Provetti, A, (eds.)
Latin-American Workshop on Non-Monotonic Reasoning: Proceedings of the 1st Intl. LA-NMR04 Workshop.
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.
|Title:||Computing Preferred Safe Beliefs|
|Event:||Proceedings of the 1st Intl. LA-NMR04 Workshop, Antiguo Colegio de San Ildefonso, Mexico City, D.F , Mexico, April 26th 2004|
|Open access status:||An open access version is available from UCL Discovery|
|Additional information:||© 2004 The authors|
|Keywords:||Answer Sets, Davis Putnam, Safe Beliefs, Preferences, Algo- rithms.|
|UCL classification:||UCL > School of BEAMS > Faculty of Engineering Science > Computer Science|
Archive Staff Only