A Tree Logic with Graded Paths and Nominals

Details A Tree Logic with Graded Paths and Nominals A Tree Logic with Graded Paths and Nominals

2010-05-31

arxiv.org/abs/1005.5623v1

Computer Science

Logic in Computer Science

Scientific paper

Regular tree grammars and regular path expressions constitute core constructs widely used in programming languages and type systems. Nevertheless, there has been little research so far on reasoning frameworks for path expressions where node cardinality constraints occur along a path in a tree. We present a logic capable of expressing deep counting along paths which may include arbitrary recursive forward and backward navigation. The counting extensions can be seen as a generalization of graded modalities that count immediate successor nodes. While the combination of graded modalities, nominals, and inverse modalities yields undecidable logics over graphs, we show that these features can be combined in a tree logic decidable in exponential time.

Affiliated with

Also associated with

No associations

Rating

A Tree Logic with Graded Paths and Nominals does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Tree Logic with Graded Paths and Nominals, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Tree Logic with Graded Paths and Nominals will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-627551