The Port-Royal Logic's Theory of Argument

This is a critical examination of Antoine Arnauld's Logic or the Art of Thinking (1662), commonly known as the Port-Royal Logic. Rather than reading this work from the viewpoint of post-Fregean formal logic or the viewpoint of seventeenth-century intellectual history, I approach it with the aim of exploring its relationship to that contemporary field which may be labeled informal logic and/or argumentation theory. It turns out that the Port-Royal Logic is a precursor of this current field, or conversely, that this field may be said to be in the same tradition.     

Effects of Performance-Based Pay Systems on Quantity and Quality in Computer Programming

This experiment was conducted to investigate the effects of quality-contingent pay systems on quantity and quality. Three computer science students were paid to create simple computer programs across 25 sessions. A multiple-baseline across subjects design was used to compare the effects of three kinds of pay systems; pay-for-hour, pay-for-quantity, and pay-for-quality systems. The quantity was higher when pay was based on the quantity of the programs produced, and the quality was highest when pay was based on the quality of the programs. The production cost including quality inspection costs was highest when pay was based on the time worked.     

Basic Logic,K4, and Persistence

We characterize the first-order formulas with one free variable that are preserved under bisimulation and persistence or strong persistence over the class of Kripke models with transitive frames and unary persistent predicates. This revised version was published online in June 2006 with corrections to the Cover Date.     

题库智能化组卷的心理计量理论与方法

现代教育成就测验的广泛应用,促使题库技术迅速发展。现代教育测量理论与计算机技术的结合,更使智能化组卷成为可能。本文报告了以项目反应理论为指导,并改进一般线性规划法为分步离差加权模型法,编制程序在高等教育自学考试“逻辑学”题库上,成功实现智能化组卷的研究成果,从而为计算机技术在题库建设中的应用作了新的探讨。     

Answer Sets and Qualitative Optimization

One of the major reasons for the success of answer set programmingin recent years was the shift from a theorem proving to a constraintprogramming view: problems are represented such that stablemodels, respectively answer sets, rather than theorems correspondto solutions. This shift in perspective proved extremely fruitfulin many areas. We believe that going one step further from a"hard" to a "soft" constraint programming paradigm, or, in otherwords, to a paradigm of qualitative optimization, will proveequally fruitful. In this paper we try to support this claimby showing that several generic problems in logic based problemsolving can be understood as qualitative optimization problems,and that these problems have simple and elegant formulationsgiven adequate optimization constructs in the knowledge representationlanguage.     

Optimal Least-Squares Unidimensional Scaling: Improved Branch-and-Bound Procedures and Comparison to Dynamic Programming

There are two well-known methods for obtaining a guaranteed globally optimal solution to the problem of least-squares unidimensional scaling of a symmetric dissimilarity matrix: (a) dynamic programming, and (b) branch-and-bound. Dynamic programming is generally more efficient than branch-and-bound, but the former is limited to matrices with approximately 26 or fewer objects because of computer memory limitations. We present some new branch-and-bound procedures that improve computational efficiency, and enable guaranteed globally optimal solutions to be obtained for matrices with up to 35 objects. Experimental tests were conducted to compare the relative performances of the new procedures, a previously published branch-and-bound algorithm, and a dynamic programming solution strategy. These experiments, which included both synthetic and empirical dissimilarity matrices, yielded the following findings: (a) the new branch-and-bound procedures were often drastically more efficient than the previously published branch-and-bound algorithm, (b) when computationally feasible, the dynamic programming approach was more efficient than each of the branch-and-bound procedures, and (c) the new branch-and-bound procedures require minimal computer memory and can provide optimal solutions for matrices that are too large for dynamic programming implementation.The authors gratefully acknowledge the helpful comments of three anonymous reviewers and the Editor. We especially thank Larry Hubert and one of the reviewers for providing us with the MATLAB files for optimal and heuristic least-squares unidimensional scaling methods.This revised article was published online in June 2005 with all corrections incorporated.     

Modal Deduction in Second-Order Logic and Set Theory - II

In this paper, we generalize the set-theoretic translation method for poly-modal logic introduced in [11] to extended modal logics. Instead of devising an ad-hoc translation for each logic, we develop a general framework within which a number of extended modal logics can be dealt with. We first extend the basic set-theoretic translation method to weak monadic second-order logic through a suitable change in the underlying set theory that connects up in interesting ways with constructibility; then, we show how to tailor such a translation to work with specific cases of extended modal logics.     

An intensional epistemic logic

One of the fundamental properties inclassical equational reasoning isLeibniz's principle of substitution. Unfortunately, this propertydoes not hold instandard epistemic logic. Furthermore,Herbrand's lifting theorem which isessential to thecompleteness ofresolution andParamodulation in theclassical first order logic (FOL), turns out to be invalid in standard epistemic logic. In particular, unlike classical logic, there is no skolemization normal form for standard epistemic logic. To solve these problems, we introduce anintensional epistemic logic, based on avariation of Kripke's possible-worlds semantics that need not have a constant domain. We show how a weaker notion of substitution through indexed terms can retain the Herbrand theorem. We prove how the logic can yield a satisfibility preserving skolemization form. In particular, we present an intensional principle for unifing indexed terms. Finally, we describe asound andcomplete inference system for a Horn subset of the logic withequality, based onepistemic SLD-resolution.