Filters








1,235 Hits in 3.5 sec

Stream Reasoning on Expressive Logics [article]

Gulay Unel
<span title="2018-08-15">2018</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
assertional and terminological levels is very limited.  ...  Typically reasoning services on large knowledge bases are very expensive, and need to be applied continuously when the data is received as a stream.  ...  For the classification of subsumptions after an update, the axioms that each subsumption follows from is stored and if the update does not change any of these axioms it is guaranteed that the subsumption  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1808.04738v2">arXiv:1808.04738v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jnvdry2frfcd7g7vvz3v5dudk4">fatcat:jnvdry2frfcd7g7vvz3v5dudk4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200906231233/https://arxiv.org/pdf/1808.04738v2.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/e7/31/e731074187a00b4eff3a48f3e9eeaf2feebdcd98.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1808.04738v2" 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>

Single Time-Stamped Tries for Retroactive Call Subsumption [article]

Flavio Cruz, Ricardo Rocha
<span title="2011-12-16">2011</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Tabling is an evaluation strategy for Prolog programs that works by storing answers in a table space and then by using them in similar subgoals.  ...  Some tabling engines use call by subsumption, where it is determined that a subgoal will consume answers from a more general subgoal in order to reduce the search space and increase efficiency.  ...  Tabling by call subsumption is based on the principle that if A is subsumed by B and S A and S B are the respective answer sets, therefore S A ⊆ S B .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1112.3779v1">arXiv:1112.3779v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wxgkh5vayjhfjedkwknpcgsm5e">fatcat:wxgkh5vayjhfjedkwknpcgsm5e</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-1112.3779/1112.3779.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] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1112.3779v1" 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>

XSB: Extending Prolog with Tabled Logic Programming [article]

Terrance Swift, David S. Warren
<span title="2010-12-23">2010</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
TLP allows sophisticated programs to be written concisely and efficiently, especially when mechanisms such as tabled negation and call and answer subsumption are supported.  ...  The paradigm of Tabled Logic Programming (TLP) is now supported by a number of Prolog systems, including XSB, YAP Prolog, B-Prolog, Mercury, ALS, and Ciao.  ...  And we especially thank our user community who have helped us find and fix so many bugs over the years.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1012.5123v1">arXiv:1012.5123v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5ugxnnglebghxjukwc4rd2y6sy">fatcat:5ugxnnglebghxjukwc4rd2y6sy</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-1012.5123/1012.5123.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/07/b9/07b9f80ad8a03e01a78b8e5397d3be6256f318f3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1012.5123v1" 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>

Incremental Tabling in Support of Knowledge Representation and Reasoning

