MSO logic on unranked trees has been identified as a convenient theoretical framework for reasoning about expressiveness and implementations of practical XML query languages. As a...
Sebastian Maneth, Alexandru Berlea, Thomas Perst, ...
Two operations commute if executing them serially in either order results in the same change of state. In a system in which commands may be issued simultaneously by different use...
Greg Dennis, Robert Seater, Derek Rayside, Daniel ...
Soundness proofs of program logics such as Hoare logics and type systems are often made easier by decorating the operational semantics with information that is useful in the proof...
Abstract. We describe a new software, pbmodels, that uses pseudo-boolean constraint solvers (PB solvers) to compute stable models of logic programs with weight atoms. To this end, ...