998 resultados para TEMPORAL STEM
Resumo:
This paper presents a formalism for representing temporal knowledge in legal discourse that allows an explicit expression of time and event occurrences. The fundamental time structure is characterized as a well‐ordered discrete set of primitive times, i.e. non‐decomposable intervals with positive duration or points with zero duration), from which decomposable intervals can be constructed. The formalism supports a full representation of both absolute and relative temporal knowledge, and a formal mechanism for checking the temporal consistency of a given set of legal statements is provided. The general consistency checking algorithm which addresses both absolute and relative temporal knowledge turns out to be a linear programming problem, while in the special case where only relative temporal relations are involved, it becomes a simple question of searching for cycles in the graphical representation of the corresponding legal text.
Resumo:
We study two marked point process models based on the Cox process. These models are used to describe the probabilistic structure of the rainfall intensity process. Mathematical formulation of the models is described and some second-moment characteristics of the rainfall depth, and aggregated processes are considered. The derived second-order properties of the accumulated rainfall amounts at different levels of aggregation are used in order to examine the model fit. A brief data analysis is presented. Copyright © 1998 John Wiley & Sons, Ltd.
Resumo:
This paper describes a knowledge-based temporal representation of state transitions for industrial real-time systems. To allow expression of uncertainty, we shall define fluents as disjuncts of positive/negative time-varying properties. A state of the world is represented as a collection of fluents, which is usually incomplete in the sense that neither the positive form nor the negative form of some properties can be implied from it. The world under consideration is assumed to persist in a given state until an action(s) takes place to effect a transition of it into another state, where actions may either be instantaneous or durative. High-level causal laws are characterized in terms of relationships between actions and the involved world states. An effect completion axiom is imposed on each causal law to guarantee that all the fluents that can be affected by the performance of the corresponding action are governed. This completion requirement is practical for most industrial real-time applications and in fact provides a simple and effective treatment to the so-called frame problem.
Resumo:
Logic-based models are thriving within artificial intelligence. A great number of new logics have been defined, and their theory investigated. Epistemic logics introduce modal operators for knowledge or belief; deontic logics are about norms, and introduce operators of deontic necessity and possibility (i.e., obligation or prohibition). And then we have a much investigated class—temporal logics—to whose application to engineering this special issue is devoted. This kind of formalism deserves increased widespread recognition and application in engineering, a domain where other kinds of temporal models (e.g., Petri nets) are by now a fairly standard part of the modelling toolbox.
Resumo:
There are three main approaches to the representation of temporal information in AI literature: the so-called method of temporal arguments that simply extends functions and predicates of first-order language to include time as the additional argument; modal temporal logics which are extensions ofthe propositional or predicate calculus with modal temporal operators; and reified temporal logics which reify standard propositions of some initial language (e.g., the classical first-order or modal logic) as objects denoting propositional terms. The objective of this paper is to provide an overview onthe temporal reified approach by looking closely atsome representative existing systems featuring reified propositions, including those of Allen, McDermott, Shoham, Reichgelt, Galton, and Ma and Knight. We shall demonstrate that, although reified logics might be more complicated in expressing assertions about some given objects with respect to different times, they accord a special status to time and therefore have several distinct advantages in talking about some important issues which would be difficult (if not impossible) to express in other approaches.
Resumo:
Temporal relationships between events and their effects are complex. As the effects of a given event, a proposition may change its truth value immediately after the occurrence of the event and remain true until some other events occur, while another proposition may only become true/false from some time after the causal event has occurred. Expressing delayed effects of events has been a problematic question in most existing theories of action and change. This paper presents a new formalism for representing general temporal causal relationships between events and their effects. It allows expressions of both immediate and delayed effects of events, and supports common-sense assertions such as "effects cannot precede their causes".
Resumo:
Reply to author's reply
Resumo:
Spatio-temporal data on cytotaxonomic identifications of larvae of different members of the Simulium damnosum complex collected from rivers in southern Ghana and south-western Togo from 1975 until 1997 were analysed. When the data were combined, the percentages of savannah blackflies (S. damnosum sensu stricto and S. sirbanum) in the samples were shown to have been progressively increasing since 1975. The increases were statistically significant (P < 0·001), but the rates of increase were not linear. Further analyses were conducted according to the collection seasons and locations of the samples, to account for possible biases such as savannah flies occurring further south in the dry season or a preponderance of later samples from northern rivers having more savannah flies. These analyses showed that the increasing trend was statistically significant (P< 0·0001) only during the periods April to June and October to December. The presence of adult savannah flies carrying infective larvae (L3) indistinguishable from those of Onchocerca volvulus in the study zone was confirmed by examinations of captured flies. The percentages of savannah flies amongst the human-biting populations and the percentages with L3s in the head were higher during dry seasons than wet seasons and the savannah species were found furthest south (5 °25′N) in the dry season. Comparisons of satellite images taken in 1973 and 1990 over a study area in south-western Ghana encompassing stretches of the Tano and Bia rivers demonstrated that there have been substantial increases in urban and savannah areas, at the expense of forest. This was so not only for the whole images but also for subsamples of the images taken at 1, 2, 4, 8 and 16 km distant from sites alongside the River Tano. At every distance from the river, the percentages of pixels classified as urban or savannah have increased in 1990 compared with 1973, while those classified as degraded or dense forest have decreased. The possibility that the proportionate increases in savannah forms of the vectors of onchocerciasis, and hence in the likelihood of the transmission of savannah strains of the disease in formerly forested areas, were related to the decreases in forest cover is discussed.
Resumo:
The notion of time plays a vital and ubiquitous role of a common universal reference. In knowledge-based systems, temporal information is usually represented in terms of a collection of statements, together with the corresponding temporal reference. This paper introduces a visualized consistency checker for temporal reference. It allows expression of both absolute and relative temporal knowledge, and provides visual representation of temporal references in terms of directed and partially weighted graphs. Based on the temporal reference of a given scenario, the visualized checker can deliver a verdict to the user as to whether the scenario is temporally consistent or not, and provide the corresponding analysis / diagnosis.
Resumo:
A natural approach to representing and reasoning about temporal propositions (i.e., statements with time-dependent truth-values) is to associate them with time elements. In the literature, there are three choices regarding the primitive for the ontology of time: (1) instantaneous points, (2) durative intervals and (3) both points and intervals. Problems may arise when one conflates different views of temporal structure and questions whether some certain types of temporal propositions can be validly and meaningfully associated with different time elements. In this paper, we shall summarize an ontological glossary with respect to time elements, and diversify a wider range of meta-predicates for ascribing temporal propositions to time elements. Based on these, we shall also devise a versatile categorization of temporal propositions, which can subsume those representative categories proposed in the literature, including that of Vendler, of McDermott, of Allen, of Shoham, of Galton and of Terenziani and Torasso. It is demonstrated that the new categorization of propositions, together with the proposed range of meta-predicates, provides the expressive power for modeling some typical temporal terms/phenomena, such as starting-instant, stopping-instant, dividing-instant, instigation, termination and intermingling etc.
Resumo:
There are mainly two known approaches to the representation of temporal information in Computer Science: modal logic approaches (including tense logics and hybrid temporal logics) and predicate logic approaches (including temporal argument methods and reified temporal logics). On one hand, while tense logics, hybrid temporal logics and temporal argument methods enjoy formal theoretical foundations, their expressiveness has been criticised as not power enough for representing general temporal knowledge; on the other hand, although current reified temporal logics provide greater expressive power, most of them lack of complete and sound axiomatic theories. In this paper, we propose a new reified temporal logic with a clear syntax and semantics in terms of a sound and complete axiomatic formalism which retains all the expressive power of the approach of temporal reification.
Resumo:
This paper introduces a characterization of the so-called most general temporal constraint (GTC), which guarantees the common-sense assertion that "the beginning of the effect cannot precede the beginning of the cause". The formalism is based on general time theory which takes both points and intervals as primitive. It is shown that there are in fact 8 possible causal relationships which satisfy GTC, including cases where, on the one hand, effects start simultaneously with, during, immediately after, or some time after their causes, and on the other hand, events end before, simultaneously with, or after their causes. These causal relationships are versatile enough to subsume those representatives in the literature.
Resumo:
The representation and manipulation of natural human understanding of temporal phenomena is a fundamental field of study in Computer Science, which aims both to emulate human thinking, and to use the methods of human intelligence to underpin engineering solutions. In particular, in the domain of Artificial Intelligence, temporal knowledge may be uncertain and incomplete due to the unavailability of complete and absolute temporal information. This paper introduces an inferential framework for deriving logical explanations from partial temporal information. Based on a graphical representation which allows expression of both absolute and relative temporal knowledge in incomplete forms, the system can deliver a verdict to the question if a given set of statements is temporally consistent or not, and provide understandable logical explanation of analysis by simplified contradiction and rule based reasoning.
Resumo:
Generally speaking, the term temporal logic refers to any system of rules and symbolism for representing and reasoning about propositions qualified in terms of time. In computer science, particularly in the domain of Artificial Intelligence, there are mainly two known approaches to the representation of temporal information: modal logic approaches including tense logic and hybrid temporal logic, and predicate logic approaches including temporal arguement method and reified temporal logic. On one hand, while tense logic, hybrid temporal logic and temporal argument method enjoy formal theoretical foundations, their expressiveness has been criticised as not power enough for representing general temporal knowledge; on the other hand, although reified temporal logic provides greater expressive power, most of the current systems following the temporal reification lack of complete and sound axiomatic theories. With there observations in mind, a new reified temporal logic with clear syntax and semantics in terms of a sound and complete axiomatic formalism is introduced in this paper, which retains all the expressive power of temporal reification.