Filters








2,490 Hits in 5.7 sec

Page 5104 of Mathematical Reviews Vol. , Issue 2000g [page]

2000 Mathematical Reviews  
(NL-EIND-C; Eindhoven) Truth of duration calculus formulae in timed frames. (English summary) Fund. Inform. 36 (1998), no. 2-3, 235-263.  ...  Timed frames are essentially transition systems meant for modeling the time-dependent behaviour of programs. We investigate the in- terpretation of duration calculus formulae in timed frames.  ... 

Completeness and Decidability of a Fragment of Duration Calculus with Iteration [chapter]

Dang Van Hung, Dimitar P. Guelev
1999 Lecture Notes in Computer Science  
In this paper, we study a subset of DC formulas consisting of so-called simple ones which corresponds precisely with the class of Timed Automata.  ...  Duration Calculus with Iteration (DC ) has been used as an interface between original Duration Calculus and Timed Automata, but has not been studied rigorously.  ...  In that paper, we introduced a class of so-called simple Duration Calculus formulas with iterations which corresponds precisely with the class of real-time automata to express the design of real-time hybrid  ... 
doi:10.1007/3-540-46674-6_13 fatcat:ovsnccnni5hnbmuwua3wx64lzq

Modeling Eating Disorders of Cognitive Impaired People [chapter]

Antonio Coronato, Giuseppe De Pietro, Juan Carlos Augusto
2012 Lecture Notes in Electrical Engineering  
The proposed approach relies on the application of Ambient Intelligence (AmI) technologies and a new method for the detection of abnormal human behaviors in a controlled environment.  ...  Unfortunately, eating disorders have also the highest mortality rate of any mental illness, upwards of 20%.  ...  Analogously, γ − F (x,a,S) is a first-order formula that makes the F's truth value changing to false.  ... 
doi:10.1007/978-94-007-5086-9_22 fatcat:qtp5smilefc5fgt6adwy5u24oy

Actions with Duration and Constraints: The Ramification Problem in Temporal Databases

Nikos Papadakis, Dimitris Plexousakis
2003 International journal on artificial intelligence tools  
In this paper, we address the ramification problem based on causal relationships that take time into account. We study the problem for both instantaneous actions and actions with duration.  ...  The area of temporal databases in particular is still lacking satisfactory solutions to the ramification problem.  ...  Further research includes the study of the problem for concurrent actions with duration and non-deterministic actions, as well as the problem of changing time granularities.  ... 
doi:10.1142/s0218213003001265 fatcat:cozmb35axreotnat34imz6f55u

Event calculus and temporal action logics compared

Erik T. Mueller
2006 Artificial Intelligence  
We prove that, if the formalisms are restricted to integer time, inertial fluents, and relational fluents, and if TAL action type specifications are restricted to definite reassignment of a single fluent  ...  Event calculus Event calculus planner [39] http://www.iis.ee.ic.ac.uk/~mpsha/planners.html Discrete Event Calculus Reasoner [28] http://decreasoner.sourceforge.net/ TAL VITAL [20] http://www.ida.liu.se  ...  Within the duration of the event occurrence, the fluent is of indeterminate truth value in TALA, whereas in ECB a fluent that is true persists in each model because of the frame axiom ECB5.  ... 
doi:10.1016/j.artint.2006.05.001 fatcat:rji6l7lnqjea3jrvtchqad4gke

Logical Interpolation and Projection onto State in the Duration Calculus

Dimitar P. Guelev
2004 Journal of Applied Non-Classical Logics  
. ; (ϕ n−1 ; ϕ n ) . . .) ϕ 0 ⇀ ↽ ℓ = 0, ϕ k+1 ⇀ ↽ (ϕ; ϕ k ) Abstract Time Duration Calculus The Duration Calculus was first introduced for the case of real time in [ZHR91] .  ...  The kind of flexible non-logical symbols that we use to specify the above parts of time domains are Duration Calculus (DC, [ZHR91] ) state variables.  ... 
doi:10.3166/jancl.14.181-208 fatcat:2ycpmouuinexzphnifcbmnelv4

Chapter 16 Situation Calculus [chapter]

Fangzhen Lin
2008 Foundations of Artificial Intelligence  
According to McCarthy and Hayes [29], a situation is "the complete state of the universe at an instance of time".  ...  To describe a dynamic domain in the situation calculus, one has to decide on the set of actions available for the agents to perform, and the set of fluents needed to describe the changes these actions  ...  Acknowledgements I would like to thank Gerhard Lakemeyer, Hector Levesque, and Abhaya Nayak for their very useful comments on an earlier version of this article. Bibliography [1] F. Bacchus and F.  ... 
doi:10.1016/s1574-6526(07)03016-7 fatcat:yfql45p7ovfftol6x365mtrdyy

On the completeness and decidability of duration calculus with iteration

