Filters








33,380 Hits in 3.5 sec

Page 1765 of Mathematical Reviews Vol. , Issue 95c [page]

<span title="">1995</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;
Summary: “The Muscadet theorem prover is a knowledge-based system able to prove theorems in some nontrivial mathemati- cal domains.  ...  (English summary) Theorem proving and logic programming (1992). Ann. Math. Artificial Intelligence 8 (1993), no. 3-4, 425-447.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1995-03_95c/page/1765" 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_1995-03_95c/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Robust Computer Algebra, Theorem Proving, and Oracle AI [article]

Gopal P. Sarma, Nick J. Hay
<span title="2017-12-31">2017</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
One refers to modular systems queried for domain-specific tasks.  ...  On the other hand, we identify computer algebra systems (CASs) as being primitive examples of domain-specific oracles for mathematics and argue that efforts to integrate computer algebra systems with theorem  ...  We would also like to thank the guest editors of Informatica, Ryan Carey, Matthijs Maas, Nell Watson, and Roman Yampolskiy, for organizing this special issue.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1708.02553v2">arXiv:1708.02553v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hesasayvljb3vmjqsw7sniutdm">fatcat:hesasayvljb3vmjqsw7sniutdm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200908154853/https://arxiv.org/pdf/1708.02553v2.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/d0/d5d0a4a58c965d49ce1b5133df1fe40a3e0a1fd5.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1708.02553v2" 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>

Robust Computer Algebra, Theorem Proving, and Oracle AI

Gopal P. Sarma, Nick J. Hay
<span title="">2017</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/tol7woxlqjeg5bmzadeg6qrg3e" style="color: black;">Social Science Research Network</a> </i> &nbsp;
One refers to modular systems queried for domain-specific tasks.  ...  On the other hand, we identify computer algebra systems (CASs) as being primitive examples of domain-specific oracles for mathematics and argue that efforts to integrate computer algebra systems with theorem  ...  We would also like to thank the guest editors of Informatica, Ryan Carey, Matthijs Maas, Nell Watson, and Roman Yampolskiy, for organizing this special issue.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2139/ssrn.3038545">doi:10.2139/ssrn.3038545</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/w3bzqxgopbdwtbqvsckcsfdjoq">fatcat:w3bzqxgopbdwtbqvsckcsfdjoq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180426090819/http://www.informatica.si/index.php/informatica/article/viewFile/1873/1083" 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/7b/e5/7be577590168f67e0e1d17acfbe4fc4e65663bd3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2139/ssrn.3038545"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ssrn.com </button> </a>

The Measurement of Safety Criteria in Safety Critical Systems

Muhammed Basheer Jasser, University Putra Malaysia 43400 UPM Serdang, Selangor, Malaysia
<span title="2019-09-15">2019</span> <i title="The World Academy of Research in Science and Engineering"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/naqzxq5hurh2bp2pnvwitnnx44" style="color: black;">International Journal of Advanced Trends in Computer Science and Engineering</a> </i> &nbsp;
In this paper, we investigate the safety criteria and safety measurement via two specific domains: transportation systems and business intelligent systems.  ...  Also, these criteria are employed in our developed prototype for verifying the safety criteria of safety critical systems and supporting the management of safety critical systems.  ...  ACKNOWLEDGEMENTS Thanks to the Ministry of Higher Education (MOHE) and Research Management Center, Universiti Putra Malaysia (UPM) for the financial supports through FRGS Vote No: 08-01-15-1726FR  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.30534/ijatcse/2019/7881.42019">doi:10.30534/ijatcse/2019/7881.42019</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/aqzgdibpjvcclpphuhmbqfjbim">fatcat:aqzgdibpjvcclpphuhmbqfjbim</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220225142652/http://www.warse.org/IJATCSE/static/pdf/file/ijatcse78814sl2019.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/66/5a/665a4a970149854af676dc295805e6a611d89b9d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.30534/ijatcse/2019/7881.42019"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Page 6657 of Mathematical Reviews Vol. , Issue 90K [page]

<span title="">1990</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 termination of the synthesized by proving the validity of the specification. The termination of the synthesized program is also proved.” 90k:68152 68T15 03B35 Padron Pérez, O. M.  ...  Automatic theorem proving: the connection method. (Spanish. English summary) Cienc. Mat. (Havana) 9 (1988), no. 2, 65-77.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1990-11_90k/page/6657" 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_1990-11_90k/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Page 7825 of Mathematical Reviews Vol. , Issue 97M [page]

