A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs | Zendy

Krishnendu Chatterjee | Zendy; Martin Chmelík | Zendy; Jessica Davies | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs

Author(s) -

Krishnendu Chatterjee,

Martin Chmelík,

Jessica Davies

Publication year - 2016

Publication title -

proceedings of the aaai conference on artificial intelligence

Language(s) - English

Resource type - Journals

eISSN - 2374-3468

pISSN - 2159-5399

DOI - 10.1609/aaai.v30i1.10422

Subject(s) - reachability , computer science , scalability , solver , exptime , set (abstract data type) , probabilistic logic , markov decision process , reduction (mathematics) , reachability problem , exponential function , mathematical optimization , model checking , boolean satisfiability problem , theoretical computer science , algorithm , mathematics , computational complexity theory , artificial intelligence , markov process , pspace , mathematical analysis , statistics , geometry , database , programming language

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research