4617 search results - page 209 / 924 » Automation of Diagrammatic Reasoning |
173
click to vote
SARA
2007
Springer
16 years 17 days ago
2007
Springer
Relational databases have had great industrial success in computer science, their power evidenced by theoretical analysis and widespread adoption. Often, automated theorem provers...
160
click to vote
KR
2010
Springer
15 years 11 months ago
2010
Springer
Dynamic epistemic logic deals with the representation of situations in a multi-agent and dynamic setting. It allows to express in a uniform way statements about:
141
click to vote
ASP
2001
Springer
15 years 11 months ago
2001
Springer
Abstract Howard A. Blair EECSDept., 2-177 SciTech Syracuse University Syracuse, NY13210 USA
137
click to vote
CSL
2001
Springer
15 years 11 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....
120
click to vote
CL
2000
Springer
15 years 10 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 ...