Partiality is a key challenge for computational approaches to artificial intelligence in general and natural language in particular. Various extensions of classical two-valued logic to many-valued logics have been investigated in order to meet this challenge. We use the proof assistant Isabelle to formalize the syntax and semantics of many-valued logics with determinate as well as indeterminate truth values. The formalization allows for a concise presentation and makes automated verification possible.
|Title of host publication||Partiality and Underspecification in Information, Languages, and Knowledge|
|Editors||Henning Christiansen, M. Dolores Jiménez-López, Roussanka Loukanova, Lawrence S. Moss|
|Publisher||Cambridge Scholars Press|
|Publication status||Published - 2017|