Filters








10,564 Hits in 2.4 sec

Towards Practical Tabled Abduction in Logic Programs [chapter]

Ari Saptawijaya, Luís Moniz Pereira
<span title="">2013</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;
Abduction in well-founded semantics and generalized stable models via tabled dual programs. Theory and Practice of Logic Programming, 4(4):383428, 2004.  ...  Adopt tabling in LP, for abductive solution reuse Solutions reuse in distinct context!  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-40669-0_20">doi:10.1007/978-3-642-40669-0_20</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/laryyw7sujbpxjmtqpdvlf7jiq">fatcat:laryyw7sujbpxjmtqpdvlf7jiq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829093840/http://peace.eas.asu.edu/iclp13/presentations/Tabled_Abduction_in_Logic_Programs.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/96/25/9625c55409a462865de56d8c9d31317904474e7e.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-642-40669-0_20"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Joint Tabling of Logic Program Abductions and Updates [article]

Ari Saptawijaya, Luís Moniz Pereira
<span title="2014-05-08">2014</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Taking this as a motivation, in this paper we integrate abductive logic programs and logic program updates by jointly exploiting tabling features of logic programming.  ...  ., tabled abduction and incremental tabling for query-driven propagation of logic program updates. A prototype of the integrated system is implemented in XSB Prolog.  ...  Tabled abduction with its prototype Tabdual, implemented in XSB Prolog (Swift and Warren 2012) , consists of a program transformation from abductive normal logic programs into tabled logic programs; the  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1405.2058v1">arXiv:1405.2058v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/k6cejelv45evfiiibllgovb5de">fatcat:k6cejelv45evfiiibllgovb5de</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200902040519/https://arxiv.org/pdf/1405.2058v1.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/b8/e2/b8e20bc481ec0376e16f86b85c8a426692a6c723.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1405.2058v1" 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>

TABLING WITH INTERNED TERMS ON CONTEXTUAL ABDUCTION

Muhammad Okky Ibrohim, Ari Saptawijaya
<span title="2019-03-01">2019</span> <i title="Faculty of Computer Science, Universitas Indonesia"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/vjhzmxa7rvg2lfitykvi2be25a" style="color: black;">Jurnal Ilmu Komputer dan Informasi</a> </i> &nbsp;
In this paper, we improve the tabling in contextual abduction technique with an advanced tabling feature of XSB Prolog, namely tabling with interned terms.  ...  Abduction (also called abductive reasoning) is a form of logical inference which starts with an observation and is followed by finding the best explanations.  ...  Kakas in providing the real world case of chemoprevention for this paper. Muhammad Okky Ibrohim acknowledges to Syukri M. A. Perkasa for his help in dealing with implementation issues.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.21609/jiki.v12i1.569">doi:10.21609/jiki.v12i1.569</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/nd4sgp2b4jg7ta4h4bcbivyv3i">fatcat:nd4sgp2b4jg7ta4h4bcbivyv3i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190803102904/http://jiki.cs.ui.ac.id/index.php/jiki/article/download/569/404" 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/7d/2b/7d2b06120a83a2418242f70205d10b4a4d9efcaa.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.21609/jiki.v12i1.569"> <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 2652 of Mathematical Reviews Vol. , Issue 2001D [page]

<span title="">2001</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;
(I-TRIN-IF; Turin) Conditional reasoning in logic programming. (English summary) Abductive logic programming. J. Logic Programming 44 (2000), no. 1-3, 37-74.  ...  This abstract machine, called the SLG-WAM, uses tabling to efficiently compute the well-founded semantics of non-ground normal logic programs in a goal-directed way.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_2001-04_2001d/page/2652" 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_2001-04_2001d/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Abductive Logic Programming

A. C. KAKAS, R. A. KOWALSKI, F. TONI
<span title="">1992</span> <i title="Oxford University Press (OUP)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/crzmi3qeiramtlvcrfycib3qg4" style="color: black;">Journal of Logic and Computation</a> </i> &nbsp;
Abduction in Logic Programming started in the late 80s, early 90s, in an attempt to extend logic programming into a framework suitable for a variety of problems in Artificial Intelligence and other areas  ...  This paper aims to chart out the main developments of the field over the last ten years and to take a critical view of these developments from several perspectives: logical, epistemological, computational  ...  Abductive Logic Programming This section presents briefly how abduction has been defined in the context of logic programming.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1093/logcom/2.6.719">doi:10.1093/logcom/2.6.719</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3voi2rfiujdsrllrrgbhbf2qzq">fatcat:3voi2rfiujdsrllrrgbhbf2qzq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20090625175320/http://www.math-info.univ-paris5.fr/~moraitis/webpapers/abduction-in-logic-programming.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/72/b6/72b6055caece535205692aefa4eea0b456d908ad.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1093/logcom/2.6.719"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> oup.com </button> </a>

