retrieving and matching rdf graphs by solving the satisfiability     problem*

	retrieving and matching rdf graphs by solving the satisfiability problem*
	Liu Sheng; Zhang Jian
	2006
会议名称	IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT 2006)
页码	510-513
会议日期	DEC 18-22,
会议地点	Hong Kong, PEOPLES R CHINA
出版地	10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
出版者	2006 IEEE/WIC/ACM International Conference on Web Intelligence, (WI 2006 Main Conference Proceedings)
ISBN	978-0-7695-2747-5
部门归属	Chinese Acad Sci, Comp Sci Lab, Inst Software, Beijing 100080, Peoples R China.
摘要	The Resource Description Framework (RDF) has been accepted as a standard for semantic representation of resources. Efficient methods and tools are needed to solve problems emerging from RDF based systems, for example, checking equality of two
主办者	IEEE, WIC, ACM
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/12246
专题	基础软件与系统重点实验室
推荐引用方式 GB/T 7714	Liu Sheng,Zhang Jian. retrieving and matching rdf graphs by solving the satisfiability problem*[C]. 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA:2006 IEEE/WIC/ACM International Conference on Web Intelligence, (WI 2006 Main Conference Proceedings),2006:510-513.