Temporal constraint satisfaction in matrix method

Zhang, C; Zhang, S; Zhang, Z

Temporal constraint satisfaction in matrix method

Zhang, C

Zhang, S Zhang, Z

Permalink

Publication Type:: Journal Article
Citation:: Applied Artificial Intelligence, 2003, 17 (2), pp. 135 - 154
Issue Date:: 2003-02-01

Closed Access

	Filename	Description	Size
	2003000490.pdf		186.88 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Zhang, C https://orcid.org/0000-0001-5715-7154	en_US
dc.contributor.author	Zhang, S	en_US
dc.contributor.author	Zhang, Z	en_US
dc.date.issued	2003-02-01	en_US
dc.identifier.citation	Applied Artificial Intelligence, 2003, 17 (2), pp. 135 - 154	en_US
dc.identifier.issn	0883-9514	en_US
dc.identifier.uri	http://hdl.handle.net/10453/4059
dc.description.abstract	Constraint satisfaction is a challenging problem in Interval Algebra (IA). So there are many efforts to attack this problem. After building a matrix method to deal with temporal reasoning problems, we develop basic techniques for applying the matrix method to constraint satisfaction in this paper. Thus, the propagating rules and the algorithms of 3- and path-consistency are studied. If our matrix method is used, then the temporal constraint satisfaction problem can be transformed into a problem that can be effectively solved. © 2003 Taylor and Francis Group, LLC.	en_US
dc.relation	http://purl.org/au-research/grants/arc/DP0343109
dc.relation.ispartof	Applied Artificial Intelligence	en_US
dc.relation.isbasedon	10.1080/713827103	en_US
dc.subject.classification	Artificial Intelligence & Image Processing	en_US
dc.title	Temporal constraint satisfaction in matrix method	en_US
dc.type	Journal Article
utslib.citation.volume	2	en_US
utslib.citation.volume	17	en_US
utslib.for	080101 Adaptive Agents and Intelligent Robotics	en_US
utslib.for	080109 Pattern Recognition and Data Mining	en_US
utslib.for	0801 Artificial Intelligence and Image Processing	en_US
utslib.for	1702 Cognitive Sciences	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/DVC (International)
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Strength - ACRI - Australia China Relations Institute
pubs.organisational-group	/University of Technology Sydney/Strength - CAI - Centre for Artificial Intelligence
utslib.copyright.status	closed_access
pubs.issue	2	en_US
pubs.publication-status	Published	en_US
pubs.volume	17	en_US

Abstract:

Constraint satisfaction is a challenging problem in Interval Algebra (IA). So there are many efforts to attack this problem. After building a matrix method to deal with temporal reasoning problems, we develop basic techniques for applying the matrix method to constraint satisfaction in this paper. Thus, the propagating rules and the algorithms of 3- and path-consistency are studied. If our matrix method is used, then the temporal constraint satisfaction problem can be transformed into a problem that can be effectively solved. © 2003 Taylor and Francis Group, LLC.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/4059