Para acceder a los documentos con el texto completo, por favor, siga el siguiente enlace: http://hdl.handle.net/10230/36508
dc.contributor.author | Vidal, Vincent |
---|---|
dc.contributor.author | Geffner, Héctor |
dc.date | 2006 |
dc.identifier.citation | Vidal V, Geffner H. Branching and pruning: an optimal temporal POCL planner based on constraint programming. Artif Intell. 2006 Mar;170(3):298-335. DOI: 10.1016/j.artint.2005.08.004 |
dc.identifier.citation | 0004-3702 |
dc.identifier.citation | http://dx.doi.org/10.1016/j.artint.2005.08.004 |
dc.identifier.uri | http://hdl.handle.net/10230/36508 |
dc.format | application/pdf |
dc.language.iso | eng |
dc.publisher | Elsevier |
dc.relation | Artificial Intelligence. 2006 Mar;170(3):298-335. |
dc.relation | info:eu-repo/grantAgreement/ES/1PN/TIC2002-04470-C03-02 |
dc.rights | info:eu-repo/semantics/openAccess |
dc.rights | © Elsevier http://dx.doi.org/10.1016/j.artint.2005.08.004 |
dc.subject | Planning |
dc.subject | Constraint programming |
dc.subject | Temporal reasoning |
dc.title | Branching and pruning: an optimal temporal POCL planner based on constraint programming |
dc.type | info:eu-repo/semantics/article |
dc.type | info:eu-repo/semantics/acceptedVersion |
dc.description.abstract | |
dc.description.abstract |