BDBComp
Parceria:
SBC
Usando Redes de Petri e Resolvedores ISCAS para Tratar Planejamento como Satisfatibilidade

Razer MontañoMarcos CastilhoFabiano SilvaLuis Künzle

This work presents an approach to solve classical planning problems in AI as a non-clausal satisfiability problem. An SAT instance in ISCAS format is generated by translating planning problem based in a Petri Net, in which submarking-reachability problem must be solved. So, the SAT instance is solved by well-known non-clausal SAT solvers.

http://www.lbd.dcc.ufmg.br/colecoes/enia/2011/0049.pdf

Caso o link acima esteja inválido, faça uma busca pelo texto completo na Web: Buscar na Web

Biblioteca Digital Brasileira de Computação - Contato: bdbcomp@lbd.dcc.ufmg.br
     Mantida por:
LBD