Deciding the First-Order Theory of an Algebra of Feature Trees with Updates

Abstract : We investigate a logic of an algebra of trees including the update operation, which expresses that a tree is obtained from an input tree by replacing a particular direct subtree of the input tree, while leaving the rest unchanged. This operation improves on the expressivity of existing logics of tree algebras, in our case of feature trees. These allow for an unbounded number of children of a node in a tree. We show that the first-order theory of this algebra is decidable via a weak quantifier elimination procedure which is allowed to swap existential quantifiers for universal quantifiers. This study is motivated by the logical modeling of transformations on UNIX file system trees expressed in a simple programming language.
Document type :
Conference papers
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01807474
Contributor : Nicolas Jeannerod <>
Submitted on : Monday, June 4, 2018 - 5:42:44 PM
Last modification on : Friday, January 4, 2019 - 5:33:38 PM

Identifiers

  • HAL Id : hal-01807474, version 1

Collections

Citation

Nicolas Jeannerod, Ralf Treinen. Deciding the First-Order Theory of an Algebra of Feature Trees with Updates. IJCAR 2018 - 9th International Joint Conference on Automated Reasoning, Jul 2018, Oxford, United Kingdom. 〈hal-01807474〉

Share

Metrics

Record views

31