<span title="">1997</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;
Inductive theorem proving for design specifications.  ...  From the text: “We present a number of new results on inductive theorem proving for design specifications based on Horn logic with equality.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1997-12_97m/page/7825" 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_1997-12_97m/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

FREE LUNCH OR NO FREE LUNCH: THAT IS NOT JUST A QUESTION?

XIN-SHE YANG
<span title="">2012</span> <i title="World Scientific Pub Co Pte Lt"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/bmgus4fa7vg37kpnbuixwilqf4" style="color: black;">International journal on artificial intelligence tools</a> </i> &nbsp;
This paper discusses the recent results on no-free-lunch theorems and algorithm convergence, as well as their important implications for algorithm development in practice.  ...  Free lunches may exist for certain types of problem. In addition, we will highlight some open problems for further research.  ...  Free lunches: No-free-lunch theorems have not been proved for continuous domains for multiobjective optimization.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1142/s0218213012400106">doi:10.1142/s0218213012400106</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3eixjjeskbf7ffog7ptnyueosy">fatcat:3eixjjeskbf7ffog7ptnyueosy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200826000439/https://arxiv.org/pdf/1208.0527v1.pdf" title="fulltext PDF download [not primary version]" 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] <span style="color: #f43e3e;">&#10033;</span> <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/db/0e/db0e11a5aa29eb33bf34217098818de5deea9abf.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1142/s0218213012400106"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> worldscientific.com </button> </a>

Trends and Challenges in Formal Specification and Verification of Services Composition in Ambient Assisted Living Applications

Mohamed Hilia, Abdelghani Chibani, Karim Djouani
<span title="">2013</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/cx3f4s3qmfe6bg4qvuy2cxezyu" style="color: black;">Procedia Computer Science</a> </i> &nbsp;
In this paper, relevant challenges of the current AAL application development, with a focus on the formal specification and verification are discussed.  ...  In addition, the theorem proving tool provides a meta-proven logic for defining specification languages and techniques to take advantage of evidence and proof simplification.  ...  Linear Logic (ILL) theorem proving is presented.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.procs.2013.06.072">doi:10.1016/j.procs.2013.06.072</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/osci2qpz55fb7oqaqqithhe7ba">fatcat:osci2qpz55fb7oqaqqithhe7ba</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171003194126/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/d19/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMTg3NzA1MDkxMzAwNjgwNw%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/e0/b3/e0b397ebc5168f3ac659832f40751d3b2d807c5b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.procs.2013.06.072"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> elsevier.com </button> </a>

Page 3789 of Mathematical Reviews Vol. , Issue 88g [page]

<span title="">1988</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;
Specifically, we call the programs in this class canonical and we prove that, for any program P,, there exists a semantically equivalent program P, which is canonical.” 88g:68098 68T25 03B70 68N05 Togashi  ...  3789 88g:68093 68T20 Chapman, David (1-MIT-AI) Planning for conjunctive goals. Artificial Intelligence 32 (1987), no. 3, 333-377.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1988-07_88g/page/3789" 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_1988-07_88g/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Automated Conjecturing I: Fajtlowicz's Dalmatian Heuristic Revisited (Extended Abstract)

Craig E. Larson, Nico Van Cleemput
<span title="">2017</span> <i title="International Joint Conferences on Artificial Intelligence Organization"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/vfwwmrihanevtjbbkti2kc3nke" style="color: black;">Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence</a> </i> &nbsp;
Intelligent conjecture-making programs for a domain do not require developer expertise in that domain.  ...  It would also be useful to have an an "intelligent" counterexamplefinder. We do not know of one-or whether these would require domain-specific heuristics.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.24963/ijcai.2017/713">doi:10.24963/ijcai.2017/713</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/ijcai/LarsonC17.html">dblp:conf/ijcai/LarsonC17</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/iljdbdn3zjdrflobqdbzykocl4">fatcat:iljdbdn3zjdrflobqdbzykocl4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190429124332/https://www.ijcai.org/proceedings/2017/0713.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/ca/18/ca1844236984d4dca41a2def1d14d3045274fc06.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.24963/ijcai.2017/713"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Special Issue on User Interfaces in Theorem Proving: Preface

