Idempotency in Optimality Theory

2017 ◽  
Vol 54 (1) ◽  
pp. 139-187 ◽  
Author(s):  
GIORGIO MAGRI
Keyword(s):  
Optimality Theory ◽  
Formal Analysis ◽  
Sufficient Conditions ◽  
Correspondence Theory ◽  
Theory Building ◽  
Formal Condition ◽  
Chain Shifts

Anidempotentphonological grammar maps phonotactically licit forms faithfully to themselves. This paper establishes tight sufficient conditions for idempotency in (classical) Optimality Theory. Building on Tesar (2013), these conditions are derived in two steps. First, idempotency is shown to follow from a general formal condition on the faithfulness constraints. Second, this condition is shown to hold for a variety of faithfulness constraints which naturally arise within McCarthy & Prince’s (1995) Correspondence Theory of faithfulness. This formal analysis provides an exhaustive toolkit for modelingchain shifts, which have proven recalcitrant to a constraint-based treatment.

scholarly journals Formal Analysis of SET and NSL Protocols Using the Interpretation Functions-Based Method

2012 ◽  
Vol 2012 ◽  
pp. 1-18 ◽  
Author(s):  
Hanane Houmani ◽  
Mohamed Mejri
Keyword(s):  
Communication Channel ◽  
Formal Analysis ◽  
Sufficient Conditions ◽  
Main Idea ◽  
The Internet ◽  
Cryptographic Protocol ◽  
Cryptographic Primitives ◽  
Algebraic Properties ◽  
Security Properties ◽  
Set Protocol

Most applications in the Internet such as e-banking and e-commerce use the SET and the NSL protocols to protect the communication channel between the client and the server. Then, it is crucial to ensure that these protocols respect some security properties such as confidentiality, authentication, and integrity. In this paper, we analyze the SET and the NSL protocols with respect to the confidentiality (secrecy) property. To perform this analysis, we use the interpretation functions-based method. The main idea behind the interpretation functions-based technique is to give sufficient conditions that allow to guarantee that a cryptographic protocol respects the secrecy property. The flexibility of the proposed conditions allows the verification of daily-life protocols such as SET and NSL. Also, this method could be used under different assumptions such as a variety of intruder abilities including algebraic properties of cryptographic primitives. The NSL protocol, for instance, is analyzed with and without the homomorphism property. We show also, using the SET protocol, the usefulness of this approach to correct weaknesses and problems discovered during the analysis.

How AI founders on adversarial landscapes of fog and friction

2020 ◽  
pp. 154851292096222
Author(s):  
Rodrick Wallace
Keyword(s):  
Resource Availability ◽  
Cognitive Process ◽  
Limit Theorems ◽  
Formal Analysis ◽  
Sufficient Conditions ◽  
Critical Systems ◽  
Material Resource ◽  
Full Spectrum ◽  
Internal Information

Formal analysis, based on the asymptotic limit theorems of control and information theories, uncovers sufficient conditions for punctuated failure across the full spectrum of real-time cognitive process – essentially a generalization of the Yerkes-Dodson law – challenging recent assertions that instabilities in AI deep learning paradigms can be easily remedied, permitting their use in real-world critical systems. A temperature analog for cognition that is itself an order parameter is determined by rates of internal information transmission, sensory or intelligence input, and material resource availability. Phase transitions driven by the synergisms of such parameters express symmetry-breaking changes in groupoids characteristic of cognition at and across scales and levels of organization, significantly extending models abducted from physical theory. No modifications of current – or future – AI or other cognitive systems can or will be immune to failure when facing sophisticated adversarial challenge under conditions of friction and the fog-of-war. We indicate how to reconfigure these results for study of long-term conflict on ‘Sun Zu Landscapes’ of deception, deceit, and subtle influence under Lamarckian selection.

Some Formal Implications of Deletion Saltation

2021 ◽  
pp. 1-22
Author(s):  
Jennifer L. Smith
Keyword(s):  
Optimality Theory ◽  
Empirical Work ◽  
Correspondence Theory ◽  
Harmonic Grammar ◽  
Binary Features ◽  
Weighted Constraint

Abstract In a phonological saltation alternation, a segment or class “skips” a relatively similar category to surface as something less similar, as when /ɡ/ alternates with [x], skipping [k]. White (2013) and Hayes and White (2015) argue that saltation is unnatural—difficult to learn in the laboratory and diachronically unstable. They propose that the phonological grammar includes a learning bias against such unnatural patterns. White and Hayes further demonstrate that Harmonic Grammar (HG; Legendre, Miyata, and Smolensky 1990) cannot model typical saltation without nondefault mechanisms that would require extra steps in acquisition, making HG consistent with their proposed learning bias. I identify deletion saltation as a distinct saltation subtype and show that HG, with faithfulness formalized in standard Correspondence Theory (CT; McCarthy and Prince 1995), can model this pattern. HG/CT thus predicts that deletion saltation, unlike typical (here called segment-scale) saltation, is natural. Other frameworks fail to distinguish the two saltation types—they can either model both types, or neither. Consequently, if future empirical work finds deletion saltation to be more natural than other saltation patterns, this would support weighted-constraint models such as HG over ranked-constraint models such as Optimality Theory (OT; Prince and Smolensky 1993, 2004); would support CT over the *MAP model of faithfulness (Zuraw 2013); and would support formalizing CT featural-faithfulness constraints in terms of IDENT constraints, binary features, or both.

