Representation and Reasoning about Evolutions of the World in the Context of Reasoning about Actions

The first step in reasoning about actions and change involves reasoning about how the world would evolve if a certain action is executed in a certain state. Most research on this assumes the evolution to be only a single step and focus on formulating the transition function that defines changes between states due to actions. In this paper we consider cases where the evolution is more than just a single change between one state and another. This is manifested when the execution of an action may trigger execution of other actions, or when multiple agents act on the environment following certain strategies.     

Curry-Howard Terms for Linear Logic

In this paper we 1. provide a natural deduction system for full first-order linear logic, 2. introduce Curry-Howard-style terms for this version of linear logic, 3. extend the notion of substitution of Curry-Howard terms for term variables, 4. define the reduction rules for the Curry-Howard terms and 5. outline a proof of the strong normalization for the full system of linear logic using a development of Girard's candidates for reducibility, thereby providing an alternative to Girard's proof using proof-nets.     

A cirquent calculus system with clustering and ranking

Cirquent calculus is a new proof-theoretic and semantic approach introduced by G. Japaridze for the needs of his theory of computability logic (CoL). The earlier article “From formulas to cirquents in computability logic” by Japaridze generalized formulas in CoL to circuit-style structures termed cirquents. It showed that, through cirquents with what are termed clustering and ranking, one can capture, refine and generalize independence-friendly (IF) logic. Specifically, the approach allows us to account for independence from propositional connectives in the same spirit as IF logic accounts for independence from quantifiers. Japaridze's treatment of IF logic, however, was purely semantical, and no deductive system was proposed. The present paper syntactically constructs a cirquent calculus system with clustering and ranking, sound and complete w.r.t. the propositional fragment of cirquent-based semantics. Such a system captures the propositional version of what is called extended IF logic, thus being an axiomatization of a nontrivial fragment of that logic.     

A Logic for Information Systems

A conception of an information system has been introduced by Pawlak. The study has been continued in works of Pawlak and Orlowska and in works of Vakarelov. They had proposed some basic relations and had constructed a formal system of a modal logic that describes the relations and some of their Boolean combinations. Our work is devoted to a generalization of this approach. A class of relation systems and a complete calculus construction method for these systems are proposed. As a corollary of our main result, our paper contains a solution of a Vakarelov's problem: how to construct a formal system that describes all the Boolean combinations of the basic relations.     

Complete Axiomatizations for Reasoning about Knowledge and Branching Time

Sound and complete axiomatizations are provided for a number of different logics involving modalities for the knowledge of multiple agents and operators for branching time, extending previous work of Halpern, van der Meyden and Vardi [to appear, SIAM Journal on Computing] for logics of knowledge and linear time. The paper considers the system constraints of synchrony, perfect recall and unique initial states, which give rise to interaction axioms. The language is based on the temporal logic CTL*, interpreted with respect to a version of the bundle semantics.     

Parsing Pregroup Grammars and Lambek Calculus Using Partial Composition

The paper presents a way to transform pregroup grammars into contextfree grammars using functional composition. The same technique can also be used for the proof-nets of multiplicative cyclic linear logic and for Lambek calculus allowing empty premises.     

Quantized Linear Logic,Involutive Quantales and Strong Negation

A new logic, quantized intuitionistic linear logic (QILL), is introduced, and is closely related to the logic which corresponds to Mulvey and Pelletier's (commutative) involutive quantales. Some cut-free sequent calculi with a new property quantization principle and some complete semantics such as an involutive quantale model and a quantale model are obtained for QILL. The relationship between QILL and Wansing's extended intuitionistic linear logic with strong negation is also observed using such syntactical and semantical frameworks.     

Using Lexicographic Parametric Programming for Searching a Non-dominated Set in Multiple-Objective Linear Programming

In this paper we propose an approach which makes it possible to search non-dominated and only non-dominated solutions in multiple-objective linear programming. The approach is based on the use of a reference direction and lexicographic parametric programming. The requisite theory is developed in the paper. The use of the approach is illustrated with a numerical example.     

An Axiomatisation for the Multi-modal Logic of Knowledge and Linear Time LTK

The paper aims at providing the multi-modal propositional logicLTK with a sound and complete axiomatisation. This logic combinestemporal and epistemic operators and focuses on m odeling thebehaviour of a set of agents operating in a system on the backgroundof a temporal framework. Time is represented as linear and discrete,whereas knowledge is modeled as an S₅-like modality. A furthermodal operator intended to represent environment knowledge isadded to the system in order to achieve the expressive powersufficient to describe the piece of information available tothe agents at each moment in the flow of time.     

涵义语义与关于概称句推理的词项逻辑

概称句推理具有以词项为单位的特征并且词项的涵义在其中起到了重要的作用。已有的处理用A一表达式表达涵义,不够简洁和自然。亚里斯多德三段论是一种词项逻辑,但它是外延的和单调的。这两方面的情况使得有必要考虑新的词项逻辑。涵义语义的基本观点是：语词首先表达的是涵义,通过涵义的作用,语词有了指称,表达概念。概称句三段论是更为常用的推理,有两个基本形式GAG和Gaa。在涵义语义的基础上建立的系统GAG和Gaa是关于这两种推理的公理系统。     

