<?xml version="1.0"?>

<!DOCTYPE owl [
	<!ENTITY rdf "http://www.w3.org/1999/02/22-rdf-syntax-ns#">
	<!ENTITY rdfs "http://www.w3.org/2000/01/rdf-schema#">
	<!ENTITY xsd "http://www.w3.org/2001/XMLSchema#">
	<!ENTITY owl "http://www.w3.org/2002/07/owl#">
	<!ENTITY cc "http://web.resource.org/cc/#">
	<!ENTITY project "http://ebiquity.umbc.edu/ontology/project.owl#">
	<!ENTITY person "http://ebiquity.umbc.edu/ontology/person.owl#">
	<!ENTITY pub "http://ebiquity.umbc.edu/ontology/publication.owl#">
	<!ENTITY assert "http://ebiquity.umbc.edu/ontology/assertion.owl#">
]>

<!--

This ontology document is licensed under the Creative Commons
Attribution License. To view a copy of this license, visit
http://creativecommons.org/licenses/by/2.0/ or send a letter to
Creative Commons, 559 Nathan Abbott Way, Stanford, California
94305, USA.

-->

<rdf:RDF 
		xmlns:rdf = "&rdf;"
		xmlns:rdfs = "&rdfs;"
		xmlns:xsd = "&xsd;"
		xmlns:owl = "&owl;"
		xmlns:cc = "&cc;"
		xmlns:project = "&project;"
		xmlns:person = "&person;"
		xmlns:pub = "&pub;"
		xmlns:assert = "&assert;">
	<pub:InProceedings rdf:about="http://ebiquity.umbc.edu/paper/html/id/472/Problem-Space-Analysis-for-Plan-Library-Generation-and-Algorithm-Selection-in-Real-time-Systems">
		<rdfs:label><![CDATA[Problem Space Analysis for Plan Library Generation and Algorithm Selection in  Real-time Systems]]></rdfs:label>
		<pub:title><![CDATA[Problem Space Analysis for Plan Library Generation and Algorithm Selection in  Real-time Systems]]></pub:title>
		<pub:publishedOn rdf:datatype="&xsd;dateTime">2010-05-19T00:00:00-05:00</pub:publishedOn>
		<pub:abstract><![CDATA[Computing solutions to intractable planning problems is particularly problematic within real-time domains. One approach to this problem includes off-line computation of contingency plans. However, because complex domains preclude creating a comprehensive library, a system must choose a subset of all possible plans to include. Strategic selections will ensure that the library contains an appropriate plan for encountered situations.  This work discusses preliminary investigations into a scheme in which problem space analysis drives the creation of an efﬁcient plan library. For complex problems, an exact analysis of the problem space is not feasible, and an efﬁcient means of creating an approximate analysis is required. Thus, this work proposes the development of algorithms to efﬁciently generate and leverage the problem space analysis of complex planning problems.]]></pub:abstract>
		<pub:counter>1990</pub:counter>
		<pub:tag><![CDATA[planning]]></pub:tag>
		<pub:booktitle><![CDATA[Proceedings of The 23rd International FLAIRS  Conference ]]></pub:booktitle>
		<pub:publisher><![CDATA[AAAI Press]]></pub:publisher>
		<pub:author>
			<rdf:List>
				<rdf:first>
					<person:Person rdf:about="http://ebiquity.umbc.edu/person/html/Robert/Holder"><person:name><![CDATA[Robert Holder]]></person:name><rdfs:label><![CDATA[Robert Holder]]></rdfs:label></person:Person>
				</rdf:first>
				<rdf:rest rdf:resource="&rdf;nil" />
			</rdf:List>
		</pub:author>
		<pub:firstAuthor>
<person:Person rdf:about="http://ebiquity.umbc.edu/person/html/Robert/Holder"><person:name><![CDATA[Robert Holder]]></person:name><rdfs:label><![CDATA[Robert Holder]]></rdfs:label></person:Person>
		</pub:firstAuthor>
		<pub:softCopy><pub:SoftCopy>
			<pub:softCopyFormat><![CDATA[PDF Document]]></pub:softCopyFormat>
			<pub:softCopyURI><![CDATA[http://ebiquity.umbc.edu/get/a/publication/476.pdf]]></pub:softCopyURI>
			<pub:softCopySize>71832</pub:softCopySize>
			</pub:SoftCopy>
			</pub:softCopy>
	</pub:InProceedings>

<rdf:Description rdf:about="">
	<cc:License rdf:resource="http://creativecommons.org/licenses/by/2.0/" />
</rdf:Description>

</rdf:RDF>
