2688 search results - page 46 / 538 » A formal semantics for P3P |
AISC
2010
Springer
13 years 11 months ago
2010
Springer
We prove formally that the first order theory of algebraically closed fields enjoy quantifier elimination, and hence is decidable. This proof is organized in two modular parts. We ...
ESWS
2008
Springer
13 years 9 months ago
2008
Springer
The increasing amount of data on the Semantic Web offers opportunities for semantic search. However, formal query hinders the casual users in expressing their information need as t...
EACL
1989
ACL Anthology
13 years 8 months ago
1989
ACL Anthology
This paper shows how higher levels of generalization can be introduced into unification grammars by exploiting methods for typing grammatical objects. We discuss the strategy of u...
SEMWEB
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. The Rule Interchange Format Production Rule Dialect (RIFPRD) is a W3C Recommendation to define production rules for the Semantic Web, whose semantics is defined operation...
ATVA
2011
Springer
12 years 7 months ago
2011
Springer
Abstract. In the traditional Boolean setting of formal verification, alternating automata are the key to many algorithms and tools. In this setting, the correspondence between dis...