A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Filters
Forest logging: A trace-based analysis of large rule-based computations
2015
Semantic Web Journal
Preserved Fulltext
This problem, of profiling a computation, differs from debugging and justification which address why a given answer was or wasn't derived, and so profiling requires different techniques. ...
Knowledge representation systems based on the well-founded semantics can offer the degree of scalability required for semantic web applications and make use of expressive semantic features such as Hilog ...
Jahier and an anonymous reviewer for their comments, which have substantially improved the paper. ...
doi:10.3233/sw-140144
fatcat:ylte5bf3qvd53bewrrlciynkn4
Incremental Evaluation of Tabled Prolog: Beyond Pure Logic Programs
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
The algorithm is agnostic to whether a dependency adds or removes answers from tables, and hence can be applied uniformly to programs with negation, even when the negation is implicit (as is the case with ...
The current algorithms for incrementally maintaining memo tables treat insertion of facts/rules differently from their deletion. ...
Data Flow Analysis Reaching definition analysis for imperative programs is a wellknown data flow analysis which determines, for each program point, the set of variable definitions (assignments) that may ...
doi:10.1007/11603023_15
fatcat:jmgjd2akrvayrkyvgoceebto4m
Enhancing global SLS-resolution with loop cutting and tabling mechanisms
2004
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
SLTNF-resolution is sound and complete w.r.t. the well-founded semantics for logic programs with the bounded-term-size property, and is superior to existing linear tabling procedural semantics such as ...
Global SLS-resolution is a well-known procedural semantics for top-down computation of queries under the well-founded model. ...
Yi-Dong Shen is supported in part by Chinese National Natural Science Foundation and Trans-Century Training Programme Foundation for the Talents by the Chinese Ministry of Education. ...
doi:10.1016/j.tcs.2004.07.028
fatcat:dwem6pinjvdf7bgopob6prqc7q
Enhancing Global SLS-Resolution with Loop Cutting and Tabling Mechanisms
[article]
2005
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
SLTNF-resolution is sound and complete w.r.t. the well-founded semantics for logic programs with the bounded-term-size property, and is superior to existing linear tabling procedural semantics such as ...
Global SLS-resolution is a well-known procedural semantics for top-down computation of queries under the well-founded model. ...
Yi-Dong Shen is supported in part by Chinese National Natural Science Foundation and Trans-Century Training Programme Foundation for the Talents by the Chinese Ministry of Education. ...
arXiv:cs/0507035v1
fatcat:asxa7prmpfc6zkxshlpomc7vcu
Incremental Answer Completion in the SLG-WAM
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In the worst case, the cost of each ANSWER COMPLETION operation is proportional to the size of a program P , so that the operation must be invoked as rarely as possible, and when invoked the operation ...
This engine-level omission has not proven significant for applications so far, but the need for ANSWER COMPLETION is becoming important as XSB is more often used to produce well-founded residues of highly ...
COMPLETION: Given a completely evaluated set S of subgoals (Definition 3), for each S ∈ S, setM ark(T, complete), where T is the tree for S. 8. ...
doi:10.1007/978-3-642-02846-5_46
fatcat:gmmovx3hevg6lnqgnbri5yokla
Query Answering in Resource-Based Answer Set Semantics
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose a query-answering procedure reminiscent of Prolog for answer set programs under this extended semantics as an extension of XSB-resolution for logic programs with negation. ...
In recent work we defined resource-based answer set semantics, which is an extension to answer set semantics stemming from the study of its relationship with linear logic. ...
Acknowledgments The authors wish to thank the anonymous reviewers for their insightful comments. ...
arXiv:1608.01604v1
fatcat:nxksxko4svcuhkgtzdmoo3tyou
An abstract machine for tabled execution of fixed-order stratified logic programs
1998
ACM Transactions on Programming Languages and Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
This article describes the architecture of the SLG-WAM for a powerful class of programs, the class of fixed-order dynamically stratified programs. ...
We offer a detailed description of the algorithms, data structures, and instructions that the SLG-WAM adds to the WAM, and a performance analysis of engine overhead due to the extensions. ...
in the case of early completion. ...
doi:10.1145/291889.291897
fatcat:yk3bu7bmy5hp5b3fzzpzz2g2qa
Concurrent and Local Evaluation of Normal Programs
[chapter]
2008
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
Tabled evaluations can incorporate a number of features, including tabled negation, reduction with respect to the well-founded model, tabled constraints and answer subsumption. ...
However, these parallel approaches are restricted to definite programs, and have not yet been extended to other TLP functionality including well-founded negation, subgoal or answer subsumption, constrained ...
One of the operations, Answer Return is based on answer resolution, which is extended to take account of delay literals. Definition 3 (Answer Resolution). ...
doi:10.1007/978-3-540-89982-2_24
fatcat:5laxxb3sjbfa7hx5kyb7zptiha
Structural Resolution for Abstract Compilation of Object-Oriented Languages
2017
Electronic Proceedings in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2017 pre-print arXiv:1709.04902v1 fatcat:kujgcyjz5raq7gonww2v3ep4ae
We propose abstract compilation for precise static type analysis of object-oriented languages based on coinductive logic programming. ...
We also show how to transform logic programs to make them satisfy the preconditions for the operational semantics of structural resolution, and we prove this step does not affect the semantics of the logic ...
A Proofs of Soundness and Completeness of the Productivity Translation Definition 6. ...
doi:10.4204/eptcs.258.2
fatcat:jqoqs2xkizhsjdp47xmhcy6xha
Some Properties of Inverse Resolution in Normal Logic Programs
[chapter]
1999
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This paper studies the properties of inverse resolution in normal logic programs. The V-operators are known as operations for inductive generalization in definite logic programs. ...
The V-operators generalize a program P when P is definite, but this is not the case in the presence of negation as failure in general. Example 3.4. ...
Acknowledgements The author thanks Katsumi Inoue for comments on an earlier draft of this paper. ...
doi:10.1007/3-540-48751-4_26
fatcat:4dfel367arb3zormwroh64juwu
XSB: A system for efficiently computing well-founded semantics
[chapter]
1997
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The well-founded model provides a natural and robust semantics for logic programs with negative literals in rule bodies. We implemented the well-founded semantics in the SLG-WAM of XSB [19] . ...
To compute the well-founded semantics, the SLG-WAM adds to an efficient tabling engine for definite programs three operations --negative loop detection, delay and simplification --which serve to detect ...
In either case, if an answer is later found for A, the suspended derivation path is failed, while if A is determined to be completely evaluated with no answers, ~A is removed from the derivation path which ...
doi:10.1007/3-540-63255-7_33
fatcat:7iin72b67rfd3e3r6enjgi7ix4
Using call/exit analysis for logic program transformation
[chapter]
1994
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A technique for transformation of definite logic programs is presented. A first phase performs an analysis of the extended call/exit patterns of the source program. ...
The technique provides a framework which, combined with problem specific information concerning the source program, can lead to nontrivial transformations. ...
The basic ideas of.the approach allow to integrate in one toolkit lots of existing transformation techniques for definite logic programs [18, 13, 11, 12, 22, 23] combined with high level concepts to ...
doi:10.1007/3-540-58792-6_3
fatcat:v6z6mv775rdjzpfx3pfdw6ogpu
Question Meaning = Resolution Conditions
2017
Logic and Logical Philosophy
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In recent work on inquisitive semantics, a different perspective is taken: the meaning of a question is equated with its resolution conditions, just like the meaning of a statement is traditionally equated ...
Traditional approaches to the semantics of questions analyze questions indirectly, via the notion of an answer. ...
The ideas presented in this paper have benefited enormously from extensive discussions with Jeroen Groenendijk and Floris Roelofsen. ...
doi:10.12775/llp.2017.017
fatcat:fvabqtfwynbyjp3y53bxunhrwu
A Theoretical Study of (Full) Tabled Constraint Logic Programming
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
and in the answers. ...
Logic programming with tabling and constraints (TCLP, tabled constraint logic programming) has been shown to be more expressive and, in some cases, more efficient than LP, CLP, or LP with tabling. ...
Corollary 2 (Completeness of answer resolution using entailment). ...
arXiv:2009.14430v1
fatcat:akof6wma6zcr5jsyj7z5ji7kwm
Constructive negation under the well-founded semantics
1999
The Journal of Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
First, it supports reduction of constraint answers and redundant answer elimination and provides the first termination result for goal-oriented query evaluation with constructive negation for function-free ...
One is the detection of repeated subgoals and the elimination of redundant answers, which is required in order to guarantee termination. ...
Pereira, Terrance Swift and Carlos Damfisio for discussions on constructive negation and thank the anonymous referees for their careful reading of the paper and comments. ...
doi:10.1016/s0743-1066(98)10027-4
fatcat:ip64tayxxvfnrhhsvcjbcc7qyq
« Previous
Showing results 1 — 15 out of 300,355 results