A satisfiability algorithm for the $\mu-$calculus interpreted on tree models and extended with converse modalities and Presburger arithmetic operators, based on a breadth-first search in a Fischer-Lardner construction of tree models is described.Expand

It is proved that the logic introduced in the present work is decidable in single exponential time even if the numerical constraints are in binary form, which implies a characterization of decidable counting extensions of XPath queries and XML schemas.Expand

This work considers the problem of query containment in the presence of type constraints for a class of regular path queries extended with counting and interleaving operators, and provides a logic-based framework supporting these operators which can be used to solve common query reasoning problems such as satisfiability and containment of queries in exponential time.Expand

This work studies the fully-enriched μ-calculus for trees extended with Presburger constraints and shows that the logic is decidable in EXPTIME, achieved by the introduction of a satisfiability algorithm based on a Fischer-Ladner model construction that is able to handle binary encodings of PresBurger constraints.Expand

It is shown that μALCTIO, which is known to be undecidable and that subsumes ALCQIOreg, is inEXPTIME in the case of tree models, and that knowledge base reasoning, TBoxes and ABoxes, can also be decided in EXPTIME.Expand

This paper presents a method for diabetic retinopathy detection, which has used local binary patterns (LBP) to extract local features, while in the second stage, it has applied artificial neural networks, random forest and support vector machines for the detection task.Expand

This work studies the fully-enriched µ-calculus for trees extended with Presburger constraints, and shows that this extension is decidable in EXPTIME, and identifies decidable extensions of regular tree languages (XML schemas) with interleaving and counting operators.Expand

This work provides a plan generator based on a model checking algorithm for the μ -calculus, an expressive modal logic which subsumes many program logics such as LTL, PDL and CTL and shows the algorithm is sound and complete, that is, for any environment, there a satisfying plan for a given set of constraints, if and only if, the plan generator succeeds.Expand