UCL logo

UCL Discovery

UCL home » Library Services » Electronic resources » UCL Discovery

Computing Preferred Safe Beliefs

Montiel, LA; Pérez, JAN; (2004) 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. CEUR-WS.org Green and gold open access

[img]
Preview
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
221Kb

Abstract

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:Proceedings paper
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 publication. A version is also available from UCL Discovery.
Publisher version:http://ceur-ws.org/Vol-92/computing.pdf
Language:English
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

View download statistics for this item

Archive Staff Only: edit this record