Abduction in Logic Programming [chapter]

Marc Denecker, Antonis Kakas
<span title="">2002</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;
Abduction in Logic Programming started in the late 80s, early 90s, in an attempt to extend logic programming into a framework suitable for a variety of problems in Artificial Intelligence and other areas  ...  This paper aims to chart out the main developments of the field over the last ten years and to take a critical view of these developments from several perspectives: logical, epistemological, computational  ...  Abductive Logic Programming This section presents briefly how abduction has been defined in the context of logic programming.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-45628-7_16">doi:10.1007/3-540-45628-7_16</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/purq4epxdvbpdcno5r7duilxxa">fatcat:purq4epxdvbpdcno5r7duilxxa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170922060703/https://lirias.kuleuven.be/bitstream/123456789/124203/1/39495.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/cf/82/cf822cd8e4117c6f31dc18799e36cdc171cc6c9c.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-45628-7_16"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Extending Prolog with nonmonotonic reasoning

Weidong Chen
<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;
In particular, given an abductive logic program (P, A, I), where P is a logic program, A is a set of abducible predicates, and I is an integrity constraint.  ...  CHEN ABDUCTIVE REASONING WITH STABLE MODELS In [14] , stable models by Gelfond and Lifschitz [12] are used as a semantic basis for abductive logic programs.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0743-1066(95)00151-4">doi:10.1016/0743-1066(95)00151-4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qxjtfwogargabg235cf4upjfyq">fatcat:qxjtfwogargabg235cf4upjfyq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190415212657/https://core.ac.uk/download/pdf/82508237.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/c7/c0/c7c060679c90def742c352d9e35059fce69ccbd2.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(95)00151-4"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Titlepage, Table of Contents, Conference Organization

Manuel Hermenegildo, Torsten Schaub, Marc Herbstritt
<span title="2010-06-25">2010</span> <i > <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/lp3a6vqizfdbvlneh2os4i6swe" style="color: black;">International Conference on Logic Programming</a> </i> &nbsp;
LIPIcs is a series of high-quality conference proceedings across all fields in informatics.  ...  Communications Runtime Addition of Integrity Constraints in an Abductive Proof Procedure Marco Alberti, Marco Gavanelli, Evelina Lamma . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .  ...  Programming as Abductive Search Domenico Corapi, Alessandra Russo, Emil Lupu . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 54  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.iclp.2010.i">doi:10.4230/lipics.iclp.2010.i</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/iclp/HermenegildoS10.html">dblp:conf/iclp/HermenegildoS10</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fagmne74qjcfjorr72pifjlufu">fatcat:fagmne74qjcfjorr72pifjlufu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210415234043/https://drops.dagstuhl.de/opus/volltexte/2010/2616/pdf/10003.Inhaltsverzeichnis.2616.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/e1/6d/e16d842fcd4449e1ffe2b9c9cc8154bc2bd156a4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.iclp.2010.i"> <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;
Abduction ~ from observations and a theory, find using hypotheses an explanation for the * Corresponding  ...  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.  ...  All results for disjunctive logic programming abduction in Tables 4-6 remain valid for the restriction to positive disjunctive logic programs, where the stable semantics coincides with the minimal model  ... 
<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>

Towards Model Round-Trip Engineering: An Abductive Approach [chapter]

Thomas Hettel, Michael Lawley, Kerry Raymond
<span title="">2009</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;
Based on abductive logic programming, it allows us to compute a set of legitimate source changes that equate to a given change to the target model.  ...  Providing support for reversible transformations as a basis for round-trip engineering is a significant challenge in model transformation research.  ...  Abductive Logic Programming In this paper we adopt the much narrower interpretation of abduction as pursued by the logic programming and artificial intelligence community [4, 5] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-02408-5_8">doi:10.1007/978-3-642-02408-5_8</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/lccgzi75wnbhnpjhextde2pssu">fatcat:lccgzi75wnbhnpjhextde2pssu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170813090733/http://eprints.qut.edu.au/26413/2/HetLawRay0907.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/0b/4e/0b4e5f4bfeb2d5bd5278e0056fa9d5fc725c95d3.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-642-02408-5_8"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Equivalence issues in abduction and induction

