2356 search results - page 11 / 472 » Characterizations of postman sets |
115
click to vote
KAIS
2011
14 years 8 months ago
2011
Abstract. Hunter and Konieczny explored the relationships between measures of inconsistency for a belief base and the minimal inconsistent subsets of that belief base in several of...
ITA
2008
15 years 1 months ago
2008
A set T L is a Parikh test set of L iff c(T ) is a test set of c(L). We give an effective characterization of Parikh test sets for arbitrary commutative language.
109
Voted
KR
2010
Springer
15 years 6 months ago
2010
Springer
Dynamic epistemic logic deals with the representation of situations in a multi-agent and dynamic setting. It allows to express in a uniform way statements about:
JACM
2007
15 years 1 months ago
2007
We solve an open question of Milner [1984]. We define a set of so-called well-behaved finite automata that, modulo bisimulation equivalence, corresponds exactly to the set of reg...
KR
2004
Springer
15 years 7 months ago
2004
Springer
We consider Dung’s argumentation framework, in which an argument system consists of a set of arguments and a binary relation between arguments representing the notion of a con...