3122 search results - page 176 / 625 » A Theory of Network Equivalence |
160
click to vote
CADE
2006
Springer
16 years 6 months ago
2006
Springer
Abstract. We extend our previous study of the automatic construction of isomorphic classification theorems for algebraic domains by considering the isotopy equivalence relation. Is...
176
click to vote
PODS
2004
ACM
16 years 6 months ago
2004
ACM
Unions of conjunctive queries, also known as select-project-join-union queries, are the most frequently asked queries in relational database systems. These queries are definable b...
161
click to vote
POPL
2010
ACM
16 years 3 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
141
click to vote
COMPLEX
2009
Springer
16 years 1 months ago
2009
Springer
Investors would like to calculate profits in advance, “ex ante”, like the path of a flying ball. But income can only be given “ex post”, after the money is earned. The pro...
147
click to vote
LPNMR
2009
Springer
16 years 1 months ago
2009
Springer
Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which a...