A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
Query evaluation in monadic second-order logic (MSO) is tractable on trees and treelike instances, even though it is hard for arbitrary instances. This tractability result has been extended to several tasks related to query evaluation, such as counting query results  or performing query evaluation on probabilistic trees . These are two examples of the more general problem of computing augmented query output, that is referred to as provenance. This article presents a provenance frameworkdoi:10.1007/978-3-662-47666-6_5 fatcat:dpatpbav7fgblnbvfsx6dbr6k4