zbMATH — the first resource for mathematics

Two-variable first-order logic with counting in forests. (English) Zbl 1415.68110
Barthe, Gilles (ed.) et al., LPAR-22. 22nd international conference on logic for programming, artificial intelligence and reasoning, Awassa, Ethiopia, November 17–21, 2018. Selected papers. Manchester: EasyChair. EPiC Ser. Comput. 57, 214-232 (2018).
Summary: We consider an extension of two-variable, first-order logic with counting quantifiers and arbitrarily many unary and binary predicates, in which one distinguished predicate is interpreted as the mother-daughter relation in an unranked forest. We show that both the finite satisfiability and the general satisfiability problems for the extended logic are decidable in NExpTime. We also show that the decision procedure for finite satisfiability can be extended to the logic where two distinguished predicates are interpreted as the mother-daughter relations in two independent forests.
For the entire collection see [Zbl 1407.68021].
68Q25 Analysis of algorithms and problem complexity
03B70 Logic in computer science
Full Text: DOI