Bob,
I think that it is a mistake to fix the time unit to milliseconds.
The having an external method of setting the time removes the limitations
of the processor speed.
This simple notion of time does not have a way to express a timeout.
However the idea of being able to express a range of times for the action
is interesting.
I have not been able to find a clear explaination of temporal rule syntax.
But, I can offer the this list of references from the ACM Digital library.
None these articles speak in clear terms about what is needed to express
a wide range of temporal rules.
SaS
> home > about > feedback > logout
Stuart A Schmukler > Bookshelf
Search Results
Search Results for: [syntax<AND>((temporal rules) )]
Found 11 of 354,219 searched.
Search within Results
> Advanced Search > Search Help/Tips
--------------------------------------------------------------------------------
Sort by: Title Publication Publication Date Score Binder
--------------------------------------------------------------------------------
Results 1 - 11 of 11 short listing
--------------------------------------------------------------------------------
1
Polynomial time query processing in temporal deductive databases
Jan Chomicki
Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of
database systems April 1990
We study conditions guaranteeing polynomial time computability of queries in
temporal deductive databases. We show that if for a given set of temporal
rules, the period of its least models is bounded from the above by a polynomial
in the database size, then also the time to process yes-no queries (as well as
to compute finite representations of all query answers) can be polynomially
bounded. We present a bottom-up query processing algorithm BT that is
guaranteed to terminate in polynomial t ... 82%
2
Relational specifications of infinite query answers
Jan Chomicki , Tomasz Imieliński
ACM SIGMOD Record , Proceedings of the 1989 ACM SIGMOD international conference
on Management of data June 1989
Volume 18 Issue 2
We investigate here functional deductive databases: an extension of DATALOG
capable of representing infinite phenomena. Rules in functional deductive
databases are Horn and predicates can have arbitrary unary and limited k-ary
function symbols in one fixed position. This class is known to be decidable.
However, least fixpoints of functional rules may be infinite. We present here a
method to finitely represent infinite least fixpoints and infinite query
answers as re ... 80%
3
Temporal deductive databases and infinite objects
Jan Chomicki , Tomasz Imieliński
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART on Principles of database
systems March 1988
We discuss deductive databases with one fixed occurrence of a monadic function
symbol(successor) per predicate Databases of this kind can be used in a natural
way to model simple patterns of events repeated in time, and this is why we
term them temporal. Temporal deductive databases are also interesting from a
theoretical point of view, because they give rise to infinite least fix-points
and infinite query answers. We study ... 80%
4
Temporal conditions and integrity constraints in active database systems
A. Prasad Sistla , Ouri Wolfson
Proceedings of the 1995 ACM SIGMOD international conference on Management of
data June 1995 80%
5
Experiments with Prolog design descriptions and tools in CAEDE
R. J. A. Buhr , C. M. Woodside , G. M. Karam , K. Van Der Loo , D. G. Lewis
Proceedings of the 8th international conference on Software engineering August
1985
We report on experiments with Prolog design descriptions and tools in CAEDE
(Carleton Embedded System Design Environment), an experimental, iconic design
environment for multitasking, embedded systems. The philosophy of CAEDE is to
enter structural and temporal design information iconically, via a graphics
interface, to serve as the basis for design analysis and skeleton code
generation, and then to enter, under control of the iconic interface,
program “strips” to fill in the fu ... 77%
6
Active database systems
Norman W. Paton , Oscar Díaz
ACM Computing Surveys (CSUR) March 1999
Volume 31 Issue 1
Active database systems support mechanisms that enable them to respond
automatically to events that are taking place either inside or outside the
database system itself. Considerable effort has been directed towards improving
understanding of such systems in recent years, and many different proposals
have been made and applications suggested. This high level of activity has not
yielded a single agreed-upon standard approach to the integration of active
functionality with conventional databa ... 77%
7
Temporal aggregation in active database rules
Iakovos Motakis , Carlo Zaniolo
ACM SIGMOD Record , Proceedings of the ACM SIGMOD international conference on
Management of data June 1997
Volume 26 Issue 2
An important feature of many advanced active database prototypes is support for
rules triggered by complex patterns of events. Their composite event languages
provide powerful primitives for event-based temporal reasoning. In fact, with
one important exception, their expressive power matches and surpasses that of
sophisticated languages offered by Time Series Management Systems (TSMS), which
have been extensively used for temporal data analysis and knowledge discovery.
This exception pertai ... 77%
8
View maintenance issues for the chronicle data model (extended abstract)
H. V. Jagadish , Inderpal Singh Mumick , Abraham Silberschatz
Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles
of database systems May 1995 77%
9
A temporal authorization model
Elisa Bertino , Claudio Bettini , Pierangela Samarati
Proceedings of the 2nd ACM Conference on Computer and communications security
November 1994
This paper presents a discretionary access control model in which
authorizations contain temporal information. This information can be used to
specify temporal intervals of validity for authorizations and temporal
dependencies among authorizations. A formal definition of those concepts is
presented in the paper, in terms of their interpretation in first order logic.
We characterize sets of temporal dependencies that can lead to undesirable
states of the authorization system and we sketch an ... 77%
10
Noncommand user interfaces
Jakob Nielsen
Communications of the ACM April 1993
Volume 36 Issue 4 77%
11
K Yuh-Ming Shyy , Stanley Y. W. Su
ACM SIGMOD Record , Proceedings of the 1991 ACM SIGMOD international conference
on Management of data April 1991
Volume 20 Issue 2 77%
---- On Tue, 18 Dec 2001, bob mcwhirter ([EMAIL PROTECTED]) wrote:
>
> Okay, drools now handles temporal rules of one flavor (more flavors
> to come lateron).
>
> To a <when> block, you can now add a sub-element <duration
> seconds="42"/>
> which becomes a durational condition.
>
> <when>
> <cond>
> ticket.getStatus() == Ticket.NEW
> </cond>
>
> <!-- If it's NEW for 10 minutes -->
> <duration seconds="600"/>
> </when>
>
> And thus, the <then> will fire *only* if the rest of the conditions of
> the rule hold true (and completely true) for the entire duration.
>
> If, at any time during the duration, the rule goes to false, the action
> invokation gets dismissed. Having the rule go to true again simply
> resets the clock from scratch.
>
> I plan on implementing a looser durational condition, to allow for many
> truth changes during the duration, and still have the action fire at
> expiration as long as the rule is true upon expiration.
>
> Additionally, absolute cron-like firings will also be implemented.
>
> ie: "If these conditions are true this Wednesday at 8pm, do this".
>
> Anyhow, a new example is in CVS, and should go out in tomorrow's daily
> build (I just missed tonight's deadline for the cron job).
>
> -bob
>
>
> _______________________________________________
> drools-interest mailing list
> [EMAIL PROTECTED]
> https://lists.sourceforge.net/lists/listinfo/drools-interest
>
>
_______________________________________________
drools-interest mailing list
[EMAIL PROTECTED]
https://lists.sourceforge.net/lists/listinfo/drools-interest
