Filters








1,511,788 Hits in 4.5 sec

Logic programming and autoepistemic logics: New relations and complexity results [chapter]

Marco Schaerf
<span title="">1993</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;
These relations are then used to prove the computational complexity of reasoning with the positivistic and minimally-supported model semantics, as well as new complexity results for restricted subsets  ...  In this paper we show a one-to-one mapping between the positivistic models and moderately-grounded expansions of autoepistemic logic and a one-to-one correspondence between the minimally-supported models  ...  Let P be a program and M one of its models. We say that M is a supported model of P Notice that the set of positivistic models and the set of supp-minimal models are distinct.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-57292-9_51">doi:10.1007/3-540-57292-9_51</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xdadvkjmybemrex5qpetraiiwm">fatcat:xdadvkjmybemrex5qpetraiiwm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190226101648/http://pdfs.semanticscholar.org/6fe1/e92a676066965821b28677d5c69d4ac99ab7.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/6f/e1/6fe1e92a676066965821b28677d5c69d4ac99ab7.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-57292-9_51"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Measuring prime program complexity

M Zelkowitz
<span title="">1994</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ozlq63ehnjeqxf6cuxxn27cqra" style="color: black;">Information Sciences</a> </i> &nbsp;
This paper uses the prime program decomposition of a program as the basis for a measure that closely correlates with our intuitive notion of program complexity.  ...  This measure is based upon the information theory ideas of randomness and entropy such that results about structured programming, data abstractions, and other programming paradigms can be stated in quantitative  ...  From Theorem 4.1, if Ycomputes the minimal complexity of a set of programs P of sizes up to N, then for p E P, 9(p) G IpI + c for some constant c.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0020-0255(94)90007-8">doi:10.1016/0020-0255(94)90007-8</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/inoehefrhzdrdnef42lnntjdem">fatcat:inoehefrhzdrdnef42lnntjdem</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809033302/https://www.cs.umd.edu/users/mvz/pub/zelkowitz-tian-1994.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/25/76/25765f35425be39a78b1ff999e681e12c99f9d28.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0020-0255(94)90007-8"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Quantitative and qualitative information in computations

Robert P. Daley
<span title="">1980</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;
One is the minimal-program complexity of the sequences and represents a quantitative information content, and the other is the degree of unsolvability of the underlying set and represents a qualitative  ...  In this paper two notions of information content for the characteristic sequences of sets are compared.  ...  For example, must all recursively enumerable sets with such high minimal-program complexity be completed Also, do sequences with equal minimal-program complexity have equal degree of unsolvability?  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0019-9958(80)90615-4">doi:10.1016/s0019-9958(80)90615-4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/f62popptmjfcpprgkjlh6njg4u">fatcat:f62popptmjfcpprgkjlh6njg4u</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171002081812/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/b3a/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDAxOTk5NTg4MDkwNjE1NA%3D%3D.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/db/89/db8956541a67c4b305641d17a65c85c36bd2be5f.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(80)90615-4"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Algorithmic statistics

