Reasoning on words and trees with data
نویسنده
چکیده
configuration, 138Alternating Register Automata, 25Alternating Tree Register Automata,115ancestor relation ( , ≺), 57ARA, 25ARA(guess, spread), 25ARA(guess, spread, <), 32ATRA, 115ATRA(guess, spread), 115attrXPath, 63Aut, 79Aut , 79
منابع مشابه
بررسی کنشهای شناختی دانشآموزان دارای لکنت
Objective Stuttering is one of the most common speech disorders that generate many complications in children and adults. This disorder involves behavioral, cognitive and emotional interactions. So, the purpose of the current study is to investigate the cognitive functions of students with stuttering. Materials & Methods A descriptive study, comprising of 30 students (8 females and 22 males) fr...
متن کاملExtending Büchi Automata with Constraints on Data Values
Recently data trees and data words have received considerableamount of attention in connection with XML reasoning and systemverification. These are trees or words that, in addition to labels from afinite alphabet, carry data values from an infinite alphabet (data). Ingeneral it is rather hard to obtain logics for data words and trees thatare sufficiently expressive, but ...
متن کاملContext-dependent reasoning with lexical knowledge using default logic
Lexical knowledge is increasingly important in language engineering. However, it is a dii-cult kind of knowledge to represent and reason with. Existing approaches to formalizing lexical knowledge have used languages with limited expressibility and in particular they have not addressed the context-dependent nature of lexical knowledge. Here we present a framework, based on default logic, called ...
متن کاملReasoning and intuiting the standards for judgments
What is the extension to which the act of reasoning and the standards of judgments are interrelated? The author, proposing Muslim scholars` views in the field and relying on traditions, ahadith, has concluded that firstly one has to answer the question: does the standard and expediency of Divine judgment lies in the judgment or in its object? The latter is signified, however, with view to so...
متن کاملOn the Satisfiability of Two-Variable Logic over Data Words
Data trees and data words have been studied extensively in connection with XML reasoning. These are trees or words that, in addition to labels from a finite alphabet, carry labels from an infinite alphabet (data). While in general logics such as MSO or FO are undecidable for such extensions, decidablity results for their fragments have been obtained recently, most notably for the two-variable f...
متن کامل