( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Planning in Nondeterministic Domains under Partial Observability via Symbolic Model Checking

, , , и . IJCAI, стр. 473--478. (2001)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Alessandro Valeri

Fluorescence resonance energy transfer between multiple chromophores studied by single-molecule spectroscopy. Uni Düsseldorf, (2009)

Alessandro Nova

Alessandro Zivelonghi

Alessandro Topa

Alessandro Mirizzi

 

Другие публикации лиц с тем же именем

Multiagent Reasoning with Belief Contexts II: Elaboration Tolerance., и . ICMAS, стр. 57-64. The MIT Press, (1995)Towards adaptive MILS System: Model- Based Design, Verification and Run-Time Adaptation: Slides., , , и . MILS@DSN, Zenodo, (2018)Computational reflection via mechanized logical deduction., и . Int. J. Intell. Syst., 11 (5): 279-293 (1996)NUSMV: A New Symbolic Model Checker., , , и . Int. J. Softw. Tools Technol. Transf., 2 (4): 410-425 (2000)Building Efficient Decision Procedures on Top of SAT Solvers., и . SFM, том 3965 из Lecture Notes in Computer Science, стр. 144-175. Springer, (2006)Efficient Satisfiability Modulo Theories via Delayed Theory Combination., , , , , , и . CAV, том 3576 из Lecture Notes in Computer Science, стр. 335-349. Springer, (2005)A Provably Correct Embedded Verifier for the Certification of Safety Critical Software., , , , , , , и . CAV, том 1254 из Lecture Notes in Computer Science, стр. 202-213. Springer, (1997)A Structured Approach to the Formal Certification of Safety of Computer Aided Development Tools., , , и . SAFECOMP, том 1516 из Lecture Notes in Computer Science, стр. 221-230. Springer, (1998)An Incremental and Layered Procedure for the Satisfiability of Linear Arithmetic Logic., , , , , , и . TACAS, том 3440 из Lecture Notes in Computer Science, стр. 317-333. Springer, (2005)Planning in Nondeterministic Domains under Partial Observability via Symbolic Model Checking., , , и . IJCAI, стр. 473-478. Morgan Kaufmann, (2001)