David Aspinall, Christoph Lüth
<span title="2007-06-14">2007</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2ewief65xnegfh2slwulpgsnba" style="color: black;">Journal of automated reasoning</a> </i> &nbsp;
Theorem proving is coming of age.  ...  Theorem provers ought to provide such search facilities, for theorems, definitions, and proofs.  ...  Again, restricting to a specific domain is a key to success.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10817-007-9075-0">doi:10.1007/s10817-007-9075-0</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ikxjp56qozhmbhqthymb7ntr7a">fatcat:ikxjp56qozhmbhqthymb7ntr7a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20110401095402/http://www.informatik.uni-bremen.de/~cxl/papers/uitp-jar.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/cd/a8/cda8074739841ba1abf3afc89f1bc6c37db7c4c3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10817-007-9075-0"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Page 8135 of Mathematical Reviews Vol. , Issue 2000k [page]

<span title="">2000</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;
In this work we present an approach for representing and _utiliz- ing domain-specific contro! knowledge.  ...  Artificial Intelligence Res. 11 (1999), 429-435 (electronic). Summary: “The assumptions needed to prove Cox’s theorem are discussed and examined.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_2000-11_2000k/page/8135" 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_2000-11_2000k/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Can Machines Design? An Artificial General Intelligence Approach [article]

Andreas Makoto Hein, Hélène Condat
<span title="2018-06-22">2018</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Recent advances in the field of computational creativity and formal Artificial General Intelligence (AGI) provide frameworks for machines with the general ability to design.  ...  Can they come up with creative solutions to problems and build tools and artifacts across a wide range of domains?  ...  Specifically, these are axioms for refinement, abstraction, composition, verification, and axioms that describe domain-specific rules based on domain-specific knowledge.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1806.02091v3">arXiv:1806.02091v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6et6ydddj5ambp7jyjcwvuqysi">fatcat:6et6ydddj5ambp7jyjcwvuqysi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200829032400/https://arxiv.org/pdf/1806.02091v3.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/5a/04/5a04d5b2b9ad280d21ab6174631a37015c17b516.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1806.02091v3" 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>

Will domain-specific code synthesis become a silver bullet?

W. Buntine, P. Norvig, J. Van Baalen, D. Spiegelhalter, A. Thomas
<span title="">1998</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/i6odselg2vhytkiryfsdh6fpjy" style="color: black;">IEEE Intelligent Systems and their Applications</a> </i> &nbsp;
is described as a theorem, and an automatic theorem prover generates a program as a byproduct of proving this theorem.  ...  We can use axioms to logically describe the relationship between input and output (the theorem proving approach).  ...  BUGS stores the component names and the model specification language's syntax in a file, which it uses to parameterize the Doo-dleBUGS parser.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/5254.671084">doi:10.1109/5254.671084</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5tncsmbhirebrarcd6s7vh6d4q">fatcat:5tncsmbhirebrarcd6s7vh6d4q</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170812041751/http://www.inf.ed.ac.uk/teaching/courses/seoc/2004_2005/resources/bullet18.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/bf/93/bf9301329cd451945c5146c373f4396bf52479a6.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/5254.671084"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Amphion: Automatic programming for scientific subroutine libraries [chapter]

Michael Lowry, Andrew Philpot, Thomas Pressburger, Ian Underwood
<span title="">1994</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;
The diagram also serves to document the specification. Program synthesis is based upon constructive theorem proving, and is efficient and totally automatic.  ...  A user is guided in creating a diagram that represents the formal specification through menus based upon the domain theory and the current state of the specification.  ...  Waldinger aided reformulating a version of the domain theory adapted to a previous theorem proving platform to SNARK's notation, and collaborated in running initial test cases through SNARK.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-58495-1_33">doi:10.1007/3-540-58495-1_33</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hip2w4btsngoxgxc7jym6er7me">fatcat:hip2w4btsngoxgxc7jym6er7me</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20090327011729/http://ti.arc.nasa.gov/m/tech/rse/publications/papers/ISMIS94/ISMIS94.final.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/20/0e/200e2012133ed9ce094005a0b0bc0da08fbb486e.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-58495-1_33"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 33,380 results