Employee 'words' on high involvement work practices, value congruence and burnout

This article examined the impact of perceived high involvement work practices (HIWPs) on person-organization value congruence (P-O fit) and long term burnout. The study was conducted in a Canadian general hospital. Findings from structural equation modeling (N = 185) revealed that perceived HIWPs were significantly positively associated with P-O fit. While there was no direct effect of HIWPs on burnout, P-O fit fully mediated the relationship between perceptions of HIWPs and burnout. We discuss the implications of these findings for our understanding of HIWPs influence on P-O fit and burnout.

Semantics for possibilistic answer set programs: uncertain rules versus rules with uncertain conclusions

Although Answer Set Programming (ASP) is a powerful framework for declarative problem solving, it cannot in an intuitive way handle situations in which some rules are uncertain, or in which it is more important to satisfy some constraints than others. Possibilistic ASP (PASP) is a natural extension of ASP in which certainty weights are associated with each rule. In this paper we contrast two different views on interpreting the weights attached to rules. Under the first view, weights reflect the certainty with which we can conclude the head of a rule when its body is satisfied. Under the second view, weights reflect the certainty that a given rule restricts the considered epistemic states of an agent in a valid way, i.e. it is the certainty that the rule itself is correct. The first view gives rise to a set of weighted answer sets, whereas the second view gives rise to a weighted set of classical answer sets.

Communicating Answer Set Programs

Answer set programming is a form of declarative programming that has proven very successful in succinctly formulating and solving complex problems. Although mechanisms for representing and reasoning with the combined answer set programs of multiple agents have already been proposed, the actual gain in expressivity when adding communication has not been thoroughly studied. We show that allowing simple programs to talk to each other results in the same expressivity as adding negation-as-failure. Furthermore, we show that the ability to focus on one program in a network of simple programs results in the same expressivity as adding disjunction in the head of the rules.