OBJECTIVE To examine the prevalence and predictors of language attainment in children with autism spectrum disorder (ASD) and severe language delay. We hypothesized greater autism symptomatology and lower intelligence among children who do not attain phrase/fluent speech, with nonverbal intelligence and social engagement emerging as the strongest predictors of outcome. METHODS Data used for t...

BACKGROUND this study examines the linguistic features that may influence the occurrence of speech boundaries in fluent and stuttering individuals. AIM the study seeks to examine the influences of tone and position in a word on the occurrence of speech boundaries in stuttering and fluent adolescents and adults. METHOD one hundred and twenty individuals took part in this study, both male and...

The range of applicability of the Full Event Calculus is proven to be the Ksp-IA class in the Features and Fluents taxonomy. The proof is given with respect to the original definition of this preference logic, where no adjustments of the language or reasoning method were necessary. The result implies that the claims on the expressiveness and problem-solving power of this logic were indeed correct.

The paper is an exercise in formal program development. We rigorously show how planning problems encoded as entailment problems in the uent calculus can be mapped onto satissability problems for propositional formulas, which in turn can be mapped to the problem to nd models using binary decision diagrams. The mapping is shown to be sound and complete. Preliminary experimental results of an impl...

This paper describes a polynomially-solvable subproblem of temporal planning. Polynomiality follows from two assumptions. Firstly, by supposing that each sub-goal fluent can be established by at most one action, we can quickly determine which actions are necessary in any plan. Secondly, the monotonicity of sub-goal fluents allows us to express planning as an instance of STP. Our class includes ...

In this paper we discuss conjunctive planning problems in the context of the fluent calculus and Petri nets. We show that both formalisms are equivalent in solving these problems. Thereafter, we extend actions to contain preconditions as well as obstacles. This requires to extend the fluent calculus as well as Petri nets. Again, we show that both extended formalisms are equivalent.

The real-world application of planning techniques often requires models with numeric fluents. However, these fluents are not directly supported by most planners and heuristics. We describe a family of planning algorithms that takes a numeric planning problem and produces an abstracted representation that can be solved using any classical planner. The resulting abstract plan is generalized into ...