Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/6440Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Valdes-Perez, Raul E. | - |
| dc.date | 2004-10-04T14:56:24Z | - |
| dc.date | 2004-10-04T14:56:24Z | - |
| dc.date | 1986-05-01 | - |
| dc.date.accessioned | 2013-10-09T02:45:27Z | - |
| dc.date.available | 2013-10-09T02:45:27Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier | AIM-875 | - |
| dc.identifier | http://hdl.handle.net/1721.1/6440 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | Time and space are sufficiently similar to warrant in certain cases a common representation in AI problem-solving systems. What is represented is often the constraints that hold between objects, and a concern is the overall consistency of a set of constraints. This paper scrutinizes two current approaches to spatio-temporal reasoning. The suitableness of Allen's temporal algebra for constraint networks is influenced directly by the mathematical properties of the algebra. These properties are extracted by a formulation as a network of set-theoretic relations, such that some previous theorems due to Montanari apply. Some new theorems concerning consistency of these temporal constraint networks are also presented. | - |
| dc.format | 5237058 bytes | - |
| dc.format | 1970537 bytes | - |
| dc.format | application/postscript | - |
| dc.format | application/pdf | - |
| dc.language | en_US | - |
| dc.relation | AIM-875 | - |
| dc.title | Spatio-Temporal Reasoning and Linear Inequalities | - |
| Appears in Collections: | MIT Items | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.