Filters








24,232 Hits in 3.6 sec

Software engineering and automated deduction

Willem Visser, Nikolaj Bjørner, Natarajan Shankar
<span title="">2014</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/wvv27s77dvd5flktsj246kcxwu" style="color: black;">Proceedings of the on Future of Software Engineering - FOSE 2014</a> </i> &nbsp;
We focus on the underlying technology by which a number of these problems can be reduced to a logical form and answered using automated deduction.  ...  advances in automated deduction are also driven by software engineering requirements.  ...  The Value Proposition for Software Engineering Many software engineering tasks depend critically on the ability to solve logic problems.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2593882.2593899">doi:10.1145/2593882.2593899</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/icse/VisserBS14.html">dblp:conf/icse/VisserBS14</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/cdgga6syovar5hr4mfzjyyi4se">fatcat:cdgga6syovar5hr4mfzjyyi4se</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20150910150022/http://research.microsoft.com/en-US/people/nbjorner/fose14.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/24/2c/242ca09f373b6fcbe9cd469136522505ec2d395e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2593882.2593899"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Page 481 of Mathematical Reviews Vol. , Issue 96a [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;
But this is a book on automated deduction, not on foun- dations or applications of many-valued logics.  ...  Here also the resolution systems (which surely also belong to the future of automated deduction in many-valued logics) receive more attention.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1996-01_96a/page/481" 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-01_96a/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Automated Deduction: Looking Ahead

Donald W. Loveland
<span title="">1999</span> <i title="Association for the Advancement of Artificial Intelligence (AAAI)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/27wksbinzzhjfow2wuy6m2iefm" style="color: black;">The AI Magazine</a> </i> &nbsp;
In this article, the body of a report on automated deduction is presented that notes some significant achievements and takes a studied look at the future of the field. Articles  ...  the Technische Hochschule Darmstadt, Germany; Kamal Abdali, program director, Numeric, Symbolic, and Geometric Besides the contributions of the participants during the workshop itself, there were many  ...  M athematics and logic education are natural applications for automated deduction.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1609/aimag.v20i1.1442">doi:10.1609/aimag.v20i1.1442</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/journals/aim/Loveland99.html">dblp:journals/aim/Loveland99</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/quvjcbyot5fzfga27lzwp6pqwa">fatcat:quvjcbyot5fzfga27lzwp6pqwa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201031170712/https://www.aaai.org/ojs/index.php/aimagazine/article/download/1442/1341" 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/3d/5c/3d5cbdbfbc381f8060e24a917541b2a6ac01e475.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1609/aimag.v20i1.1442"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

A Survey of Automated Deduction [chapter]

Alan Bundy
<span title="">1999</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;
Automated deduction seemed a very good candidate for the automation of commonsense reasoning.  ...  Results from Mathematical Logic suggested that automatic deductive reasoners for rstorder, predicate logic could be built that were not only sound, i.e. only made correct deductions, but were also complete  ...  Many proof methods of use in automated deduction systems are for non-decidable fragments of theories.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-48317-9_6">doi:10.1007/3-540-48317-9_6</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/r7kti6fn2bcjbodyatqdq64wu4">fatcat:r7kti6fn2bcjbodyatqdq64wu4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170814212628/https://www.era.lib.ed.ac.uk/bitstream/handle/1842/3392/0001.pdf?sequence=1" 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/ab/07/ab074dd97e4b9a2ed2cbcae7377015ac91f8030e.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-48317-9_6"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Logic programming as a basis for lean automated deduction

Bernhard Beckert, Joachim Posegga
<span title="">1996</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/7qdabej4lbaczotmeg3ldn4ioy" style="color: black;">The Journal of Logic Programming</a> </i> &nbsp;
We see one reason for this in that implementation-oriented research in automated deduction favors huge and highly complex systems, which does not suit the needs of many applications: most existing automated  ...  However, many applications do not require deduction which is as complex as the state of the art in automated theorem proving.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0743-1066(96)00054-4">doi:10.1016/0743-1066(96)00054-4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5ijqotmno5gh5kl55cbez5jq7u">fatcat:5ijqotmno5gh5kl55cbez5jq7u</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190330145020/https://core.ac.uk/download/pdf/82411870.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/92/71/92717945d230fd9c9d20ac427fbc084dc7e748df.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0743-1066(96)00054-4"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Mathematical Logic and Deduction in Computer Science Education

Hashim HABIBALLA, Tibor KMET
<span title="2008-04-15">2008</span> <i title="Vilnius University Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/osbyyjgic5ajveytzyb7ztbu3q" style="color: black;">Informatics in Education. An International Journal</a> </i> &nbsp;
Further we discuss the possibilities of inclusion the non-classical (many-valued) logics in education together with the original generalization of the non-clausal resolution rule into fuzzy logic.  ...  Although in tertiary level computer science education it has a solid place, it does not hold also for secondary level education.  ...  Logic and Knowledge Representation in CSE The classical (two-valued) logic is a formalism known for many years.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.15388/infedu.2008.05">doi:10.15388/infedu.2008.05</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/nuiu6olbcfe57oy5y4fzhfk2vu">fatcat:nuiu6olbcfe57oy5y4fzhfk2vu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201108012631/https://hal.archives-ouvertes.fr/hal-00588769/file/Habiballa-Hashim-2008.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/0c/8a/0c8a9c7da34ed4103eb82ce6609aae3594e8a272.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.15388/infedu.2008.05"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Page 1292 of Mathematical Reviews Vol. , Issue 96c [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;
First, logic-specific translation calculi are used to generate clause forms for arbitrary formulas of a many-valued logic.  ...  (A-TUWN-CL,; Vienna) Resolution-based theorem proving for many-valued logics. (English summary ) J. Symbolic Comput. 19 (1995), no. 4, 353-391.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1996-03_96c/page/1292" 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-03_96c/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Page 1992 of Mathematical Reviews Vol. , Issue 94i [page]

<span title="">1994</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;
to clausal form for many-valued resolution.  ...  Summary: “A system is presented which, given a first-order finitely many-valued logic determined by truth tables, produces a sequent calculus, a natural deduction system, and a calculus for transfor- mation  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1994-09_94i/page/1992" 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_1994-09_94i/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Saturation-based theorem proving: Past successes and future potential [chapter]

Harald Ganzinger
<span title="">1996</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;
programming p. 216 Presenting machine-found proofs p. 221 MUltlog 1.0: towards an expert system for many-valued logics p. 226 CtCoq: a system presentation p. 231 An introduction to geometry  ...  Proof search with set variable instantiation in the calculus of constructions p. 658Search strategies for resolution in temporal logics p. 673Optimal axiomatizations for multiple-valued operators and quantifiers  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-61511-3_64">doi:10.1007/3-540-61511-3_64</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/iizfu32trnfadmj4z7xcvwds5y">fatcat:iizfu32trnfadmj4z7xcvwds5y</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190307194525/http://pdfs.semanticscholar.org/e613/30736546e8cc1cce8734e460452fe447380d.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/e6/13/e61330736546e8cc1cce8734e460452fe447380d.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-61511-3_64"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Non-Clausal Multi-ary a-Generalized Resolution Calculus for a Finite Lattice-Valued Logic

Yang Xu, Jun Liu, Xingxing He, Xiaomei Zhong, Shuwei Chen
<span title="">2018</span> <i title="Atlantis Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/wjdkfhqywrdefeqoyzjz3os76i" style="color: black;">International Journal of Computational Intelligence Systems</a> </i> &nbsp;
The present paper focuses on the resolution-based automated reasoning theory in a many-valued logic with truth-values defined in a lattice-ordered many-valued algebraic structure -lattice implication algebras  ...  Due to the need of the logical foundation for uncertain information processing, development of efficient automated reasoning system based on non-classical logics is always an active research area.  ...  Acknowledgments This work is supported by the National Science Foundation of China (Grant No. 61673320) and the Fundamental Research Funds for the Central Universities (Grant No. 2682017ZT12).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2991/ijcis.11.1.29">doi:10.2991/ijcis.11.1.29</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7x6aid2wxjgedox57jy74az5sq">fatcat:7x6aid2wxjgedox57jy74az5sq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180725122511/https://download.atlantis-press.com/article/25887945/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/09/0d/090d94b8dafe4a5ce77b0001886cb08118bebe17.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2991/ijcis.11.1.29"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

A Logical Formalisation of the Fellegi-Holt Method of Data Cleaning [chapter]

Agnes Boskovitz, Rajeev Goré, Markus Hegland
<span title="">2003</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 particular we show that the Fellegi-Holt method of "edit generation" is essentially the same as a technique for automating logical deduction called resolution.  ...  We recast the method in propositional logic, and show that many of its results are well-known results in propositional logic.  ...  Thank you to the three anonymous referees for their helpful suggestions, to Matt Gray for his efficient programming assistance, and to Andrew Slater for informative discussions about propositional satisfiability  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-45231-7_51">doi:10.1007/978-3-540-45231-7_51</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/apvgr36pvncx3fzykxfwqyl4lu">fatcat:apvgr36pvncx3fzykxfwqyl4lu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829142651/http://users.cecs.anu.edu.au/~rpg/Publications/DataCleaning/IDA2003FinalBoskovitzGoreHegland.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/18/bd/18bdbd0ddb2ee349603304ac52e256a0f238e3fd.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-45231-7_51"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Page 2369 of Mathematical Reviews Vol. , Issue 93e [page]

<span title="">1993</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;
A resolution proof framework is proposed on the basis of which automated proof systems for finitely many-valued first-order logics (FFO logics) can be introduced and studied.  ...  by a large class of deductive systems for propositional logics”.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1993-05_93e/page/2369" 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_1993-05_93e/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Logical and Meta-Logical Frameworks [chapter]

Frank Pfenning
<span title="">1999</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;
{ General | allow many meta-theorems and meta-proof techniques. { Automatable | support e cient automation of meta-proof search. Inherit as much as possible from the logical framework!  ...  . { No internal notion of deduction (logic vs. type theory) Inductive de nitions (FS 0 , many others) { No higher-order abstract syntax. { Deductions as objects (sometimes).Relies on hypothetical judgment  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/10704567_12">doi:10.1007/10704567_12</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mn33aso53jc6fmev6scszf4doe">fatcat:mn33aso53jc6fmev6scszf4doe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20150329043933/http://www.cs.cmu.edu/~fp/talks/ppdp99-talk.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/f6/c8/f6c8ce064d61e791b8223968bc59447e171582c6.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/10704567_12"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Automated deduction in a graphical temporal logic

L. E. Moser, P. M. Melliar-Smith, Y. S. Ramakrishna, G. Kutty, L. K. Dillon
<span title="">1996</span> <i title="Informa UK Limited"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/5dxceprzerhvngc2dulzkx45le" style="color: black;">Journal of Applied Non-Classical Logics</a> </i> &nbsp;
We have implemented an automated deduction system for Graphical Interval Logic that includes a graphical user interface and an automated theorem prover.  ...  In this paper we describe the logic, the automated deduction system, and an application to robotics.  ...  The core of the automated deduction system is a theorem prover that checks the validity of deductions in the logic and generates counterexamples for invalid proofs.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1080/11663081.1996.10510865">doi:10.1080/11663081.1996.10510865</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/p4z2ltt65jawnf3v3yddk6vqcq">fatcat:p4z2ltt65jawnf3v3yddk6vqcq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170814041745/http://www.aaai.org/Papers/Symposia/Fall/1993/FS-93-01/FS93-01-013.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/a2/ff/a2ff82aa43131fe6784ca065b6d57927908cdc47.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1080/11663081.1996.10510865"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> tandfonline.com </button> </a>

Deduction modulo theory [article]

Gilles Dowek
<span title="2015-01-26">2015</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
This paper is a survey on Deduction modulo theory  ...  Models The usual models of classical Predicate logic, valued in {0, 1}, can be used for Deduction modulo theory.  ...  So Deduction modulo theory comes from automated theorem proving.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1501.06523v1">arXiv:1501.06523v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6g6jl4gthzahdmg55eegcg54yi">fatcat:6g6jl4gthzahdmg55eegcg54yi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200831171758/https://arxiv.org/pdf/1501.06523v1.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/e3/e3/e3e3276148e51c161ecd8d6128fcc89bd4e86758.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1501.06523v1" 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>
&laquo; Previous Showing results 1 &mdash; 15 out of 24,232 results