scientific article; zbMATH DE number 2079763

zbMATH Open1043.68716MaRDI QIDQ4471845FDOQ4471845

Authors: Fabiano Silva, Marcos Alexandre Castilho, Luis Allan Künzle 

Publication date: 30 July 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/1952/19520086.htm

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 2243415
• Fast planning through planning graph analysis
• The complexity of planning problems with simple causal graphs
• Action planning for directed model checking of Petri nets
• Petri net representation and reachability analysis of 0--1 integer linear programming problems

zbMATH Keywords

ReachabilityPetri NetsInteger ProgrammingAI Planning

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Integer programming (90C10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (8)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Planning with independent task networks
• Title not available (Why is that?)
• Mathematical programming approach to the Petri nets reachability problem
• Action planning for directed model checking of Petri nets
• AI 2005: Advances in Artificial Intelligence
• Title not available (Why is that?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4471845)