We present a framework for investigating merging operators for belief sets. This framework is a generalisation of our earlier work concerning consistency-based belief revision and...
All major semantics of normal logic programs and normal logic programs with aggregates can be described as fixpoints of the one-step provability operator or of operators that can...
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance bo...
We present decidability results for the verification of cryptographic protocols in the presence of equational theories corresponding to xor and Abelian groups. Since the perfect ...
We show that the first-order theory of structural subtyping of non-recursive types is decidable, as a consequence of a more general result on the decidability of term powers of d...