Complex software systems typically involve features like time, concurrency and probability, where probabilistic computations play an increasing role. It is challenging to formaliz...
Huibiao Zhu, Shengchao Qin, Jifeng He, Jonathan P....
Abstract. In this paper, we propose a logical framework for reasoning about uncertain belief fusion. The framework is a combination of multi-agent epistemic logic and possibilistic...
We propose pattern matching calculi as a refinement of λ-calculus that integrates mechanisms appropriate for fine-grained modelling of non-strict pattern matching. Compared with...
We investigate a generalization of weight-constraint programs with stable semantics, as implemented in the ASP solver smodels. Our programs admit atoms of the form X, F where X is ...
We examine how computer system problems can be derived from real application problems, with a particular focus on the relevance of some assumptions, especially those related to co...