71 search results - page 6 / 15 » Decidability Under the Well-Founded Semantics |
ATVA
2006
Springer
13 years 11 months ago
2006
Springer
Ping-pong protocols with recursive definitions of agents, but without any active intruder, are a Turing powerful model. We show that under the environment sensitive semantics (i.e....
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 ...
INTERNET
2006
13 years 7 months ago
2006
: The huge growth of e-commerce has had a profound impact on users who can now choose from an ever increasing number of options online. Inevitably, as the number of choices has inc...
CADE
2006
Springer
14 years 8 months ago
2006
Springer
We present a type theory with some proof-irrelevance built into the conversion rule. We argue that this feature is useful when type theory is used as the logical formalism underlyi...
SEMWEB
2005
Springer
14 years 1 months ago
2005
Springer
A common practice in conceptual modeling is to separate the conceptual from the data model. Although very intuitive, this approach is inadequate for many complex domains, in which...