Chiaki Sakama, Katsumi Inoue
<span title="">2009</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/gyhc4ppmyjfm5a64dneqesv7ka" style="color: black;">Journal of Applied Logic</a> </i> &nbsp;
Inoue and Sakama [9,10] study the problem of equivalence of abductive theories under first-order logic and abductive logic programming (ALP).  ...  Sakama and Inoue [18] study the corresponding problem in induction and compare conditions for different algorithms in inductive logic programming (ILP).  ...  It is observed that abductive logic programming is again harder than first-order abduction in general (Theorem 4.3). The complexity results are summarized in Table 1 .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.jal.2008.10.006">doi:10.1016/j.jal.2008.10.006</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/auy26ov35rhhrltgqjnotyqcl4">fatcat:auy26ov35rhhrltgqjnotyqcl4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170929000639/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/6f9/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMTU3MDg2ODMwODAwMDY3MA%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/a7/91/a7910f167037c2397c6575ca35ee5824b3e0e11d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.jal.2008.10.006"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Problem solving in ID-logic with aggregates: some experiments [article]

Bert Van Nuffelen, Marc Denecker
<span title="2000-03-08">2000</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
The ID-logic is an integration of typed classical logic and a definition logic. Different abductive solvers for this language are being developed.  ...  The goal of the LP+ project at the K.U.Leuven is to design an expressive logic, suitable for declarative knowledge representation, and to develop intelligent systems based on Logic Programming technology  ...  Marc Denecker is supported by the FWO project "Representation and Reasoning in OLP-FOL". We thank our colleagues from the DTAIgroup at the K.U.Leuven for the discussions and useful comments.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/cs/0003030v1">arXiv:cs/0003030v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3ef6kgh7ircqfjaxie2m3rulvu">fatcat:3ef6kgh7ircqfjaxie2m3rulvu</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-cs0003030/cs0003030.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> File Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/83/dc/83dc6bb2a5c198b6cd616e551bd67072d966a1fd.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/cs/0003030v1" 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>

Abductive logic programs with penalization: semantics, complexity and implementation

SIMONA PERRI, FRANCESCO SCARCELLO, NICOLA LEONE
<span title="">2005</span> <i title="Cambridge University Press (CUP)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/yhwvj6mbzza5tfz766tokherka" style="color: black;">Theory and Practice of Logic Programming</a> </i> &nbsp;
In this paper we study abduction with penalization in the logic programming framework.  ...  Abduction, first proposed in the setting of classical logics, has been studied with growing interest in the logic programming area during the last years.  ...  Unlike most of these previous works on abduction in the logic programming framework, in this paper we study abduction with penalization from logic programs.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1017/s1471068404002224">doi:10.1017/s1471068404002224</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pnrzhrek4jddbavuhyslmbprce">fatcat:pnrzhrek4jddbavuhyslmbprce</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20041205021447/http://www.icons.rodan.pl:80/publications/[Perri2004].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/78/0d/780d47cae53004a430c128b6c66b78ea9b2a4571.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1017/s1471068404002224"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> cambridge.org </button> </a>

Abductive Logic Programs with Penalization: Semantics, Complexity and Implementation [article]

Simona Perri, Francesco Scarcello, Nicola Leone
<span title="2003-10-24">2003</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In this paper we study abduction with penalization in the logic programming framework.  ...  Abduction, first proposed in the setting of classical logics, has been studied with growing interest in the logic programming area during the last years.  ...  Unlike most of these previous works on abduction in the logic programming framework, in this paper we study abduction with penalization from logic programs.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/cs/0310047v1">arXiv:cs/0310047v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zvacyw5ti5appkwrsdjhnzu6wy">fatcat:zvacyw5ti5appkwrsdjhnzu6wy</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-cs0310047/cs0310047.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> File Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/9f/45/9f45b8b1997d82c214adedcb6aed6448ccbb293d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/cs/0310047v1" 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 7826 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;
Logic Programming 31 (1997), no. 1-3, 39-58.  ...  In this pa- per, we investigate how abduction can be performed from theories in default logics. In particular, we present a basic model of ab- duction from default theories.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1997-12_97m/page/7826" 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>
&laquo; Previous Showing results 1 &mdash; 15 out of 10,564 results