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.
Filters
On Van Gelder's loop detection algorithm
1992
The Journal of Logic Programming
Preserved Fulltext
execution of a Prolog program. ...
The incorrectness of Van Gelder's algorithm for loop detection in Prolog is shown. a In [l], an algorithm is proposed for the detection of a certain kind of infinite loops in the depth-first parts of the ...
* 182 DIMITER SKORDEV Consider for example the degenerated propositional Prolog program consisting only of the fact p. Let the query ? -p, p be evaluated. ...
doi:10.1016/0743-1066(92)90051-4
fatcat:i5iwpxzvgvaxzisttv3w3mzgma
On the detection of some periodic loops during the execution of Prolog programs
1993
Banach Center Publications
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.
Lettmann; the discussions with them helped the author to better feel some specific features of the above problem in the case of Prolog programs. The author is also very grateful to Professor Dr. E. ...
The author is indebted to the participants of the Institute Seminar for useful comments concerning the loop detection problem. Special thanks are due to Professor Dr. H. Kleine Büning and to Dr. Th. ...
sort of loops is that such loops are not typical for the execution of Prolog programs and therefore it would be very insufficient to be able to detect only them. ...
doi:10.4064/-28-1-151-166
fatcat:bhsolzgzpfatlllggspr4rv7hu
A logical reconstruction of Prolog II
1984
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 2017; you can also visit the original URL.
The file type is application/pdf.
Colmerauer has proposed a theoretical model for Prolog II based on tree rewriting rather than logic. In this paper, we show that Prolog II can be regarded as a logic programming language. a ...
Proposition 2. Let P be a program, P' its homogeneous form, G a goal, and E the above equality theory for Prolog II. If Prolog II solves the goal G, then P' U E U { G } is unsatisfiable. ...
Thus G is false in M' and hence in M. Hence P U { G } is unsatisfiable. •I Proposition 1 shows that the equality theory for Prolog is the single axiom Vx x = x. ...
doi:10.1016/0743-1066(84)90001-3
fatcat:jx5cwogbpjcqhlm5k3bayat3ua
Analysis of Logic Programs with Delay
[chapter]
1998
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 2018; you can also visit the original URL.
The file type is application/pdf.
The paper focuses on practical analyses for logic programs with delay. The method described is for downward-closed program properties and, in particular, groundness. ...
A program transformation is deÞned which eliminates the delay statements but still enables an accurate approximation of the behaviour of delayed goals to be traced by the analyser. ...
Groundness analysis detects which program variables are bound to ground terms and is important in detecting determinacy, simplifying uniÞcation, etc. ...
doi:10.1007/3-540-49674-2_8
fatcat:pjxrqpky5bfaxkbuwikp3iklxq
Efficient Description Logic Reasoning in Prolog: The DLog system
[article]
2009
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.
Other Versions
To appear in Theory and Practice of Logic Programming (TPLP). ...
DLog transforms Description Logic axioms into a Prolog program and uses the standard Prolog execution for efficiently answering instance retrieval queries. ...
Finally, we would like to thank the anonymous reviewers whose valuable suggestions were of great help in improving the quality of the paper. ...
arXiv:0904.0578v2
fatcat:ujd7bemwx5bi3gjxeixxe5dpoa
Measuring Coverage of Prolog Programs Using Mutation Testing
[article]
2018
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.
Yet, frameworks for logic programs remain scarce. In this paper, we introduce a framework for Prolog programs measuring test coverage using mutations. ...
To do so, we discuss the usefulness of different mutations in the context of Prolog and empirically evaluate them in a new mutation testing framework on different examples. ...
To give a short impression of the complexity of a program, we list the number of predicates, clauses and lines of code for each Prolog program in Table 2 . ...
arXiv:1808.07725v1
fatcat:nygxqcf7tjfdvigm6qcicraf3a
Book announcements
1996
Discrete Applied Mathematics
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.
Chapter I: Propositional Logic. Orders and trees. Propositions,
connectives and truth
tables. Truth assignments
and valuations.
Tableau proofs in propositional
calculus. ...
Chapter III: PROLOG. SLD-resolution.
Implementations:
Searching and back-
tracking. Controlling
the implementation:
Cut. Termination
conditions for PROLOG
programs. Equality. ...
doi:10.1016/0166-218x(96)90069-4
fatcat:eswucpcizbfdxbpbqejedzpsyu
Extending Prolog with nonmonotonic reasoning
1996
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.
The dependency maintenance for detecting completion of tabled calls can also be used for detecting tabled calls that are possibly involved in loops through negation. ...
Assuming a leftmost selection rule as in Prolog, a simple left recursive predicate definition can send Prolog into an infinite loop. ...
doi:10.1016/0743-1066(95)00151-4
fatcat:qxjtfwogargabg235cf4upjfyq
The applicability of logic program analysis and transformation to theorem proving
[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 2019; you can also visit the original URL.
The file type is application/pdf.
The specialisation techniques developed in this paper are independent of the proof system and can therefore be applied to theorem provers for any logic written as logic programs. 2 ...
Analysis and transformation techniques developed for logic programming can be successfully applied to automatic theorem proving. ...
Proposition 3.4 safe approximation for detecting useless clause Let P and P 0 be normal programs, where P 0 is a safe approximation of P. Let A B be a clause in P. ...
doi:10.1007/3-540-58156-1_15
fatcat:hxxcgtriynbjboqlxl3oq3vt34
Reference List of Indexed Articles
2002
The Journal of Logic and Algebraic 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 2017; you can also visit the original URL.
The file type is application/pdf.
Hsiang, On Rewrite Programs: Semantics and Relationship with Prolog 14 (1-2) (1992) 155-180 204. D. Skordev, On Van Gelder's Loop Detection Algorithm (Short Note) 14 (1-2) (1992) 181-183 205. A. ...
Seki, Unfold/Fold Transformation of General Logic Programs for the Well-Founded Semantics 16 (1-2) (1993) 5-23 227. R. Bol, Loop Checking in Partial Deduction 16 (1-2) (1993) 25-46 228. A. ...
doi:10.1016/s1567-8326(01)00020-0
fatcat:qoxvtgq6lngblb74znc4gj2yfm
Non-termination analysis of logic programs with integer arithmetics
2011
Theory and Practice 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 2017; you can also visit the original URL.
The file type is application/pdf.
Other Versions
AbstractIn the past years, analyzers have been introduced to detect classes of non-terminating queries for definite logic programs. ...
Although these non-termination analyzers have shown to be rather precise, their applicability on real-life Prolog programs is limited because most Prolog programs use non-logical features. ...
Proposition 1 already implies that the first argument of all integer constructors are free variables in the subsequent iterations of the loop. ...
doi:10.1017/s1471068411000159
fatcat:zvjyjzvj4rbm5l3gqhdnzgzmzu
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.
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 ...
, to break and to resolve cycles through negation that might arise in evaluating normal programs. ...
Prolog, of course, would be trapped in an infinite loop in this program. XSB's treatment of negation is discussed extensively in Section 2. ...
doi:10.1007/3-540-63255-7_33
fatcat:7iin72b67rfd3e3r6enjgi7ix4
An open-ended finite domain constraint solver
[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 solver has an open-ended design: the user can introduce new constraints, either in terms of indexicals by writing rules in a functional notation, or as global constraints via a Prolog programming interface ...
We describe the design and implementation of a nite domain constraint solver embedded in a Prolog system using an extended uni cation mechanism via attributed variables as a generic constraint interface ...
Acknowledgements The research reported herein was supported in part by the Advanced Software Technology Center of Competence at Uppsala University (ASTEC), and in part by the Swedish Institute of Computer ...
doi:10.1007/bfb0033845
fatcat:mk3znrtcufbnxijwdredk3p2au
N-Prolog: An extension of Prolog with hypothetical implications. I
1984
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 2017; you can also visit the original URL.
The file type is application/pdf.
Loop detection. In the previous example we wanted to install a loop detection device in the clause: Of course, Add of ordinary PROLOG is not a logical declarative operator. ...
By the way, this device can be used as a loop detection device in ordinary PROLOG. If a clause of the form Xif Yl,... ...
An (I) An (2) An (3) In this order. ...
doi:10.1016/0743-1066(84)90029-3
fatcat:je4w6muzbffn7pkkwc7egpfg3i
Focal structures and information types in Prolog
2001
International Journal of Human-Computer Studies
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.
In order to investigate this issue this thesis focused on Prolog, a programming language with important differences to those of the procedural paradigm. ...
Which criteria influences this organisation might depend on the programming language employed and the programming task in hand. ...
In the second option, the assumption has been that errors located in code segments related to propositions high in the hierarchy will be detected more easily than those located in segments related to propositions ...
doi:10.1006/ijhc.2000.0408
fatcat:gsumw5f4ezdljlv24r6gdt424q
« Previous
Showing results 1 — 15 out of 1,550 results