FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2019968021> ?p ?o ?g. }

• W2019968021 abstract "SLD resolution with negation as finite failure (or SLDNF) reflects the procedural interpretation of Horn-clause predicate logic as a programming language and forms the computational basis for prolog systems. Despite its advantages in memory management, SLDNF is often not appropriate for query evaluation for three reasons; a) it may not terminate due to infinite positive recursion; b) it may not terminate due to infinite recursion through negation; and c) it may repeatedly evaluate the same clause body literal, leading to unacceptable performance.We address all three problems for goal-oriented query evaluation of arbitrary programs by presenting an extension of SLDNF, called SLG resolution, with the following distinctive features:(i) SLG resolution is a partial deduction procedure, consisting of several transformations. Each query is transformed step by step into a set of answer clauses;(ii) SLG resolution is sound and ideally complete for all non-floundering queries with respect to all three-valued stable models (including the well founded partial model);(iii) SLG resolution allows an arbitrary computation rule and an arbitrary control strategy for selecting transformations to apply;(iv) SLG resolution avoids both positive and negative loops and always terminates for programs with the bounded-term-size property;(v) SLG resolution has a polynomial time data complexity for well founded negation.Restricted forms of SLG resolution are identified for definite, locally stratified, and modularly stratified programs, thereby shedding light on the role each transformation plays. To provide answers to a query under different three-valued stable models, SLG resolution can be enhanced by further processing of the derived set of answer clauses.SLG resolution makes many more clausal specifications into effective programs. With simple (user or computer generated) annotations, SLDNF resolution and SLG resolution can be fully integrated. Thus a system including SLG resolution can be fully integrated. Thus a system including SLG resolution is naturally upward compatible with Prolog. For all these reasons we believe that SLG resolution will provide the computational basis for the next generation of logic programming systems." @default.
• W2019968021 created "2016-06-24" @default.
• W2019968021 creator A5024584263 @default.
• W2019968021 creator A5055338447 @default.
• W2019968021 date "1993-01-01" @default.
• W2019968021 modified "2023-10-18" @default.
• W2019968021 title "Query evaluation under the well-founded semantics" @default.
• W2019968021 cites W137029384 @default.
• W2019968021 cites W1483740238 @default.
• W2019968021 cites W1520570153 @default.
• W2019968021 cites W1522225310 @default.
• W2019968021 cites W1528738961 @default.
• W2019968021 cites W1570025952 @default.
• W2019968021 cites W158383006 @default.
• W2019968021 cites W174273805 @default.
• W2019968021 cites W1766332311 @default.
• W2019968021 cites W194413726 @default.
• W2019968021 cites W194816663 @default.
• W2019968021 cites W1968513265 @default.
• W2019968021 cites W1971140053 @default.
• W2019968021 cites W1995303925 @default.
• W2019968021 cites W2012662948 @default.
• W2019968021 cites W2024612361 @default.
• W2019968021 cites W2031868932 @default.
• W2019968021 cites W2037035101 @default.
• W2019968021 cites W2050571300 @default.
• W2019968021 cites W2075610180 @default.
• W2019968021 cites W2100264125 @default.
• W2019968021 cites W2139875914 @default.
• W2019968021 cites W2176307201 @default.
• W2019968021 cites W22560161 @default.
• W2019968021 cites W2611415697 @default.
• W2019968021 cites W30202435 @default.
• W2019968021 cites W88836778 @default.
• W2019968021 cites W98332576 @default.
• W2019968021 doi "https://doi.org/10.1145/153850.153865" @default.
• W2019968021 hasPublicationYear "1993" @default.
• W2019968021 type Work @default.
• W2019968021 sameAs 2019968021 @default.
• W2019968021 citedByCount "73" @default.
• W2019968021 countsByYear W20199680212012 @default.
• W2019968021 countsByYear W20199680212013 @default.
• W2019968021 countsByYear W20199680212015 @default.
• W2019968021 countsByYear W20199680212016 @default.
• W2019968021 countsByYear W20199680212017 @default.
• W2019968021 countsByYear W20199680212018 @default.
• W2019968021 crossrefType "proceedings-article" @default.
• W2019968021 hasAuthorship W2019968021A5024584263 @default.
• W2019968021 hasAuthorship W2019968021A5055338447 @default.
• W2019968021 hasConcept C184337299 @default.
• W2019968021 hasConcept C199360897 @default.
• W2019968021 hasConcept C23123220 @default.
• W2019968021 hasConcept C41008148 @default.
• W2019968021 hasConceptScore W2019968021C184337299 @default.
• W2019968021 hasConceptScore W2019968021C199360897 @default.
• W2019968021 hasConceptScore W2019968021C23123220 @default.
• W2019968021 hasConceptScore W2019968021C41008148 @default.
• W2019968021 hasLocation W20199680211 @default.
• W2019968021 hasOpenAccess W2019968021 @default.
• W2019968021 hasPrimaryLocation W20199680211 @default.
• W2019968021 hasRelatedWork W1587224678 @default.
• W2019968021 hasRelatedWork W2013111119 @default.
• W2019968021 hasRelatedWork W2112962394 @default.
• W2019968021 hasRelatedWork W2118300983 @default.
• W2019968021 hasRelatedWork W2382501300 @default.
• W2019968021 hasRelatedWork W3137189469 @default.
• W2019968021 hasRelatedWork W3162240892 @default.
• W2019968021 hasRelatedWork W4235530921 @default.
• W2019968021 hasRelatedWork W4243252198 @default.
• W2019968021 hasRelatedWork W4245713008 @default.
• W2019968021 isParatext "false" @default.
• W2019968021 isRetracted "false" @default.
• W2019968021 magId "2019968021" @default.
• W2019968021 workType "article" @default.