How much of commonsense and legal reasoning is formalizable? A review of conceptual obstacles

Fifty years of effort in artificial intelligence (AI) and the formalization of legal reasoning have produced both successes and failures. Considerable success in organizing and displaying evidence and its interrelationships has been accompanied by failure to achieve the original ambition of AI as applied to law: fully automated legal decision-making. The obstacles to formalizing legal reasoning have proved to be the same ones that make the formalization of commonsense reasoning so difficult, and are most evident where legal reasoning has to meld with the vast web of ordinary human knowledge of the world. Underlying many of the problems is the mismatch between the discreteness of symbol manipulation and the continuous nature of imprecise natural language, of degrees of similarity and analogy, and of probabilities

Competition Law Enforcement in China: Between Technocracy and Industrial Policy

The article provides a rare reconstruction of a number of early cases decided under the Chinese Anti-Monopoly Law. In particular, the article seeks to go behind the published decisions of the responsible authorities, to reconstruct their decision-making process in particular by identifying the sources of consultation and the arguments that various stakeholders presented to the authorities about what course of action to follow

Formalizing Informal Logic

In this paper we investigate the extent to which formal argumentation models can handle ten basic characteristics of informal logic identified in the informal logic literature. By showing how almost all of these characteristics can be successfully modelled formally, we claim that good progress can be made toward the project of formalizing informal logic. Of the formal argumentation models available, we chose the Carneades Argumentation System (CAS), a formal, computational model of argument that uses argument graphs as its basis, structures of a kind very familiar to practitioners of informal logic through their use of argument diagrams

Tropical curves in sandpiles

We study a sandpile model on the set of the lattice points in a large lattice polygon. A small perturbation $\psi$ of the maximal stable state $\mu\equiv 3$ is obtained by adding extra grains at several points. It appears, that the result $\psi^\circ$ of the relaxation of $\psi$ coincides with $\mu$ almost everywhere; the set where $\psi^\circ\ne \mu$ is called the deviation locus. The scaling limit of the deviation locus turns out to be a distinguished tropical curve passing through the perturbation points. Nous consid\'erons le mod\`ele du tas de sable sur l'ensemble des points entiers d'un polygone entier. En ajoutant des grains de sable en certains points, on obtient une perturbation mineure de la configuration stable maximale $\mu\equiv 3$. Le r\'esultat $\psi^\circ$ de la relaxation est presque partout \'egal \`a $\mu$. On appelle lieu de d\'eviation l'ensemble des points o\`u $\psi^\circ\ne \mu$. La limite au sens de la distance de Hausdorff du lieu de d\'eviation est une courbe tropicale sp\'eciale, qui passe par les points de perturbation.Comment: small correction

Adequate formalization

This article identifies problems with regard to providing criteria that regulate the matching of logical formulae and natural language. We then take on to solve these problems by defining a necessary and sufficient criterion of adequate formalization. On the basis of this criterion we argue that logic should not be seen as an ars iudicandi capable of evaluating the validity or invalidity of informal arguments, but as an ars explicandi that renders transparent the formal structure of informal reasonin

Detecting Activations over Graphs using Spanning Tree Wavelet Bases

We consider the detection of activations over graphs under Gaussian noise, where signals are piece-wise constant over the graph. Despite the wide applicability of such a detection algorithm, there has been little success in the development of computationally feasible methods with proveable theoretical guarantees for general graph topologies. We cast this as a hypothesis testing problem, and first provide a universal necessary condition for asymptotic distinguishability of the null and alternative hypotheses. We then introduce the spanning tree wavelet basis over graphs, a localized basis that reflects the topology of the graph, and prove that for any spanning tree, this approach can distinguish null from alternative in a low signal-to-noise regime. Lastly, we improve on this result and show that using the uniform spanning tree in the basis construction yields a randomized test with stronger theoretical guarantees that in many cases matches our necessary conditions. Specifically, we obtain near-optimal performance in edge transitive graphs, $k$-nearest neighbor graphs, and $\epsilon$-graphs

Automated Reasoning and Presentation Support for Formalizing Mathematics in Mizar

This paper presents a combination of several automated reasoning and proof presentation tools with the Mizar system for formalization of mathematics. The combination forms an online service called MizAR, similar to the SystemOnTPTP service for first-order automated reasoning. The main differences to SystemOnTPTP are the use of the Mizar language that is oriented towards human mathematicians (rather than the pure first-order logic used in SystemOnTPTP), and setting the service in the context of the large Mizar Mathematical Library of previous theorems,definitions, and proofs (rather than the isolated problems that are solved in SystemOnTPTP). These differences poses new challenges and new opportunities for automated reasoning and for proof presentation tools. This paper describes the overall structure of MizAR, and presents the automated reasoning systems and proof presentation tools that are combined to make MizAR a useful mathematical service.Comment: To appear in 10th International Conference on. Artificial Intelligence and Symbolic Computation AISC 201