1693 search results - page 185 / 339 » Pattern-Recognition: a Foundational Approach |
150
Voted
AML
2005
15 years 6 months ago
2005
It is proved that the forcing apparatus can be built and set to work in ZFCA (=ZFC minus foundation plus the antifoundation axiom AFA). The key tools for this construction are gre...
274
click to vote
ICDE
2000
IEEE
16 years 7 months ago
2000
IEEE
Most real-world database applications contain a substantial portion of time-referenced, or temporal, data. Recent advances in temporal query languages show that such database appl...
203
click to vote
AGP
2010
IEEE
15 years 11 months ago
2010
IEEE
We review the Italian contribution to proof-theoretic and higher-order extensions of logic programming; this originated from the realization that Horn clauses lacked standard abstr...
184
click to vote
STOC
1998
ACM
15 years 10 months ago
1998
ACM
We present a deterministic strongly polynomial algorithm that computes the permanent of a nonnegative n × n matrix to within a multiplicative factor of en. To this end we develop...
171
click to vote
COORDINATION
2006
Springer
15 years 10 months ago
2006
Springer
We tackle the problem of providing rigorous formal foundations to current software engineering technologies for web services. We focus on two of the most used XML-based languages f...