TERRANCE SWIFT
<span title="">2014</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;
tables are updated.  ...  In fact, such systems table by default all rules defined by users, unless they are simple facts.Performing dynamic updates within such systems is nearly impossible unless the tables themselves can be made  ...  For non-stratified programs, need to keep track of Once an OCCP has been altered, it is protected and need not be considered by further updates -you pay the price once per OCCP Performance Summary: (Pseudo  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1017/s1471068414000209">doi:10.1017/s1471068414000209</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4ppdw52ppjdffincwkykzyxjfm">fatcat:4ppdw52ppjdffincwkykzyxjfm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20150620233109/http://www3.cs.stonybrook.edu/~tswift/webtalks/iclp-14.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/7e/b2/7eb25936b8bec73d5cf5dde7286acf4fda9af612.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1017/s1471068414000209"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> cambridge.org </button> </a>

Retroactive Subsumption-Based Tabled Evaluation of Logic Programs [chapter]

Flávio Cruz, Ricardo Rocha
<span title="">2010</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
In this work, we present an extension, named Retroactive Call Subsumption, that supports call subsumption by allowing full sharing of answers between subsumed/subsuming subgoals, independently on the order  ...  While call variance has been a very popular approach, call subsumption can yield superior time performance and space improvements as it allows greater reuse of answers.  ...  This subgoal frame is represented by a global variable that is updated when a new generator is called or when it reaches the end of a program clause.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-15675-5_13">doi:10.1007/978-3-642-15675-5_13</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/paebhxy67rakhj2h2ppujtph24">fatcat:paebhxy67rakhj2h2ppujtph24</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808115229/http://www.cs.cmu.edu/~fmfernan/files/paper-jelia.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/17/10/1710ac7a7e71496d82defa97382424cb9c96fd13.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-15675-5_13"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Materialized views and data warehouses

Nick Roussopoulos
<span title="1998-03-01">1998</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/svqjiw2cwzftpcod3duuxcbveu" style="color: black;">SIGMOD record</a> </i> &nbsp;
A data warehouse is a redundant collection of data replicated from several possibly distributed and loosely coupled source databases, organized to answer OLAP queries.  ...  In this position paper, we summarize the versatility o f relational views and their potential.  ...  In this case, the update is combined with scanning and therefore, the cost of incremental update is subsumed by the scanning cost.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/273244.273253">doi:10.1145/273244.273253</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3ku6oxyxpjhm3cgoxwnzxylwdu">fatcat:3ku6oxyxpjhm3cgoxwnzxylwdu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170922064309/http://www.cs.umd.edu/~nick/papers/5newpos.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/c2/81/c281ed4840efc2d87b5effcad96ad235fed6d6e5.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/273244.273253"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Tabled CLP for Reasoning Over Stream Data

Joaquín Arias, Marc Herbstritt
<span title="2016-11-07">2016</span> <i > <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/lp3a6vqizfdbvlneh2os4i6swe" style="color: black;">International Conference on Logic Programming</a> </i> &nbsp;
The use of a constraint logic programming language will make it easier to translate the problem requirements into the code and will minimize the amount of re-engineering needed to comply with the requirements  ...  This is an important problem because we constantly have new sensors collecting information, new events from electronic devices and/or from customers and we want to reason about this information.  ...  17:7 count, it is relevant to take into consideration this research problem which is unclear and related with non-monotonic properties.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/oasics.iclp.2016.17">doi:10.4230/oasics.iclp.2016.17</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/iclp/Arias16.html">dblp:conf/iclp/Arias16</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qniyybgy2jck5hobe5jztjldse">fatcat:qniyybgy2jck5hobe5jztjldse</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220120064449/https://drops.dagstuhl.de/opus/volltexte/2016/6730/pdf/OASIcs-ICLP-2016-17.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/9f/b0/9fb091378a27b9a1abd16b7f864203b1365deac0.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/oasics.iclp.2016.17"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Evaluation of the Implementation of an Abstract Interpretation Algorithm using Tabled CLP

JOAQUÍN ARIAS, MANUEL CARRO
<span title="">2019</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;
That simplifies the code and improves performance, since termination, dependencies, and some crucial operations (e.g., branch switching and resumption) are directly handled by the tabling engine.  ...  Therefore, the tabling analyzer can reuse answers in more cases than an analyzer using syntactical equality.  ...  Thanks are also due to Manuel Hermenegildo, who gave us very valuable feedback on the paper manuscript and also a historical account on the early relationship between tabling and efficient abstract interpretation  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1017/s1471068419000383">doi:10.1017/s1471068419000383</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/yikav2352zg6jjxasnhnwor7j4">fatcat:yikav2352zg6jjxasnhnwor7j4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200311083703/https://www.cambridge.org/core/services/aop-cambridge-core/content/view/E068E56B538CB228C6751958AABCF73B/S1471068419000383a.pdf/div-class-title-evaluation-of-the-implementation-of-an-abstract-interpretation-algorithm-using-tabled-clp-div.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/be/8e/be8eed12822f0fa6af240d5bfdb7c71f8302d739.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1017/s1471068419000383"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> cambridge.org </button> </a>

Top-down and Bottom-up Evaluation Procedurally Integrated

DAVID S. WARREN
<span title="">2018</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;
AbstractThis paper describes how the Logic Programming System XSB combines top-down and bottom-up computation through the mechanisms of variant tabling and subsumptive tabling with abstraction, respectively.It  ...  This paper shows how to introduce into tabled logic program evaluation a bottom-up component, whose procedural intuition is the initialization of a data structure, in which a relation is initially computed  ...  This new machine uses that answer to update its state and then continues executing. The suspended machine remains suspended having marked in the table that that answer has been returned.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1017/s1471068418000194">doi:10.1017/s1471068418000194</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/kewfla4zpjeixlm4akia3duzni">fatcat:kewfla4zpjeixlm4akia3duzni</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190502023439/https://www.cambridge.org/core/services/aop-cambridge-core/content/view/03537A5898F2ABE28C484863832A5C47/S1471068418000194a.pdf/div-class-title-top-down-and-bottom-up-evaluation-procedurally-integrated-div.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/46/a5/46a54144566a0972dd6da24597d0b37d368e58ec.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1017/s1471068418000194"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> cambridge.org </button> </a>

Incremental Classification of Description Logics Ontologies

Bernardo Cuenca Grau, Christian Halaschek-Wiener, Yevgeny Kazakov, Boontawee Suntisrivaraporn
<span title="2010-01-12">2010</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;
This is an extended version of the papers published by the authors at ISWC-07 [7] and ESWC-08 [39]  ...  We have applied our results to incremental classification of OWL ontologies and found significant improvement over regular classification time on a set of real-world ontologies.  ...  Acknowledgements: This work has been supported by the European Union 6th Framework Program project TONES (Thinking ONtologieES, ref:IST-007603) and by the British Engineering and Physical Sciences Research  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10817-009-9159-0">doi:10.1007/s10817-009-9159-0</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/aflbig7cgbdjbeww4wxq447rme">fatcat:aflbig7cgbdjbeww4wxq447rme</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20110401054935/http://www.comlab.ox.ac.uk/files/2783/CueHalKazSunIncremental_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/ba/c5/bac5984417dfd99d33a8185864571bcd7234046a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10817-009-9159-0"> <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.  ...  The integration is based on and benefits from the two implementation techniques we separately devised previously, viz., tabled abduction and incremental tabling for query-driven propagation of logic program  ...  Given the advances of tabling features, like incremental tabling (Saha 2006 ) and answer subsumption (Swift and Warren 2010) , we have also explored these in addressing logic program updates.  ... 
<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>

A General Implementation Framework for Tabled CLP [chapter]

Pablo Chico de Guzmán, Manuel Carro, Manuel V. Hermenegildo, Peter Stuckey
<span title="">2012</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;
This paper describes a framework to combine tabling evaluation and constraint logic programming (TCLP).  ...  limitations with respect to the programs they can execute to completion (either with success or failure).  ...  Incremental solving simply updates the matrix using a new edge X − Y ≤ d and is O(n 2 ).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-29822-6_11">doi:10.1007/978-3-642-29822-6_11</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qfaiub2hiffcrpeu4wnffoltdy">fatcat:qfaiub2hiffcrpeu4wnffoltdy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20121114223854/http://www.clip.dia.fi.upm.es/papers/chico-tclp-flops2012.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/a1/c1/a1c13c1a20ae38439c2b49c2388a353481450354.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-29822-6_11"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Evolution of Ontologies using ASP

Max Ostrowski, Giorgos Flouris, Torsten Schaub, Grigoris Antoniou, Marc Herbstritt
<span title="2011-06-27">2011</span> <i > <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/lp3a6vqizfdbvlneh2os4i6swe" style="color: black;">International Conference on Logic Programming</a> </i> &nbsp;
In particular, our approach consists in providing a general translation of the problem into ASP, thereby reducing it to an instance of an ASP program that can be solved by an ASP solver.  ...  ASP was chosen for its advantages in terms of a principled, rather than ad hoc implementation, its modularity and flexibility, and for being a state-of-the-art technique to tackle hard combinatorial problems  ...  For the detailed logic program we refer to [15] . In this way we extend our change by deterministic consequences, to possibly reduce the number of incremental steps.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.iclp.2011.16">doi:10.4230/lipics.iclp.2011.16</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/iclp/OstrowskiFSA11.html">dblp:conf/iclp/OstrowskiFSA11</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/kftdagpncjalvcntfxixnfocia">fatcat:kftdagpncjalvcntfxixnfocia</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170811065257/http://users.ics.forth.gr/~fgeo/files/ICLP11.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/d2/ac/d2ac4161d9ed0ed501c054a807d770bd570672f7.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.2011.16"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Creating specialised integrity checks through partial evaluation of meta-interpreters

Michael Leuschel, Danny De Schreye
<span title="">1998</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;
Integrity constraints are useful for the specification of deductive databases, as well as for inductive and abductive logic programs.  ...  In this paper we propose a solution to this problem by using partial evaluation to pre-compile the integrity checking for certain update patterns.  ...  We are also grateful for discussions and extremely helpful comments by Hendrik Decker.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0743-1066(97)10012-7">doi:10.1016/s0743-1066(97)10012-7</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/kcnk65pcsjc3xkcgdjwyndj3dm">fatcat:kcnk65pcsjc3xkcgdjwyndj3dm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171002081418/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/b39/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDc0MzEwNjY5NzEwMDEyNw%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/0a/86/0a86a1de81e43480d974ad8dadc2832baeff9675.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0743-1066(97)10012-7"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Minerva: A Scalable OWL Ontology Storage and Inference System [chapter]

Jian Zhou, Li Ma, Qiaoling Liu, Lei Zhang, Yong Yu, Yue Pan
<span title="">2006</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;
User queries are answered by directly retrieving materialized results from the back-end database.  ...  With the increasing use of ontologies in Semantic Web and enterprise knowledge management, it is critical to develop scalable and efficient ontology management systems.  ...  Acknowledgements The authors would like to thank GuoTong Xie, Yang Yang, Jing Lu, Sheng-Ping Liu, Lei Li for their helpful discussions and constructive comments, Atanas Kiryakov and Damyan Ognyanov of  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11836025_42">doi:10.1007/11836025_42</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/kxqztul5bbgkxfmd2ogcby3aye">fatcat:kxqztul5bbgkxfmd2ogcby3aye</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170813094933/http://www.dis.uniroma1.it/%7Edegiacom/didattica/semingsoft/SIS05-06/seminari-studenti/07-04-04%20-%20SIS%20-%20Antonello%20Ercoli%20Alessandro%20Pezzullo%20-%20IBM%20Minerva/articoli/Minerva/Minerva_A_Scalable_OWL_Ontology_Repository.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/4a/20/4a2065b57f99e6ddd756089391665c35a35124f1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11836025_42"> <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 1,235 results