4573 search results - page 192 / 915 » Automated Reasoning |
100
click to vote
CSL
2001
Springer
15 years 8 months ago
2001
Springer
We prove an existential version of Gaifman’s locality theorem and show how it can be applied algorithmically to evaluate existential first-order sentences in finite structures....
87
Voted
CL
2000
Springer
15 years 8 months ago
2000
Springer
Generalized databases will be examined, in which attributes can be sets of attributes, or sets of sets of attributes, and other higher type constructs. A precise semantics will be ...
105
Voted
LICS
1999
IEEE
15 years 8 months ago
1999
IEEE
Guarded fixed point logics are obtained by adding least and greatest fixed points to the guarded fragments of firstorder logic that were recently introduced by Andr
116
Voted
LICS
1998
IEEE
15 years 8 months ago
1998
IEEE
The Horn
181
Voted
FTP
1998
Springer
15 years 7 months ago
1998
Springer
Abstract. First-order modal logic, in the usual formulations, is not sufficiently expressive, and as a consequence problems like Frege's morning