Paper Info
Title
A planning problem validator based on reachability analysis.
Abstract
AI planning is the field that focuses on creating abstract representations of various processes. As such, it is obvious that it is a broad field and demands specialized tools to be used in order to ease the process of designing domains and problems. The literature shows that most of these tools do not offer an option to re-examine and validate the result of the aforementioned designing process. This work presents a novel approach to validating a description of a problem as well as presenting information related to this validation process in an efficient way. It introduces a proxy web service that implements the process of finding invalid descriptions as well as the extension of the relevant tool VLEPpO, that suited the needs of the visualization process.
Year
DOI
Venue
2016
10.1145/2903220.2903237
SETN
Keywords
Field
DocType
validation, planning, visualization, knowledge engineering, artificial intelligence, web service, scheduling
Data mining,Computer science,Visualization,Scheduling (computing),Reachability,Knowledge engineering,Artificial intelligence,Web service,Automated planning and scheduling,Machine learning,Information and Computer Science,Validator
Conference
Citations 
PageRank 
References 
0
0.34
1
Authors
3
Name
Order
Citations
PageRank
Moses Symeonidis100.34
Dimitris Giouroukis200.68
Dimitris Vrakas325123.98