Results 1  10
of
250
Texts published in Working Papers are the responsibility of the authors. The NonOptimality of Deductible Contracts Against Fraudulent Claims: An Empirical Evidence in Automobile Insurance
, 1997
"... This paper has benefited from the financial support of the Fonds FCAR (Quebec) programme de soutien aux équipes de recherche. We are also grateful to Raymond Medza of the Groupement des assureurs automobiles du Quebec (GAA) who gave us the permission to use the data and Nathalie Lizotte and Jacques ..."
Abstract
 Add to MetaCart
This paper has benefited from the financial support of the Fonds FCAR (Quebec) programme de soutien aux équipes de recherche. We are also grateful to Raymond Medza of the Groupement des assureurs automobiles du Quebec (GAA) who gave us the permission to use the data and Nathalie Lizotte and Jacques Morazin, also from the GAA, for their technical support. Of course, they do not share the potential mistakes! Also, comments by Philippe
Deductible or CoInsurance:
, 2004
"... The standard solution to adverse selection is the separating equilibrium introduced by Rothschild and Stiglitz. Usually, the RothschildStiglitz argument is developed in a model that allows for two states of the world only. In this paper adverse selection is discussed for continuous loss distributi ..."
Abstract
 Add to MetaCart
distributions. This gives rise to the new problem of finding the proper form of an insurance contract to impose partial insurance of the low risks. This paper contributes to the discussion on optimal insurance. It analyzes two basic forms of insurance contracts: A contract with a deductible and a contract
Note on Deduction Theorems in ContractionFree Logics
"... In this short paper we present a finer analysis of the variants of Local Deduction Theorem in contractionfree logics. We define some natural generalisations called Implicational Deduction Theorems and study their basic properties. The hierarchy of classes of logics defined by these theorems is pres ..."
Abstract
 Add to MetaCart
In this short paper we present a finer analysis of the variants of Local Deduction Theorem in contractionfree logics. We define some natural generalisations called Implicational Deduction Theorems and study their basic properties. The hierarchy of classes of logics defined by these theorems
Linear deductive planning
 JOURNAL OF LOGIC AND COMPUTATION
, 1996
"... Recently, three approaches to deductive planning were developed, which solve the technical frame problem without the need to state frame axioms explicitly. These approaches are based on the linear connection method, an equational Horn logic, and linear logic. At first glance these approaches seem to ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
Recently, three approaches to deductive planning were developed, which solve the technical frame problem without the need to state frame axioms explicitly. These approaches are based on the linear connection method, an equational Horn logic, and linear logic. At first glance these approaches seem
Natural Deduction for Intuitionistic Linear Logic
, 1993
"... The paper deals with two versions of the fragment with unit, tensor, linear implication and storage operator (the exponential !) of intuitionistic linear logic. The first version, ILL, appears in a paper by Benton, Bierman, Hyland and de Paiva; the second one, ILL + , is described in this paper. I ..."
Abstract

Cited by 34 (0 self)
 Add to MetaCart
. ILL has a contraction rule and an introduction rule !I for the exponential; in ILL + , instead of a contraction rule, multiple occurrences of labels for assumptions are permitted under certain conditions; moreover, there is a different introduction rule for the exponential, !I + , which is closer
Future directions of automated deduction: Distributed automated deduction
"... this document. Two surveys are available in [4] and [11], and most approaches proposed since those surveys were written may be found in [6] or [7]. In the following we give first some motivation and introduction, then we focuse on a fundamental problem for future research, the design of techniques t ..."
Abstract
 Add to MetaCart
to partition the search space among cooperating concurrent processes. Motivation The aim of distributed automated deduction is to design distributed strategies that may improve the performance of theorem proving by employing in parallel more than one machine. Higher performance means obtaining proofs
A theory of contracts for web services
 In POPL ’08, 35th ACM Symposium on Principles of Programming Languages
, 2008
"... Contracts are behavioral descriptions of Web services. We devise a theory of contracts that formalizes the compatibility of a client to a service, and the safe replacement of a service with another service. The use of contracts statically ensures the successful completion of every possible interacti ..."
Abstract

Cited by 96 (12 self)
 Add to MetaCart
Contracts are behavioral descriptions of Web services. We devise a theory of contracts that formalizes the compatibility of a client to a service, and the safe replacement of a service with another service. The use of contracts statically ensures the successful completion of every possible
Distributed Deduction by ClauseDiffusion: Distributed Contraction and the Aquarius Prover
, 1995
"... Aquarius is a distributed theorem prover for first order logic with equality, developed for a network of workstations. Given as input a theorem proving problem and a number n of active nodes, Aquarius creates n deductive processes, one on each workstation, which work cooperatively toward the solutio ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Aquarius is a distributed theorem prover for first order logic with equality, developed for a network of workstations. Given as input a theorem proving problem and a number n of active nodes, Aquarius creates n deductive processes, one on each workstation, which work cooperatively toward
The ClauseDiffusion methodology for distributed deduction
, 1993
"... This paper describes a methodology for parallel theorem proving in a distributed environment, called deduction by ClauseDi#usion. This methodology utilizes parallelism at the search level, by having concurrent, asynchronous deductive processes searching in parallel the search space of the proble ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
This paper describes a methodology for parallel theorem proving in a distributed environment, called deduction by ClauseDi#usion. This methodology utilizes parallelism at the search level, by having concurrent, asynchronous deductive processes searching in parallel the search space
Results 1  10
of
250