retrieving and matching rdf graphs by solving the satisfiability problem

	retrieving and matching rdf graphs by solving the satisfiability problem
	Liu Sheng; Zhang Jian
	2007
会议名称	2006 IEEE/WIC/ACM International Conference on Web Intelligence, WI06
会议录名称	Proceedings - 2006 IEEE/WIC/ACM International Conference on Web Intelligence (WI 2006 Main Conference Proceedings), WI06
页码	510-513
会议日期	40878
会议地点	Hong Kong, China
收录类别	EI
出版地	United States
ISBN	769527477
部门归属	(1) Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China; (2) Graduate University, Chinese Academy of Sciences, Beijing 100049, 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 RDF graphs a
关键词	Information Retrieval Problem Solving Semantic Web
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/10990
专题	基础软件与系统重点实验室
推荐引用方式 GB/T 7714	Liu Sheng,Zhang Jian. retrieving and matching rdf graphs by solving the satisfiability problem[C]. United States,2007:510-513.