Analyzing Flexible Timeline-based Plans (Contributo in atti di convegno)

Type
Label
  • Analyzing Flexible Timeline-based Plans (Contributo in atti di convegno) (literal)
Anno
  • 2010-01-01T00:00:00+01:00 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi
  • 10.3233/978-1-60750-606-5-471 (literal)
Alternative label
  • Cesta, A., Finzi, A., Fratini, S., Orlandini, A., Tronci, E. (2010)
    Analyzing Flexible Timeline-based Plans
    in ECAI 2010 - 19th European Conference on Artificial Intelligence, Lisbon, Portugal
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • Cesta, A., Finzi, A., Fratini, S., Orlandini, A., Tronci, E. (literal)
Pagina inizio
  • 471 (literal)
Pagina fine
  • 476 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#url
  • http://www.booksonline.iospress.nl/Content/View.aspx?piid=17794 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#titoloVolume
  • ECAI 2010 - 19th European Conference on Artificial Intelligence (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#volumeInCollana
  • 215 (literal)
Note
  • Scopus (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
  • Cesta, A., Fratini, S., Orlandini, A. - CNR, Italian National Research Council, ISTC, Rome, Italy Finzi, A. - DSF \"Federico II\" University, Italy Tronci, E. -DI \"La Sapienza\" University, Italy (literal)
Titolo
  • Analyzing Flexible Timeline-based Plans (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#isbn
  • 978-1-60750-605-8 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#curatoriVolume
  • Helder Coelho; Rudi Studer; Michael Wooldridge (literal)
Abstract
  • Timeline-based planners have been shown quite successful in addressing real world problems. Nevertheless they are considered as a niche technology in AI P&S research as an application synthesis with such techniques is still considered a sort of \"black art\". Authors are currently developing a knowledge engineering tool around a timeline-based problem solving environment; in this framework we aim at integrating verification and validation methods. This work presents a verification process suitable for a timeline-based planner. It shows how a problem of flexible temporal plan verification can be cast as model-checking on timed game automata. Additionally it provides formal properties and checks the effectiveness of the proposed approach with a detailed experimental analysis. (literal)
Prodotto di
Autore CNR
Insieme di parole chiave

Incoming links:


Autore CNR di
Prodotto
Insieme di parole chiave di
data.CNR.it