Memory for Actions of an Event: Older and Younger Adults Compared

Previous studies have shown increased false memory effects in older compared to younger adults. To investigate this phenomenon in event memory, in the present study, the authors presented younger and older adults with a robbery. A distinction was made between verbal and visual actions of the event, and recognition and subjective experience of retrieval (remember/know/guess judgments) were analyzed. Although there were no differences in hits, older adults accepted more false information as true and, consequently, showed less accurate recognition than younger adults. Moreover, older adults were more likely than younger adults to accompany these errors with remember judgments. Young adults accepted fewer false verbal actions than visual ones and awarded fewer remember judgments to their false alarms for verbal than for visual actions. Older adults, however, did not show this effect of type of information. These results suggest that aging is a relevant factor in memory for real-life eyewitness situations.     

A global optimization approach for generating efficient points for multiobjective concave fractional programs

In this article, we present a global optimization approach for generating efficient points for multiobjective concave fractional programming problems. The main work of the approach involves solving an instance of a concave multiplicative fractional program (W̄). Problem (W̄) is a global optimization problem for which no known algorithms are available. Therefore, to render the approach practical, we develop and validate a branch and bound algorithm for globally solving problem (W̄). To illustrate the performance of the global optimization approach, we use it to generate efficient points for a sample multiobjective concave fractional program. Copyright © 2006 John Wiley & Sons, Ltd.     

A Recourse Stochastic Goal Programming Approach for the Multi‐objective Stochastic Vehicle Routing Problem

This paper addresses a multi‐objective stochastic vehicle routing problem where several conflicting objectives such as the travel time, the number of vehicles in use and the probability of an accident are simultaneously minimized. We suppose that demands and travel durations are of a stochastic nature. In order to build a certainty equivalent program to the multi‐objective stochastic vehicle routing problem, we propose a solution strategy based on a recourse approach, a chance‐constrained approach and a goal‐programming approach. The resulting certainty equivalent program is solved to optimality using CPLEX. Copyright © 2016 John Wiley & Sons, Ltd.     

A Deep Inference System for the Modal Logic S5

We present a cut-admissible system for the modal logic S5 in a formalism that makes explicit and intensive use of deep inference. Deep inference is induced by the methods applied so far in conceptually pure systems for this logic. The system enjoys systematicity and modularity, two important properties that should be satisfied by modal systems. Furthermore, it enjoys a simple and direct design: the rules are few and the modal rules are in exact correspondence to the modal axioms. Presented by Heinrich Wansing     

A Comparative Investigation of Confidence Intervals for IndependentVariables in Linear Regression

In linear regression, the most appropriate standardized effect size for individual independent variables having an arbitrary metric remains open to debate, despite researchers typically reporting a standardized regression coefficient. Alternative standardized measures include the semipartial correlation, the improvement in the squared multiple correlation, and the squared partial correlation. No arguments based on either theoretical or statistical grounds for preferring one of these standardized measures have been mounted in the literature. Using a Monte Carlo simulation, the performance of interval estimators for these effect-size measures was compared in a 5-way factorial design. Formal statistical design methods assessed both the accuracy and robustness of the four interval estimators. The coverage probability of a large-sample confidence interval for the semipartial correlation coefficient derived from Aloe and Becker was highly accurate and robust in 98% of instances. It was better in small samples than the Yuan-Chan large-sample confidence interval for a standardized regression coefficient. It was also consistently better than both a bootstrap confidence interval for the improvement in the squared multiple correlation and a noncentral interval for the squared partial correlation.     

A maximin model for IRT-based test design with practical constraints

A maximin model for IRT-based test design is proposed. In the model only the relative shape of the target test information function is specified. It serves as a constraint subject to which a linear programming algorithm maximizes the information in the test. In the practice of test construction, several demands as linear constraints in the model. A worked example of a text construction problem with practical constraints is presented. The paper concludes with a discussion of some alternative models of test construction.The authors are indebted to Jos J. Adea for suggesting Equation 17 as a Simplification of an earlier version of this constraint. This research was suuorted in part by a grant from the Dutch Organization for Research (NWO) through the Foundation for Psychological and Psychonomic Research in the Netherlands (Psychon).     

A verification framework for agent programming with declarative goals

A long and lasting problem in agent research has been to close the gap between agent logics and agent programming frameworks. The main reason for this problem of establishing a link between agent logics and agent programming frameworks is identified and explained by the fact that agent programming frameworks have hardly incorporated the concept of a declarative goal. Instead, such frameworks have focused mainly on plans or goals-to-do instead of the end goals to be realised which are also called goals-to-be. In this paper, the programming language GOAL is introduced which incorporates such declarative goals. The notion of a commitment strategy—one of the main theoretical insights due to agent logics, which explains the relation between beliefs and goals—is used to construct a computational semantics for GOAL. Finally, a proof theory for proving properties of GOAL agents is introduced. Thus, the main contribution of this paper, rather than the language GOAL itself, is that we offer a complete theory of agent programming in the sense that our theory provides both for a programming framework and a programming logic for such agents. An example program is proven correct by using this programming logic.