Sciweavers

662 search results - page 6 / 133
» Formalizing Basic First Order Model Theory
Sort
View
CORR
2007
Springer
141views Education» more  CORR 2007»
13 years 7 months ago
Acyclicity of Preferences, Nash Equilibria, and Subgame Perfect Equilibria: a Formal and Constructive Equivalence
Abstract. Sequential game and Nash equilibrium are basic key concepts in game theory. In 1953, Kuhn showed that every sequential game has a Nash equilibrium. The two main steps of ...
Stéphane Le Roux
LORI
2009
Springer
14 years 2 months ago
First-Order Logic Formalisation of Arrow's Theorem
Arrow’s Theorem is a central result in social choice theory. It states that, under certain natural conditions, it is impossible to aggregate the preferences of a finite set of i...
Umberto Grandi, Ulle Endriss
FLAIRS
2001
13 years 8 months ago
Validity of First-Order Knowledge Bases
A knowledge base is maintained by modifying its conceptual model and by using those modifications to specify changes to its implementation. The maintenance problem is to determine...
John K. Debenham
TPHOL
2003
IEEE
14 years 22 days ago
First Order Logic with Domain Conditions
This paper addresses the crucial issue in the design of a proof development system of how to deal with partial functions and the related question of how to treat undefined terms. ...
Freek Wiedijk, Jan Zwanenburg
IEEEARES
2006
IEEE
14 years 1 months ago
Bayesian Networks Implementation of the Dempster Shafer Theory to Model Reliability Uncertainty
In many reliability studies based on data, reliability engineers face incompleteness and incoherency problems in the data. Probabilistic tools badly handle these kinds of problems...
Christophe Simon, Philippe Weber