Sciweavers

347 search results - page 15 / 70
» Some Second Order Set Theory
Sort
View
CADE
2005
Springer
14 years 7 months ago
Reflecting Proofs in First-Order Logic with Equality
Our general goal is to provide better automation in interactive proof assistants such as Coq. We present an interpreter of proof traces in first-order multi-sorted logic with equal...
Evelyne Contejean, Pierre Corbineau
SAGT
2010
Springer
175views Game Theory» more  SAGT 2010»
13 years 5 months ago
On Learning Algorithms for Nash Equilibria
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
Constantinos Daskalakis, Rafael Frongillo, Christo...
AEPIA
2002
159views more  AEPIA 2002»
13 years 7 months ago
Analysing Rough Sets weighting methods for Case-Based Reasoning Systems
Case-Based Reasoning systems retrieve cases using a similarity function based on the K-NN or some derivatives. These functions are sensitive to irrelevant, interacting or noisy fe...
Maria Salamó, Elisabet Golobardes
LOGCOM
2002
142views more  LOGCOM 2002»
13 years 7 months ago
Two Logical Theories of Plan Recognition
We present a logical approach to plan recognition that builds on Kautz's theory of keyhole plan recognition, defined as the problem of inferring descriptions of high-level pl...
Wayne Wobcke
LPAR
2007
Springer
14 years 1 months ago
Completeness and Decidability in Sequence Logic
Sequence logic is a parameterized logic where the formulas are sequences of formulas of some arbitrary underlying logic. The sequence formulas are interpreted in certain linearly o...
Marc Bezem, Tore Langholm, Michal Walicki