dc.contributor.author | Rintanen, Jussi | |
dc.contributor.editor | Satinder Singh, Shaul Markovitch | |
dc.date.accessioned | 2017-12-04T03:25:54Z | |
dc.date.available | 2017-12-04T03:25:54Z | |
dc.date.issued | 2017 | |
dc.identifier.uri | http://hdl.handle.net/10072/355071 | |
dc.description.abstract | Computation of invariants, which are approximate reachability information for state-space search problems such as AI planning, has been considered to be more scalable when using a schematic representation of actions/events rather than an instantiated/ground representation. A disadvantage of schematic algorithms, however, is their complexity, which also leads to high runtimes when the number of schematic events/actions is high. We propose algorithms that reduce the problem of finding schematic invariants to solving a smaller ground problem. | |
dc.description.peerreviewed | Yes | |
dc.language | English | |
dc.publisher | Association for the Advancement of Artificial Intelligence (AAAI) | |
dc.publisher.place | United States | |
dc.publisher.uri | https://aaai.org/Conferences/AAAI/aaai17.php | |
dc.relation.ispartofconferencename | AAAI-17 | |
dc.relation.ispartofconferencetitle | Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence | |
dc.relation.ispartofdatefrom | 2017-02-04 | |
dc.relation.ispartofdateto | 2017-02-09 | |
dc.relation.ispartoflocation | San Francisco, United States | |
dc.subject.fieldofresearch | Artificial Intelligence and Image Processing not elsewhere classified | |
dc.subject.fieldofresearchcode | 080199 | |
dc.title | Schematic invariants by reduction to ground invariants | |
dc.type | Conference output | |
dc.type.description | E1 - Conferences | |
dc.type.code | E - Conference Publications | |
gro.faculty | Griffith Sciences, School of Information and Communication Technology | |
gro.hasfulltext | No Full Text | |
gro.griffith.author | Rintanen, Jussi | |