The Acquisition of Japanese as a Second Language and Processability Theory: A Longitudinal Study of a Naturalistic Child Learner

The aim of this study was to investigate longitudinally how a child learner acquired verbal morpho-syntax in Japanese in a naturalistic second language (L2) context. Specifically the points of emergence for three verbal morpho-syntactic structures, namely verbal inflection, the V-te V structure and the passive/causative structure, were investigated within a framework of Processability Theory (PT) (Pienemann, 1998b). The subsequent development of these structures was also examined. Unlike earlier research about morpheme orders and developmental sequences in language acquisition which was criticised because of its apparent lack of theoretical underpinnings, Pienemann’s Processability Theory (PT)(1998b) connects the processability of morpho-syntactic structure to linguistic theories. Pienemann also claims that this theory can be used to explain the acquisition of a wide range of morpho-syntactic structures and that it is typologically plausible and applicable to any language. In recent times PT has been extensively tested in a range of languages acquired as an L2, including German, English and Swedish (Pienemann, 1998b; Pienemann & Håkansson, 1999) and Italian and Japanese (Di Biase & Kawaguchi, 2002). The findings from these studies support this theory. Following the acquisition criteria proposed by Pienemann (1998b), the current study analyses the points of emergence of verbal morpho-syntactic structures by a seven year old Australian boy who was acquiring Japanese as a second language (JSL) naturalistically. Data were collected through audio taping approximately 90 minute interactions between the child and other Japanese speakers at each of the 26 sessions over a one-year and nine month period. The task-based elicitation method was used to create as spontaneous interaction as possible between the child and his interlocutors

An integer programming approach for the satisfiability problems.

