14084 search results - page 150 / 2817 » A Theory for Game Theories |
IANDC
2006
13 years 8 months ago
2006
Many approaches to deciding the satisfiability of quantifier free formulae with respect to a background theory T -- also known as Satisfiability Modulo Theory, or SMT
JAPLL
2006
13 years 8 months ago
2006
For twenty years the Nuprl ("new pearl") system has been used to develop software systems and formal theories of computational mathematics. It has also been used to expl...
SYNTHESE
2008
13 years 8 months ago
2008
The problem addressed in this paper is "the main epistemic problem concerning science", viz. "the explication of how we compare and evaluate theories [. . .] in the ...
ML
2000
ACM
13 years 8 months ago
2000
ACM
Existing methods for exploiting awed domain theories depend on the use of a su ciently large set of training examples for diagnosing and repairing aws in the theory. In this paper,...
JSYML
2002
13 years 8 months ago
2002
We develop the theory of germs of generic functions in simple theories. Starting with an algebraic quadrangle (or other similar hypotheses), we obtain an "almost" generic...