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 ...

This note shows how to formalize a small set of general facts about buying and selling. We begin with summarizing properties of buying/selling informally in English, and give examples of consequences of these assumptions. Then we formalize our assumptions in action language C+ with additive fluents and actions and test the adequacy of the proposed formalization using the Causal Calculator.

The purpose of this article is to provide a uniform lightweight language speci cation and tutorial for a class of temporal logics for reasoning about action and change that has been developed by our group during the period The class of log ics are collected under the name TAL an acronym for Temporal Action Logics TAL has its origins and inspiration in the work with Features and Fluents FF by Sa...

The presented work covers the issue of applying neural networks to the recognition and categorization of non-fluent and fluent utterance records. Speech samples containing three types of stuttering episodes (blocks before words starting with plosives, syllable repetitions, and sound-initial prolongations) were applied. The proposed system, built with hierarchical neural network framework, was u...

While historically the Fluent Calculus arose from approaches to the Frame Problem using non-classical, linear logics, an alternative is to view it as a development of the Situation Calculus with the aim of coping with the inferential aspect of the Frame Problem. Starting oo from the concept of successor state axioms as a solution to the representational aspect, we show how by gradual improvemen...

Infants are adept at tracking statistical regularities to identify word boundaries in pause-free speech. However, researchers have questioned the relevance of statistical learning mechanisms to language acquisition, since previous studies have used simplified artificial languages that ignore the variability of real language input. The experiments reported here embraced a key dimension of variab...