Results 1 - 10
of
741
Guiding Clausal Temporal Resolution
- IN PROCEEDINGS THE SECOND INTERNATIONAL CONFERENCE ON TEMPORAL LOGIC (ICTL
, 1999
"... The effective mechanisation of temporal logic is vital to the application of temporal reasoning in many fields, for example the verification of reactive systems, the implementation of temporal query languages, and temporal logic programming. Consequently, a variety of proof methods have been develop ..."
Abstract
-
Cited by 7 (4 self)
- Add to MetaCart
relevant non-temporal resolution steps have been carried out. It is this restriction that we consider in this paper, where we introduce, justify and apply a new temporal resolution rule. This rule, which may be seen as a generalisation of the existing temporal resolution rule, can be applied at any time
A Graph-Based Approach To Resolution In Temporal Logic
- In Temporal Logic, First International Conference, ICTL '94, Proceedings
, 1994
"... . In this paper, we present algorithms developed in order to implement a clausal resolution method for discrete, linear temporal logics, presented in [Fis91]. As part of this method, temporal formulae are rewritten into a normal form and both `non-temporal' and `temporal' inference rules a ..."
Abstract
-
Cited by 5 (3 self)
- Add to MetaCart
as little of the graph as possible. These algorithms have been implemented and have been combined with sub-programs performing translation to normal form and non-temporal resolution to produce an integrated resolution based temporal theorem-prover. 1 Introduction Although resolution has been widely used
A Resolution Method for Temporal Logic
- In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence (IJCAI
, 1991
"... In this paper, a resolution method for propositional temporal logic is presented. Temporal formulae, incorporating both past-time and future-time temporal operators, are converted to Separated Normal Form (SNF), then both non-temporal and temporal resolution rules are applied. The resolution method ..."
Abstract
-
Cited by 83 (25 self)
- Add to MetaCart
In this paper, a resolution method for propositional temporal logic is presented. Temporal formulae, incorporating both past-time and future-time temporal operators, are converted to Separated Normal Form (SNF), then both non-temporal and temporal resolution rules are applied. The resolution method
Temporal Resolution of Uncertainty and Recursive Non-Expected Utility Models
- ECONOMETRICA
, 2000
"... ..."
Spherical Matching for Temporal Correspondence of Non-Rigid Surfaces
"... This paper introduces spherical matching to estimate dense temporal correspondence of non-rigid surfaces with genus-zero topology. The spherical domain gives a consistent 2D parameterisation of non-rigid surfaces for matching. Non-rigid 3D surface correspondence is formulated as the recovery of a bi ..."
Abstract
- Add to MetaCart
This paper introduces spherical matching to estimate dense temporal correspondence of non-rigid surfaces with genus-zero topology. The spherical domain gives a consistent 2D parameterisation of non-rigid surfaces for matching. Non-rigid 3D surface correspondence is formulated as the recovery of a
Spatio-Temporal Stereo using Multi-Resolution Subdivision Surfaces
, 2002
"... We present a method to automatically extract spatio-temporal descriptions of moving objects from synchronized and calibrated multi-view sequences. The object is modeled by a time-varying multi-resolution subdivision surface that is fitted to the image data using spatio-temporal multi-view stereo inf ..."
Abstract
-
Cited by 43 (3 self)
- Add to MetaCart
We present a method to automatically extract spatio-temporal descriptions of moving objects from synchronized and calibrated multi-view sequences. The object is modeled by a time-varying multi-resolution subdivision surface that is fitted to the image data using spatio-temporal multi-view stereo
Parallel Temporal Resolution
, 1995
"... Temporal reasoning is complex. Typically, the proof methods used for temporal logics are both slow and, due to the quantity of information required, consume a large amount of space. The introduction of parallelism provides the potential for significant speedups together with the increased memory siz ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
size required to handle larger proofs. Thus, we see the effective utilisation of parallelism as being crucial in making temporal theorem-proving practical. In this paper we investigate and analyse opportunities for parallelism within a clausal resolution method for temporal logics. We show how
Functional anatomy of high-resolution visual mental imagery
- J. Cogn. Neurosci
"... • This study had two purposes. First, in order to address the controversy regarding activation of the primary visual area (PVA) during visual mental imagery, regional cerebral blood flow (rCBF) was recorded while subjects performed a task tha t required high-resolution visual mental imagery. Second, ..."
Abstract
-
Cited by 39 (5 self)
- Add to MetaCart
• This study had two purposes. First, in order to address the controversy regarding activation of the primary visual area (PVA) during visual mental imagery, regional cerebral blood flow (rCBF) was recorded while subjects performed a task tha t required high-resolution visual mental imagery. Second
Bayesian State-Space Modelling of Spatio-Temporal Non-Gaussian Radar Returns
, 1998
"... ly reported work on target detection in coherent radar systems, a complex autoregressive process is proposed as the basis for characterisation of high resolution sea clutter spectra in incoherent radar systems. As no phase information is available in incoherent radar returns, the Gibbs sampler is us ..."
Abstract
-
Cited by 9 (0 self)
- Add to MetaCart
population of scattering centres on an ocean surface, a conditional heteroscedastic (i.e. non-constant prediction error variance) model is proposed for the modulating component of high resolution sea clutter in the logarithm domain. However, based on the results obtained for a large database of sea clutter
unknown title
"... In this paper, a resolution method for propositional temporal logic is presented. Temporal formulae, incorporating both past-time and future-time temporal operators, are converted to Separated Normal Form (SNF), then both non-temporal and temporal resolution rules are applied. The resolution method ..."
Abstract
- Add to MetaCart
In this paper, a resolution method for propositional temporal logic is presented. Temporal formulae, incorporating both past-time and future-time temporal operators, are converted to Separated Normal Form (SNF), then both non-temporal and temporal resolution rules are applied. The resolution method
Results 1 - 10
of
741