250 search results - page 9 / 50 » Reflections on Finite Model Theory |
MANSCI
2010
14 years 8 months ago
2010
This paper introduces a choice-based method that for the first time makes it possible to quantitatively measure regret theory, one of the most popular models of decision under unc...
74
Voted
JSYML
2008
14 years 9 months ago
2008
0-stable 0-categorical linked quaternionic mappings are studied and are shown to correspond (in some sense) to special groups which are 0stable, 0-categorical, satisfy AP(3) and ha...
CIE
2008
Springer
14 years 11 months ago
2008
Springer
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...
UAI
1989
14 years 10 months ago
1989
In this paper, the feasibility of using finite totally ordered probability models under Aleliunas’s Theory of Probabilistic Logic [Aleliunas, 1988] is investigated. The general...
AAAI
2010
14 years 11 months ago
2010
In this paper, we propose a translation from normal first-order logic programs under the answer set semantics to first-order theories on finite structures. Specifically, we introd...