by Lui Oi Lun Irene.Thesis (M.Phil.)--Chinese University of Hong Kong, 2001.Includes bibliographical references (leaves 128-132).Abstracts in English and Chinese.List of Figures --- p.viiList of Tables --- p.viiiChapter 1 --- Introduction --- p.1Chapter 1.1 --- Satisfiability Problem --- p.1Chapter 1.2 --- Motivation of the Research --- p.1Chapter 1.3 --- Overview of the Thesis --- p.2Chapter 2 --- Constraint Satisfaction Problem and Satisfiability Problem --- p.4Chapter 2.1 --- Constraint Programming --- p.4Chapter 2.2 --- Satisfiability Problem --- p.6Chapter 2.3 --- Methods in Solving SAT problem --- p.7Chapter 2.3.1 --- Davis-Putnam-Loveland Procedure --- p.7Chapter 2.3.2 --- SATZ by Chu-Min Li --- p.8Chapter 2.3.3 --- Local Search for SAT --- p.11Chapter 2.3.4 --- Integer Linear Programming Method for SAT --- p.12Chapter 2.3.5 --- Semidefinite Programming Method --- p.13Chapter 2.4 --- Softwares for SAT --- p.15Chapter 2.4.1 --- SAT01 --- p.15Chapter 2.4.2 --- "SATZ and SATZ213, contributed by Chu-Min Li" --- p.15Chapter 2.4.3 --- Others --- p.15Chapter 3 --- Integer Programming --- p.17Chapter 3.1 --- Introduction --- p.17Chapter 3.1.1 --- Formulation of IPs and BIPs --- p.18Chapter 3.1.2 --- Binary Search Tree --- p.19Chapter 3.2 --- Methods in Solving IP problem --- p.19Chapter 3.2.1 --- Branch-and-Bound Method --- p.20Chapter 3.2.2 --- Cutting-Plane Method --- p.23Chapter 3.2.3 --- Duality in Integer Programming --- p.26Chapter 3.2.4 --- Heuristic Algorithm --- p.28Chapter 3.3 --- Zero-one Optimization and Continuous Relaxation --- p.29Chapter 3.3.1 --- Introduction --- p.29Chapter 3.3.2 --- The Roof Dual expressed in terms of Lagrangian Relaxation --- p.30Chapter 3.3.3 --- Determining the Existence of a Duality Gap --- p.31Chapter 3.4 --- Software for solving Integer Programs --- p.33Chapter 4 --- Integer Programming Formulation for SAT Problem --- p.35Chapter 4.1 --- From 3-CNF SAT Clauses to Zero-One IP Constraints --- p.35Chapter 4.2 --- From m-Constrained IP Problem to Singly-Constrained IP Problem --- p.38Chapter 4.2.1 --- Example --- p.39Chapter 5 --- A Basic Branch-and-Bound Algorithm for the Zero-One Polynomial Maximization Problem --- p.42Chapter 5.1 --- Reason for choosing Branch-and-Bound Method --- p.42Chapter 5.2 --- Searching Algorithm --- p.43Chapter 5.2.1 --- Branch Rule --- p.44Chapter 5.2.2 --- Bounding Rule --- p.46Chapter 5.2.3 --- Fathoming Test --- p.46Chapter 5.2.4 --- Example --- p.47Chapter 6 --- Revised Bound Rule for Branch-and-Bound Algorithm --- p.55Chapter 6.1 --- Revised Bound Rule --- p.55Chapter 6.1.1 --- CPLEX --- p.57Chapter 6.2 --- Example --- p.57Chapter 6.3 --- Conclusion --- p.65Chapter 7 --- Revised Branch Rule for Branch-and-Bound Algorithm --- p.67Chapter 7.1 --- Revised Branch Rule --- p.67Chapter 7.2 --- Comparison between Branch Rule and Revised Branch Rule --- p.69Chapter 7.3 --- Example --- p.72Chapter 7.4 --- Conclusion --- p.73Chapter 8 --- Experimental Results and Analysis --- p.80Chapter 8.1 --- Experimental Results --- p.80Chapter 8.2 --- Statistical Analysis --- p.33Chapter 8.2.1 --- Analysis of Search Techniques --- p.83Chapter 8.2.2 --- Discussion of the Performance of SATZ --- p.85Chapter 9 --- Concluding Remarks --- p.87Chapter 9.1 --- Conclusion --- p.87Chapter 9.2 --- Suggestions for Future Research --- p.88Chapter A --- Searching Procedures for Solving Constraint Satisfaction Problem (CSP) --- p.91Chapter A.1 --- Notation --- p.91Chapter A.2 --- Procedures for Solving CSP --- p.92Chapter A.2.1 --- Generate and Test --- p.92Chapter A.2.2 --- Standard Backtracking --- p.93Chapter A.2.3 --- Forward Checking --- p.94Chapter A.2.4 --- Looking Ahead --- p.95Chapter B --- Complete Results for Experiments --- p.96Chapter B.1 --- Complete Result for SATZ --- p.96Chapter B.1.1 --- n =5 --- p.95Chapter B.1.2 --- n = 10 --- p.98Chapter B.1.3 --- n = 30 --- p.99Chapter B.2 --- Complete Result for Basic Branch-and-Bound Algorithm --- p.101Chapter B.2.1 --- n二5 --- p.101Chapter B.2.2 --- n = 10 --- p.104Chapter B.2.3 --- n = 30 --- p.107Chapter B.3 --- Complete Result for Revised Bound Rule --- p.109Chapter B.3.1 --- n = 5 --- p.109Chapter B.3.2 --- n = 10 --- p.112Chapter B.3.3 --- n = 30 --- p.115Chapter B.4 --- Complete Result for Revised Branch-and-Bound Algorithm --- p.118Chapter B.4.1 --- n = 5 --- p.118Chapter B.4.2 --- n = 10 --- p.121Chapter B.4.3 --- n = 30 --- p.124Bibliography --- p.12

Automated Reasoning

This volume, LNAI 13385, constitutes the refereed proceedings of the 11th International Joint Conference on Automated Reasoning, IJCAR 2022, held in Haifa, Israel, in August 2022. The 32 full research papers and 9 short papers presented together with two invited talks were carefully reviewed and selected from 85 submissions. The papers focus on the following topics: Satisfiability, SMT Solving,Arithmetic; Calculi and Orderings; Knowledge Representation and Jutsification; Choices, Invariance, Substitutions and Formalization; Modal Logics; Proofs System and Proofs Search; Evolution, Termination and Decision Prolems. This is an open access book