P. Gacs, J.T. Tromp, P.M.B. Vitanyi
<span title="">2001</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/niovmjummbcwdg4qshgzykkpfu" style="color: black;">IEEE Transactions on Information Theory</a> </i> &nbsp;
information (minimal sufficient statistics) are at least as complex as the objects themselves.  ...  Index Terms-Algorithmic information theory, description format (explicit, implicit), foundations of statistics, Kolmogorov complexity, minimal sufficient statistic (algorithmic), mutual information (algorithmic  ...  Levin for some enlightening discussions on Kolmogorov's "structure function."  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/18.945257">doi:10.1109/18.945257</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qe7s4mib4vff5eawevwxdrgwyu">fatcat:qe7s4mib4vff5eawevwxdrgwyu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20061207093857/http://homepages.cwi.nl:80/~paulv/papers/algorithmicstatistics.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/43/9a/439af37a1f14ce70407c7f8acc5ea4519138eb26.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/18.945257"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Learning efficient logic programs

Andrew Cropper, Stephen H. Muggleton
<span title="2018-04-23">2018</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/h4nnd7sxwzcwhetu5qkjbcdh6u" style="color: black;">Machine Learning</a> </i> &nbsp;
We prove that given sufficiently large numbers of examples, Metaopt converges on minimal cost programs, and our experiments show that in practice only small numbers of examples are needed.  ...  To learn minimal time-complexity programs, including non-deterministic programs, we introduce a cost function called tree cost which measures the size of the SLD-tree searched when a program is given a  ...  We denote the power set of the set S as 2 S .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10994-018-5712-6">doi:10.1007/s10994-018-5712-6</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6q3534y7cfai7m756xhcmvuply">fatcat:6q3534y7cfai7m756xhcmvuply</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20181030050021/https://link.springer.com/content/pdf/10.1007%2Fs10994-018-5712-6.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/f2/c4/f2c4a255c753a7364efbbd5c30764e31911be00f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10994-018-5712-6"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Plain Stopping Time and Conditional Complexities Revisited

Mikhail Andreev, Gleb Posobin, Alexander Shen, Michael Wagner
<span title="2018-08-20">2018</span> <i > <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/5b35w7jagjckfngb6pj76nbam4" style="color: black;">International Symposium on Mathematical Foundations of Computer Science</a> </i> &nbsp;
It turns out that plain stopping time complexity of a binary string x could be equivalently defined as (a) the minimal plain complexity of a Turing machine that stops after reading x on a one-directional  ...  input tape; (b) the minimal plain complexity of an algorithm that enumerates a prefix-free set containing x; (c) the conditional complexity C(x | x * ) where x in the condition is understood as a prefix  ...  versions of this paper.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.mfcs.2018.2">doi:10.4230/lipics.mfcs.2018.2</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/mfcs/AndreevPS18.html">dblp:conf/mfcs/AndreevPS18</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/gwlrjjujqbdjzc4uhevj3gx6zi">fatcat:gwlrjjujqbdjzc4uhevj3gx6zi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220131084639/https://drops.dagstuhl.de/opus/volltexte/2018/9584/pdf/LIPIcs-MFCS-2018-2.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/a6/e5/a6e52690ffbd0b0d8a93ce3404d6b8709e8f7234.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.mfcs.2018.2"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Kolmogorov's Structure Functions and Model Selection

N.K. Vereshchagin, P.M.B. Vitanyi
<span title="">2004</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/niovmjummbcwdg4qshgzykkpfu" style="color: black;">IEEE Transactions on Information Theory</a> </i> &nbsp;
Let data be finite binary strings and models be finite sets of binary strings. Consider model classes consisting of models of given maximal (Kolmogorov) complexity.  ...  The "structure function" of the given data expresses the relation between the complexity level constraint on a model class and the least log-cardinality of a model in the class containing the data.  ...  Those having minimal complexity are called minimal optimal sets (and their programs minimal sufficient statistics).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tit.2004.838346">doi:10.1109/tit.2004.838346</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/gurvcw7pivbwzgbp4clynqbu5i">fatcat:gurvcw7pivbwzgbp4clynqbu5i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20060907132457/http://homepages.cwi.nl:80/~paulv/papers/structure.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/2f/97/2f97ffdf6420f762586c7d55460f0a2ac8e6b0c7.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tit.2004.838346"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

The Least Wrong Model Is Not in the Data [article]

Oscar Stiffelman
<span title="2014-04-17">2014</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
The best model includes all of the information contained in the minimal description of the data that is not contained in the data.  ...  Prediction requires a model of the probability that a process, chosen randomly from the set of candidate explanations, generates some future observation.  ...  However, if some program can be found that generates w from x * , then the length of that program is an upper bound on the length of the minimal program. Let h(w) indicate the best computable model.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1404.0789v3">arXiv:1404.0789v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ekkkr6xwxbec3kdkik5nuzgxs4">fatcat:ekkkr6xwxbec3kdkik5nuzgxs4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200929105716/https://arxiv.org/pdf/1404.0789v3.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/9a/01/9a01776dc00653ea1b6363088741ee3c992b5485.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1404.0789v3" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Page 6975 of Mathematical Reviews Vol. , Issue 96k [page]

<span title="">1996</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 notions of minimal and stable models of a logic program have natural gener- alizations to the case of ¥-programs. In this paper, the resulting notions are called minimal and stable answer sets.  ...  We study the com- plexity of determining the existence of minimal answer sets, and that of determining the membership of a formula in all minimal 68N Software 96k:68026 answer sets.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1996-11_96k/page/6975" 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_1996-11_96k/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Towards an Algorithmic Statistics [chapter]

Peter Gács, John Tromp, Paul Vitányi
<span title="">2000</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;
We develop a new algorithmic theory of typical statistic, su cient statistic, and minimal su cient statistic.  ...  While Kolmogorov complexity is the accepted absolute measure of information content of an individual nite object, a similarly absolute notion is needed for the relation between an individual data sample  ...  Clearly, such objects x have neither minimal nor maximal complexity: if they have minimal complexity then the singleton set fxg is a minimal su cient statistics of small complexity, and if x 2 f0; 1g n  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-40992-0_4">doi:10.1007/3-540-40992-0_4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/673bcuz4vvcrliz73oqnt3h2mq">fatcat:673bcuz4vvcrliz73oqnt3h2mq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190303095613/http://pdfs.semanticscholar.org/b375/b17b076141a207c6337509ec05e78de16dda.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/b3/75/b375b17b076141a207c6337509ec05e78de16dda.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-40992-0_4"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

A detailed comparison of current docking and scoring methods on systems of pharmaceutical relevance

Emanuele Perola, W. Patrick Walters, Paul S. Charifson
<span title="2004-04-28">2004</span> <i title="Wiley"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/fkowqlvuffe5lnyfwblj3fcp7i" style="color: black;">Proteins: Structure, Function, and Bioinformatics</a> </i> &nbsp;
The generation of a large and highly curated test set of pharmaceutically relevant protein-ligand complexes with known binding affinities is described, and three highly regarded docking programs (Glide  ...  , GOLD, and ICM) are evaluated on the same set with respect to their ability to reproduce crystallographic binding orientations.  ...  As a demonstration of this, in the study described in the Docking section, all three programs performed poorly on the 9 HIV-1 protease complexes included in the test set.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/prot.20088">doi:10.1002/prot.20088</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/15211508">pmid:15211508</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jf65lm2j3fdoxgeiqnhrr7rhua">fatcat:jf65lm2j3fdoxgeiqnhrr7rhua</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808155549/http://binf.gmu.edu/vaisman/binf731/prot04-perola-docking.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/c6/41/c641c6629f60261e1f19ef03629aa449912de9de.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/prot.20088"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> wiley.com </button> </a>

Explanations for Negative Query Answers under Existential Rules

İsmail İlkan Ceylan, Thomas Lukasiewicz, Enrico Malizia, Cristian Molinaro, Andrius Vaicenavičius
<span title="">2020</span> <i title="International Joint Conferences on Artificial Intelligence Organization"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/rvkvdehfubaondjmd5y6i6rewe" style="color: black;">Proceedings of the Seventeenth International Conference on Principles of Knowledge Representation and Reasoning</a> </i> &nbsp;
For all considered problems, we give a detailed complexity analysis for a wide range of existential rule languages and complexity measures.  ...  A major advantage of ontological reasoning is its interpretability, which allows one to derive explanations for query answers.  ...  The reason is that for such problems, consistency checking can be done in P in the fp-combined complexity, as the program is fixed, and it is not required to check minimality of a guessed set.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.24963/kr.2020/23">doi:10.24963/kr.2020/23</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/kr/CeylanLMMV20.html">dblp:conf/kr/CeylanLMMV20</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/rtjlsqsp2jcnnejfxzmsrmzja4">fatcat:rtjlsqsp2jcnnejfxzmsrmzja4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201211172710/https://proceedings.kr.org/2020/23/kr2020-0023-ceylan-et-al.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/d5/cb/d5cbf9be1c83f46db2b77df447d7fd269ab0cee6.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.24963/kr.2020/23"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Abduction from logic programs: Semantics and complexity

Thomas Eiter, Georg Gottlob, Nicola Leone
<span title="">1997</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/elaf5sq7lfdxfdejhkqbtz6qoq" style="color: black;">Theoretical Computer Science</a> </i> &nbsp;
Acknowledgements The authors would like to thank the referees for their valuable and instructive comments that helped to improve the presentation of this paper.  ...  In particular, Section 3.2 was proposed by a referee; it greatly improves understanding of the relationships between the different abduction problems investigated, and simplified proofs.  ...  In logic programming abduction, however, C-minimality does affect relevance, and leads to an increase in the complexity by one level of the pol~omial hierarchy.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0304-3975(96)00179-x">doi:10.1016/s0304-3975(96)00179-x</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tks5uin32fcxhibfmrrar54fqu">fatcat:tks5uin32fcxhibfmrrar54fqu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190315020029/https://core.ac.uk/download/pdf/82034546.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/4d/60/4d60352f26592cf38ab4c68384bb680c1e6de92e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0304-3975(96)00179-x"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Informatics — The Science of Minimal Systems with Maximal Complexity [chapter]

Andreas Schwill
<span title="">2003</span> <i title="Springer US"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/kss7mrolvja63k4rmix3iynkzi" style="color: black;">IFIP Advances in Information and Communication Technology</a> </i> &nbsp;
It is a fundamental idea of computer science to search for, define, analyze, and operate with construction kits consisting of small sets of basic building blocks and a small number of operations to combine  ...  While the construction kit is mostly simple, it often defines a vast, complex field that consists of all possible objects that · can be built from the building blocks by using any (finite) sequence of  ...  For certain x either f" is bounded or unbounded and the Julia set associated to f is defined to be the set of complex values x where f" lies on the boundary.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-0-387-35663-1_2">doi:10.1007/978-0-387-35663-1_2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/b5kiejxnyjh4hblsrskmryanbu">fatcat:b5kiejxnyjh4hblsrskmryanbu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180724134257/https://link.springer.com/content/pdf/10.1007%2F978-0-387-35663-1_2.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/ce/99/ce997ce5509e5c6d26da5d93670617826f0ae9a9.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-0-387-35663-1_2"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Page 1703 of Mathematical Reviews Vol. , Issue 86d [page]

<span title="">1986</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;
Author summary: “We study the computational complexity of sets of different densities in NP.  ...  Author summary: “We show that, given a collection F of func- tions from a finite set D to itself, one can, in polynomial time, find a composition f of functions in F for which the size of f(D) is minimized  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1986-04_86d/page/1703" 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_1986-04_86d/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 1,511,788 results