Argumentation is modelled as a game where the payoffs are measured in terms of the probability that the claimed conclusion is, or is not, defeasibly provable, given a history of a...
We describe an ongoing project in which we attempt to describe a neutral approach to proof and refutation. In particular, we present a language of neutral expressions which contai...
For specifying and verifying branching-time requirements, a reactive system is traditionally modeled as a labeled tree, where a path in the tree encodes a possible execution of the...
We propose a natural framework, called NF, which supports development of formal proofs on a computer. NF is based on a theory of Judgments and Derivations. NF is designed by observ...
The paper summarizes three years of experience of introducing agile practices in academic environments. The perceptions of students from four different academic programs (Diploma,...