Logic and Algorithms in Computational Linguistics 2021 (LACompLing2021) by Roussanka Loukanova & Peter LeFanu Lumsdaine & Reinhard Muskens

Logic and Algorithms in Computational Linguistics 2021 (LACompLing2021) by Roussanka Loukanova & Peter LeFanu Lumsdaine & Reinhard Muskens

Author:Roussanka Loukanova & Peter LeFanu Lumsdaine & Reinhard Muskens
Language: eng
Format: epub
ISBN: 9783031217807
Publisher: Springer International Publishing


2.3 Example of Input and Output

Before showing the input and output example, it is important to note that although the algorithm can inherently work for any proposition of promises, threats, tips, and warnings, it also has some other general requirements in practice. Since the binary logical propositions are all generated by randomly selecting one antecedent and one consequent, it is important to ensure that all the random combinations of an antecedent and a consequent make sense. Not any two atomic propositions can form a good proposition in which the connection between the antecedent and the consequent can be easily inferred through common sense. A bad example (in natural language) could be ‘If you drink this bottle of milk, I will book a ticket to Iceland.’ The connection between drinking milk and booking a ticket is hard to establish, thus making this sentence sound weird. To ensure that all the generated binary propositions make sense, a good practice is to limit the atomic propositions within some specific domain.

This domain of propositions in our example, is the communication between players in a strategic video game, in which promises, threats, tips, and warnings could often be made. Suppose we have three atomic propositions: 1. You destroy the bridge, 2. I will attack you and 3. Player C will attack you, in which the first one is antecedent and the latter two are consequents. Here, the first proposition is inherently neutral regarding desirability. The second and the third propositions are both undesirable for the hearer, and they differ in that the speaker has control in I will attack you, but lacks control in Player C will attack you. Together with two connectives and , four binary logical formulas can be generated: (3)

a.

You destroy the bridge I will attack you



Download



Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.