Sciweavers

34 search results - page 1 / 7
» Computing Preferred Safe Beliefs
Sort
View
LANMR
2004
13 years 8 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 arbitr...
Luis A. Montiel, Juan A. Navarro
SYNTHESE
2010
130views more  SYNTHESE 2010»
13 years 5 months ago
Belief ascription under bounded resources
There exists a considerable body of work on epistemic logics for resource-bounded reasoners. In this paper, we concentrate on a less studied aspect of resource-bounded reasoning, n...
Natasha Alechina, Brian Logan
AI
2011
Springer
13 years 2 months ago
Contracting preference relations for database applications
The binary relation framework has been shown to be applicable to many real-life preference handling scenarios. Here we study preference contraction: the problem of discarding sele...
Denis Mindolin, Jan Chomicki
SAGT
2010
Springer
191views Game Theory» more  SAGT 2010»
13 years 5 months ago
Complexity of Safe Strategic Voting
We investigate the computational aspects of safe manipulation, a new model of coalitional manipulation that was recently put forward by Slinko and White [11]. In this model, a pot...
Noam Hazon, Edith Elkind
ARGMAS
2007
Springer
13 years 11 months ago
Preferences and Assumption-Based Argumentation for Conflict-Free Normative Agents
Argumentation can serve as an effective computational tool and as a useful abstraction for various agent activities and in particular for agent reasoning. In this paper we further ...
Dorian Gaertner, Francesca Toni