The Complexity of the Falsifiability Problem for Pure Implicational Formulas

We consider Boolean formulas where logical implication (->) is the only operator and all variables, except at most one (denoted z), occur at most twice. We show that the problem of determining falsifiability for formulas of this class is NP-complete but if the number of occurrences of z is restricted to be at most k then there is an O(|F|) algorithm for certifying falsifiability. We show this hierarchy of formulas, indexed on k, is interesting because even lower levels (e.g., k=2) are not subsumed by several well-known polynomial time solvable classes of formulas

Automated proof search in non-classical logics : efficient matrix proof methods for modal and intuitionistic logics

In this thesis we develop efficient methods for automated proof search within an important class of mathematical logics. The logics considered are the varying, cumulative and constant domain versions of the first-order modal logics K, K4, D, D4, T, S4 and S5, and first-order intuitionistic logic. The use of these non-classical logics is commonplace within Computing Science and Artificial Intelligence in applications in which efficient machine assisted proof search is essential. Traditional techniques for the design of efficient proof methods for classical logic prove to be of limited use in this context due to their dependence on properties of classical logic not shared by most of the logics under consideration. One major contribution of this thesis is to reformulate and abstract some of these classical techniques to facilitate their application to a wider class of mathematical logics. We begin with Bibel's Connection Calculus: a matrix proof method for classical logic comparable in efficiency with most machine orientated proof methods for that logic. We reformulate this method to support its decomposition into a collection of individual techniques for improving the efficiency of proof search within a standard cut-free sequent calculus for classical logic. Each technique is presented as a means of alleviating a particular form of redundancy manifest within sequent-based proof search. One important result that arises from this anaylsis is an appreciation of the role of unification as a tool for removing certain proof-theoretic complexities of specific sequent rules; in the case of classical logic: the interaction of the quantifier rules. All of the non-classical logics under consideration admit complete sequent calculi. We anaylse the search spaces induced by these sequent proof systems and apply the techniques identified previously to remove specific redundancies found therein. Significantly, our proof-theoretic analysis of the role of unification renders it useful even within the propositional fragments of modal and intuitionistic logic

Word Knowledge and Word Usage

Word storage and processing define a multi-factorial domain of scientific inquiry whose thorough investigation goes well beyond the boundaries of traditional disciplinary taxonomies, to require synergic integration of a wide range of methods, techniques and empirical and experimental findings. The present book intends to approach a few central issues concerning the organization, structure and functioning of the Mental Lexicon, by asking domain experts to look at common, central topics from complementary standpoints, and discuss the advantages of developing converging perspectives. The book will explore the connections between computational and algorithmic models of the mental lexicon, word frequency distributions and information theoretical measures of word families, statistical correlations across psycho-linguistic and cognitive evidence, principles of machine learning and integrative brain models of word storage and processing. Main goal of the book will be to map out the landscape of future research in this area, to foster the development of interdisciplinary curricula and help single-domain specialists understand and address issues and questions as they are raised in other disciplines

The Complexity of the Falsifiability Problem for Pure Implicational Formulas

Since it is unlikely that any NP-complete problem will ever be efficiently solvable, one is interested in identifying those special cases that can be solved in polynomial time. We deal with the special case of Boolean formulas where the logical implication ! is the only operator and any variable (except one) occurs at most twice. For these formulas we show that an infinite hierarchy S 1 ` S 2 \Delta \Delta \Delta exists such that we can test any formula from S i for falsifiability in time O(n i ), where n is the number of variables in the formula. We describe an algorithm that finds a falsifying assignment, if one exists. Furthermore we show that the falsifiability problem for S 1 i=1 S i is NP-complete by reducing the SAT-Problem. In contrast to the hierarchy described by Gallo and Scutella for Boolean formulas in CNF, where the test for membership in the k-th level of the hierarchy needs time O(n k ), our hierarchy permits a linear time membership test. Finally we show that S ..