Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

21

LANMR
2004

favoriteEmaildiscussreport

123views Logical Reasoning» more LANMR 2004»

Computing Preferred Safe Beliefs

13 years 5 months ago

Computing Preferred Safe Beliefs

Download sunsite.informatik.rwth-aachen.de

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

Real-time Traffic

Arbitrary Propositional Theories | Framework Safe Beliefs | LANMR 2004 | LANMR 2007 | Safe Beliefs |

claim paper

Related Content

» Belief ascription under bounded resources

» Contracting preference relations for database applications

» Complexity of Safe Strategic Voting

» Preferences and AssumptionBased Argumentation for ConflictFree Normative Agents

» StateDependent Risk Preferences in Evolutionary Games

» Principles of Safe Policy Routing Dynamics

» Applying taxonomic knowledge to Bayesian belief network for personalized search

» REVISE An Extended Logic Programming System for Revising Knowledge Bases

» User preferences for taskspecific vs generic application software

Post Info
More Details (n/a)

Added	31 Oct 2010
Updated	31 Oct 2010
Type	Conference
Year	2004
Where	LANMR
Authors	Luis A. Montiel, Juan A. Navarro

Comments (0)