Dimitar P. Guelev, Dang Van Hung
2005 Theoretical Computer Science  
The extension of the duration calculus (DC) by iteration, which is also known as Kleene star, enables the straightforward specification of repetitive behaviour in DC and facilitates the translation of  ...  design descriptions between DC, timed regular expressions and timed automata.  ...  . (10) In this section, we discuss the decidability of the satisfiability of simple DC * formulas at the real-time frame, i.e. the frame in which the time domain is R, and the duration domain is R + ,  ... 
doi:10.1016/j.tcs.2005.01.017 fatcat:3qwvp3rcundordgsv2pizonbmu

Page 6243 of Mathematical Reviews Vol. , Issue 96j [page]

1996 Mathematical Reviews  
In a complicated syntax, terms (denoting posi- tive real numbers as durations) and temporal formulas (involving time bounds for the temporal operators) are built up simultane- ously.  ...  For the semantics the authors assume the “finite variability condition”: Within a bounded time interval the truth value of a predicate may change only finitely often.  ... 

Some Alternative Formulations of the Event Calculus [chapter]

Rob Miller, Murray Shanahan
2002 Lecture Notes in Computer Science  
In this paper we summarise how variants of the Event Calculus may be expressed as classical logic axiomatisations, and how under certain circumstances these theories may be reformulated as "action description  ...  The Event Calculus is a narrative based formalism for reasoning about actions and change originally proposed in logic programming form by Kowalski and Sergot.  ...  and Actions with Duration The Event Calculus can be modified in various ways so that actions can be represented as occurring over intervals of time.  ... 
doi:10.1007/3-540-45632-5_17 fatcat:vjndgn545bdvraunnw3lf2josa

The Situation Calculus: A Case for Modal Logic

Gerhard Lakemeyer
2010 Journal of Logic, Language and Information  
In this paper we will review the basics of Reiter's version of the situation calculus, show how knowledge and time have been addressed in this framework, and point to some of the weaknesses of the situation  ...  calculus with respect to time.  ...  Acknowledgements This paper owes much if not all to my long-time collaborator Hector Levesque. It was him who had the initial idea to turn Reiter's situation calculus into the modal logic ES.  ... 
doi:10.1007/s10849-009-9117-6 fatcat:n3pnfnve6beqpkouqywfxpwfkm

The Event Calculus Explained [chapter]

Murray Shanahan
1999 Lecture Notes in Computer Science  
A circumscriptive solution to the frame problem is deployed which reduces to monotonic predicate completion.  ...  The event calculus makes such assumptions by default.  ...  Thanks to all those members of the reasoning about action community whose work has influenced the development of the event calculus.  ... 
doi:10.1007/3-540-48317-9_17 fatcat:qbytqk62ejdhziozcjlbvgqbpu

Two-sorted metric temporal logics

Angelo Montanaria, Maarten de Rijkeb
1997 Theoretical Computer Science  
We view metric temporal logics as two-sorted formalisms having formulae ranging over time instants and parameters ranging over an (ordered) abelian group of temporal displacements.  ...  This is overcome by metric temporal logics which offer a uniform logical framework in which both qualitative and quantitative timing properties can be expressed by making use of a parameterized operator  ...  Next, truth of temporal formulae is defined by !  ... 
doi:10.1016/s0304-3975(96)00324-6 fatcat:jtog442npvft7d773fmcjvjnjy

A general first-order solution to the ramification problem with cycles

Hannes Strass, Michael Thielscher
2013 Journal of Applied Logic  
For the first time, we present a solution that: (1) is independent of a particular time structure, (2) is formulated in classical first-order logic, (3) treats cycles -a notoriously difficult aspect -properly  ...  Afterwards, we show how to compile a class of indirect effect laws into first-order effect axioms that then solve the ramification and frame problems.  ...  The second author is the recipient of an ARC Future Fellowship (project number FT 0991348). He is also affiliated with the University of Western Sydney.  ... 
doi:10.1016/j.jal.2013.05.003 fatcat:4bw4fbnhqnbbhkdh7zbvfwy7sm

On the relation between situation calculus and event calculus

Kristof Van Belleghem, Marc Denecker, Danny De Schreye
1997 The Journal of Logic Programming  
In this new calculus we define a natural and clear relation between situations and time points, which differs from those used in previous comparisons.  ...  We illustrate the inability of Event Calculus to handle counterfactual reasoning problems, and that of Situation Calculus to deal with counterfactual statements in the presence of actions with nondeterministic  ...  This completes the proof that the predicate holds'/2 defined by the Situation Calculus frame axiom coincides with holds_in~2 defined in terms of the holds predicate for time points in our new calculus.  ... 
doi:10.1016/s0743-1066(96)00123-9 fatcat:4ajtzirnmvdxfb7fnri5r6lvp4
« Previous Showing results 1 — 15 out of 2,490 results