A Recursive Shortcut for CEGAR: Application To The Modal Logic K Satisfiability Problem - Université Côte d'Azur Access content directly
Conference Papers Year : 2017

A Recursive Shortcut for CEGAR: Application To The Modal Logic K Satisfiability Problem

No file

Dates and versions

hal-02271412 , version 1 (26-08-2019)

Identifiers

  • HAL Id : hal-02271412 , version 1

Cite

Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, Valentin Montmirail. A Recursive Shortcut for CEGAR: Application To The Modal Logic K Satisfiability Problem. Twenty-Sixth International Joint Conference on Artificial Intelligence, Aug 2017, Melbourne, Australia. pp.674-680. ⟨hal-02271412⟩
35 View
0 Download

Share

Gmail Facebook X LinkedIn More