Tarski asked whether the arithmetic identities taught in high school are complete for showing all arithmetic equations valid for the natural numbers. The answer to this question f...
We observe that equivalence is not a robust concept in the presence of numerical information - such as probabilities - in the model. We develop a metric analogue of weak bisimulat...
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
Abstract: The goals of organic computing are difficult to achieve due to the heterogenity of current software components. We believe that in the long term more advanced software a...
The dependency pair approach is one of the most powerful techniques for automated (innermost) termination proofs of term rewrite systems (TRSs). For any TRS, it generates inequalit...
The paper presents a modular superposition calculus for the combination of first-order theories involving both total and partial functions. Modularity means that inferences are pu...
Harald Ganzinger, Viorica Sofronie-Stokkermans, Uw...
We propose to build an automated reasoning system for first-order logic (FOL) by translating reasoning problems to a fragment of FOL called coherent logic (CL) and then solving t...