scholarly journals Markedness in Urban East Norwegian tonal accent

2006 ◽  
Vol 29 (1) ◽  
pp. 95-135 ◽  
Author(s):  
Gjert Kristoffersen
Keyword(s):  
Optimality Theory ◽  
Formal Analysis ◽  
High Ranking

A new formal analysis of the tonal accent contrast in Urban East Norwegian (UEN) is developed in this paper, based on Optimality Theory. Contrary to the widespread assumption that the contrast is based on privativity, this paper represents a return to the position that the contrast derives from different timing of a common underlying melody. Surface privativity, i.e. the absence vs. the presence of an H that can be observed in the contrast between accent 1 and 2 in UEN is analysed as the result of marked (accent 1) vs. unmarked (accent 2) association of a common tonal input. The marked status of accent 1 follows from lexical pre-linking, protected by high-ranking faithfulness, which overrides (unmarked) association driven by the markedness constraints alone.

Derived Imperfective Tensing in Kurpian

2017 ◽  
Vol 53 (2) ◽  
Author(s):  
Jerzy Rubach
Keyword(s):  
Optimality Theory ◽  
Formal Analysis

AbstractThis article discusses phonological generalizations concerning derived imperfectives in Kurpian, a dialect of Polish spoken in northern Mazovia. It is argued that, unlike Standard Polish, Kurpian has a live process that turns lax vowels into tense vowels in derived imperfectives. DI Tensing interacts with other rules of Kurpian, leading, in some cases, to Duke of York derivations. The paper is based 100% on the original fieldwork. A formal analysis of the descriptive generalizations is conducted in the framework of Optimality Theory.

scholarly journals Model Checking Resiliency and Sustainability of In-Vehicle Network for Real-Time Authenticity

2021 ◽  
Vol 11 (3) ◽  
pp. 1068 ◽  
Author(s):  
Jin Hyun Kim ◽  
Hyo Jin Jo ◽  
Insup Lee
Keyword(s):  
Model Checking ◽  
Timed Automata ◽  
Formal Analysis ◽  
Sufficient Conditions ◽  
Third Party ◽  
Area Network ◽  
Message Authentication ◽  
Network Systems ◽  
Authentication Mechanism ◽  
Vehicle Network

The Controller Area Network (CAN) is the most common network system in automotive systems. However, the standardized design of a CAN protocol does not consider security issues, so it is vulnerable to various security attacks from internal and external electronic devices. Recently, in-vehicle network is often connected to external network systems, including the Internet, and can result in an unwarranted third-party application becoming an attack point. Message Authentication CAN (MAuth-CAN) is a new centralized authentication for CAN system, where two dual-CAN controllers are utilized to process message authentication. MAuth-CAN is designed to provide an authentication mechanism as well as provide resilience to a message flooding attack and sustainably protect against a bus-off attack. This paper presents formal techniques to guarantee critical timing properties of MAuth-CAN, based on model checking, which can be also used for safety certificates of vehicle components, such as ISO 26262. Using model checking, we prove sufficient conditions that MAuth-CAN is resilient and sustainable against message flooding and bus-off attacks and provide two formal models of MAuth-CAN in timed automata that are applicable for formal analysis of other applications running on CAN bus. In addition, we discuss that the results of model checking of those properties are consistent with the experiment results of MAuth-CAN implementation.

How the Future Has a Grip on Us

2018 ◽  
Vol 22 (2) ◽  
pp. 262-282
Author(s):  
Martin Sand ◽  
Keyword(s):  
Technology Assessment ◽  
Philosophy Of Technology ◽  
Correspondence Theory ◽  
Theory Building ◽  
Technological Systems ◽  
The Past ◽  
Correspondence Theory Of Truth ◽  
Inferential Knowledge ◽  
The Future ◽  
Future Theory

Being faced with bold statements about the technological future, the wickedness of technological systems and our frequent cluelessness when aiming at predicting the course of such systems, scholars from philosophy of technology and Technology Assessment (TA) have given up believing that any method can enhance our knowledge about the future. Hence, hermeneutic TA, forensics of wishing and other approaches shift their focus on the present of such futures. While these approaches are meaningful in their own right, they basically rest on a too sceptical foundation. In my article I will present some objections to these approaches. It is clearly true as has been pointed out that knowledge about the future cannot be tested to correspond with reality, since the future does not yet exist. However, it is debatable whether such a criterion is generally required for robust knowledge. Giving that we cannot observe the past but claim to know a lot about, I will argue that a commitment to the correspondence theory of truth is too strong a requirement for robust knowledge about the future. Theory building departs by inferring from present observations into both directions, future and past. To show this, some examples that illustrate how the future has a lock on us will be discussed. Furthermore, it will be outlined that the often cited notion of future’s openness also rests on such inferential knowledge, which indicates incoherence in the skeptics’ approach. These arguments build the basis for a modest realism about the future.

Sign in / Sign up

Export Citation Format

Share Document