Filters








20,534 Hits in 6.0 sec

The implication and finite implication problems for typed template dependencies

Moshe Y. Vardi
<span title="">1984</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/p6ovb2qpkfenhmb7mcksobrcxq" style="color: black;">Journal of computer and system sciences (Print)</a> </i> &nbsp;
However, the status of the implication and finite implication problem for typed template dependencies was left open by the above mentioned papers.  ...  Untyped template dependencies are much more expressive than typed template dependencies, and their implication and finite implication problems are unsolvable [7, 121.  ...  Mainly, we show that there is a finite set of typed template dependencies whose implication and finite implication problems in the class of typed template dependencies are unsolvable.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0022-0000(84)90074-6">doi:10.1016/0022-0000(84)90074-6</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fg3xh2x7wbanjeqxsmsaf5nxvq">fatcat:fg3xh2x7wbanjeqxsmsaf5nxvq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20100621051927/http://www.cs.rice.edu/~vardi/papers/pods82rj.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7a/af/7aaf4f29748cd41f28e5576b4908f930706fdd49.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0022-0000(84)90074-6"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

The implication and finite implication problems for typed template dependencies

Moshe Y. Vardi
<span title="">1982</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/xtq6wnwaszaebg4qf7aw6mllwi" style="color: black;">Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems - PODS &#39;82</a> </i> &nbsp;
However, the status of the implication and finite implication problem for typed template dcpendencies was left open by the above mentioned papers.  ...  Untyped template dependencies are much more cxprcssivc then typed template dcpendencies, and their implication and finite implication problems arc unsolvable [BVl, CLMl].  ...  Mainly, WC show that there is a finite set of typed template dependencies whose implication and finite implication problems in the class of typed template dependencies are unsolvable.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/588111.588149">doi:10.1145/588111.588149</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/pods/Vardi82.html">dblp:conf/pods/Vardi82</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/u7mkmwqnbfhefgbtfwtyfdxnuy">fatcat:u7mkmwqnbfhefgbtfwtyfdxnuy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829095552/http://i.stanford.edu/pub/cstr/reports/cs/tr/82/912/CS-TR-82-912.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/05/75/057519ca1e4eb7ab6d54e83e9fc7196d29fc482d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/588111.588149"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

The implication and finite implication problems for typed template dependencies

Moshe Y. Vardi
<span title="">1982</span> <i title="ACM Press"> Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems - PODS &#39;82 </i> &nbsp;
However, the status of the implication and finite implication problem for typed template dependencies was left open by the above mentioned papers.  ...  Untyped template dependencies are much more expressive than typed template dependencies, and their implication and finite implication problems are unsolvable [7, 121.  ...  Mainly, we show that there is a finite set of typed template dependencies whose implication and finite implication problems in the class of typed template dependencies are unsolvable.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/588145.588149">doi:10.1145/588145.588149</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/gy6vyni6azfazdbbqt2kut5vsq">fatcat:gy6vyni6azfazdbbqt2kut5vsq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20100621051927/http://www.cs.rice.edu/~vardi/papers/pods82rj.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7a/af/7aaf4f29748cd41f28e5576b4908f930706fdd49.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/588145.588149"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Page 3632 of Mathematical Reviews Vol. , Issue 85h [page]

<span title="">1985</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
Vardi, Moshe Y. (1-STF) 85h:68013 The implication and finite implication problems for typed template dependencies. J. Comput. System Sci. 28 (1984), no. 1, 3-28.  ...  It is also shown how to construct a finite set of typed template dependencies whose implication and finite implication problems are unsolvable.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1985-08_85h/page/3632" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1985-08_85h/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

The implication problem for data dependencies [chapter]

C. Beeri, M. Y. Vardi
<span title="">1981</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
In this paper we study the implication and the finite implication problems for data dependencies.  ...  For non-total dependencies the implication problem is unsolvable, and the finite implication problmm is not even partially solvable. Thus, there can be no formal system for finite implication.  ...  The (finite) implication problem of type (C I ; C2), where C I and C 2 are classes of dependencies is the (finite) implication problem for D = C I and d E C 2, That is, for such D,d decide whether D ~(  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-10843-2_7">doi:10.1007/3-540-10843-2_7</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hgnu5bqkg5bcbapm6a4zekxb4q">fatcat:hgnu5bqkg5bcbapm6a4zekxb4q</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180727070917/https://link.springer.com/content/pdf/10.1007%2F3-540-10843-2_7.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/1c/cb/1ccbe32f1f4de198c204b9786809e079f500fc5d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-10843-2_7"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Tools for Template Dependencies

Ronald Fagin, David Maier, Jeffrey D. Ullman, Mihalis Yannakakis
<span title="">1983</span> <i title="Society for Industrial &amp; Applied Mathematics (SIAM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/7dys7zoberdktmxyjciuy5bnse" style="color: black;">SIAM journal on computing (Print)</a> </i> &nbsp;
TOOLS FOR TEMPLATE DEPENDENCIES 37 from implication restricted to finite relations. In 0 8, we show that the conjunction of a finite set of full TD's is equivalent to a single full TD.  ...  Template dependencies (TD's) are a class of data dependencies that include multivalued and join dependencies and embedded versions of these.  ...  If finite implication and unrestricted implication were the same, then the decision problem would be decidable.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1137/0212003">doi:10.1137/0212003</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6vdvkjrj6fe6vd2i6n2d2it654">fatcat:6vdvkjrj6fe6vd2i6n2d2it654</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20060312040403/http://www.almaden.ibm.com/cs/people/fagin/sicomp83.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a8/61/a8610247fe0d4b549394986f2e7f10c2636ebb30.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1137/0212003"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Page 762 of Mathematical Reviews Vol. , Issue 84b [page]

<span title="">1984</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
The principal results are: (1) Finite implication (implication over relations with a finite number of tuples) is distinct from unrestricted implication for TDs. (2) There are, for TDs over three or more  ...  Authors’ summary: “Template dependencies (TDs) are a class of data dependencies that include multivalued and join dependencies and embedded versions of these.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1984-02_84b/page/762" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1984-02_84b/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Inclusion dependencies and their interaction with functional dependencies

Marco A. Casanova, Ronald Fagin, Christos H. Papadimitriou
<span title="">1982</span> <i title="ACM Press"> Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems - PODS &#39;82 </i> &nbsp;
It is shown that finite implication (implication over databases with a finite number of tuples) is the same as unrestricted implications for INDs, although finite implication and unrestricted implication  ...  (The decision problem for INDs is the problem of determining whether or not Z logically implies c, given a set Z of INDs and a single IND (T).  ...  Although the decision problem for FDs is decidable and the decision problem for INDs is decidable, we do not know whether the decision problem for FDs and INDs together is decidable.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/588140.588141">doi:10.1145/588140.588141</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wologqkhurfobiw3bf6pampw3e">fatcat:wologqkhurfobiw3bf6pampw3e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170811005558/http://www-di.inf.puc-rio.br/~casanova//Publications/Papers/1982-Papers/1982-PODS-Casanova-Fagin-Papadimitriu.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/81/b8/81b861aab64f0f0eb68e5afdaf8c77bd04c118ff.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/588140.588141"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Inclusion dependencies and their interaction with functional dependencies

Marco A. Casanova, Ronald Fagin, Christos H. Papadimitriou
<span title="">1982</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/xtq6wnwaszaebg4qf7aw6mllwi" style="color: black;">Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems - PODS &#39;82</a> </i> &nbsp;
It is shown that finite implication (implication over databases with a finite number of tuples) is the same as unrestricted implications for INDs, although finite implication and unrestricted implication  ...  (The decision problem for INDs is the problem of determining whether or not Z logically implies c, given a set Z of INDs and a single IND (T).  ...  Although the decision problem for FDs is decidable and the decision problem for INDs is decidable, we do not know whether the decision problem for FDs and INDs together is decidable.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/588111.588141">doi:10.1145/588111.588141</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/pods/CasanovaFP82.html">dblp:conf/pods/CasanovaFP82</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4wowqe4d5nb2zfapqf2mhnkdsq">fatcat:4wowqe4d5nb2zfapqf2mhnkdsq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170811005558/http://www-di.inf.puc-rio.br/~casanova//Publications/Papers/1982-Papers/1982-PODS-Casanova-Fagin-Papadimitriu.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/81/b8/81b861aab64f0f0eb68e5afdaf8c77bd04c118ff.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/588111.588141"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Inclusion dependencies and their interaction with functional dependencies

Marco A. Casanova, Ronald Fagin, Christos H. Papadimitriou
<span title="">1984</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/p6ovb2qpkfenhmb7mcksobrcxq" style="color: black;">Journal of computer and system sciences (Print)</a> </i> &nbsp;
It is shown that finite implication (implication over databases with a finite number of tuples) is the same as unrestricted implications for INDs, although finite implication and unrestricted implication  ...  In the case of finite implication, this result holds, even if no relation scheme has more than two attributes, and if all of the dependencies are unary (a dependency is wary if the left-hand side and right-hand  ...  ACKNOWLEDGMENTS The authors are grateful to David Johnson and Moshe Vardi, each of whom carefully read the paper and made helpful comments, and to Nick Pippenger for bringing Landau's result (mentioned  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0022-0000(84)90075-8">doi:10.1016/0022-0000(84)90075-8</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/a3enrupzmrgcdjbzygfznzqbkq">fatcat:a3enrupzmrgcdjbzygfznzqbkq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20130626163744/http://researcher.ibm.com/researcher/files/us-fagin/jcss84.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/1e/ac/1eac7a953a57dda2112cb759423c80ec723e429c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0022-0000(84)90075-8"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Page 4718 of Mathematical Reviews Vol. , Issue 84k [page]

<span title="">1984</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
We show that the theory of template dependencies given on abstract domains, each of which contains only two symbols, is complete for two subclasses of the class of two-sided template dependencies.”  ...  We also apply the algorithm to test implication of embedded multivalued dependencies, lossless joint dependencies, acyclic join dependencies, first-order hierarchical decompositions, and functional dependencies  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1984-11_84k/page/4718" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1984-11_84k/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

The inference problem for template dependencies

Yuri Gurevich, Harry R. Lewis
<span title="">1982</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/xtq6wnwaszaebg4qf7aw6mllwi" style="color: black;">Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems - PODS &#39;82</a> </i> &nbsp;
It is shown that the inference problem for template dependencies is undecidable, that is, there can be no algorithm for determining whether a given dependency is a logical consequence of a given finite  ...  A significant question about any class of dependencies is its inference problem: Given a finite set D of dependencies and a single dependency D 0, to determine whether D O is true in every database in  ...  Let D range over finite sets of (typed) template dependencies and let D O range over single (typed) template dependencies.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/588111.588148">doi:10.1145/588111.588148</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/pods/GurevichL82.html">dblp:conf/pods/GurevichL82</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ma57u5ndbnbczijm5qr2f66ioi">fatcat:ma57u5ndbnbczijm5qr2f66ioi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170706163542/https://deepblue.lib.umich.edu/bitstream/handle/2027.42/23841/0000080.pdf%3Bjsessionid%3D0809A78C6C1AEA217457F06D11152F7D?sequence%3D1" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/41/8a/418abbe8ce7a0a704c2f06b3578636c505f039ca.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/588111.588148"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

The inference problem for template dependencies

Yuri Gurevich, Harry R. Lewis
<span title="">1982</span> <i title="ACM Press"> Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems - PODS &#39;82 </i> &nbsp;
It is shown that the inference problem for template dependencies is undecidable, that is, there can be no algorithm for determining whether a given dependency is a logical consequence of a given finite  ...  A significant question about any class of dependencies is its inference problem: Given a finite set D of dependencies and a single dependency D 0, to determine whether D O is true in every database in  ...  Let D range over finite sets of (typed) template dependencies and let D O range over single (typed) template dependencies.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/588145.588148">doi:10.1145/588145.588148</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/uaxiqvevwja3pcjickmo5qw63a">fatcat:uaxiqvevwja3pcjickmo5qw63a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170706163542/https://deepblue.lib.umich.edu/bitstream/handle/2027.42/23841/0000080.pdf%3Bjsessionid%3D0809A78C6C1AEA217457F06D11152F7D?sequence%3D1" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/41/8a/418abbe8ce7a0a704c2f06b3578636c505f039ca.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/588145.588148"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

The inference problem for template dependencies

Yuri Gurevich, Harry R. Lewis
<span title="">1982</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/fbkexx2qg5anljkxraobuswdq4" style="color: black;">Information and Control</a> </i> &nbsp;
It is shown that the inference problem for template dependencies is undecidable, that is, there can be no algorithm for determining whether a given dependency is a logical consequence of a given finite  ...  A significant question about any class of dependencies is its inference problem: Given a finite set D of dependencies and a single dependency D 0, to determine whether D O is true in every database in  ...  Let D range over finite sets of (typed) template dependencies and let D O range over single (typed) template dependencies.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0019-9958(82)90420-x">doi:10.1016/s0019-9958(82)90420-x</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3nzyz7v5nrdjhohjh22gfn6suu">fatcat:3nzyz7v5nrdjhohjh22gfn6suu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170706163542/https://deepblue.lib.umich.edu/bitstream/handle/2027.42/23841/0000080.pdf%3Bjsessionid%3D0809A78C6C1AEA217457F06D11152F7D?sequence%3D1" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/41/8a/418abbe8ce7a0a704c2f06b3578636c505f039ca.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0019-9958(82)90420-x"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Turing machines with atoms, constraint satisfaction problems, and descriptive complexity

Bartek Klin, Sławomir Lasota, Joanna Ochremiak, Szymon Toruńczyk
<span title="">2014</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/kjskj3qctjdkbigtx4fkcqiyii" style="color: black;">Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) - CSL-LICS &#39;14</a> </i> &nbsp;
To this end, the determinization problem is expressed as a Constraint Satisfaction Problem, and a characterization is obtained from deep results in CSP theory.  ...  We characterize those alphabets for which Turing machines with atoms determinize.  ...  Acknowledgments We are grateful to Marcin Kozik for guiding us in the land of Constraint Satisfaction Problems, to Mikołaj Bojańczyk for inspiring discussions on sets with atoms, and to anonymous reviewers  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2603088.2603135">doi:10.1145/2603088.2603135</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/csl/KlinLOT14.html">dblp:conf/csl/KlinLOT14</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/whpzig7cnbhlzogjpkqpsuczbq">fatcat:whpzig7cnbhlzogjpkqpsuczbq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170813051240/https://www.mimuw.edu.pl/~ochremiak/papers/lics14.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/68/11/68119627017dc2ac0064a9d6bdbaafb97c535f0f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2603088.2603135"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 20,534 results