(Enter summary)
Abstract: vii
Acknowledgements viii
1. Introduction 1
1.1 Why Termination Analysis : : : : : : : : : : : : : : : : : : : : : : : : : : : 2
1.2 How It Works : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3
1.3 Outline of the Thesis : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 6
2. Logic Programming Preliminaries 9
2.1 Logic Programs : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 9
2.2 SLD Resolution : : : : : : : : : : : : : : : : : : : : : :... (Update)
Context of citations to this paper: More
...fail to deliver some remaining answers. To deal with this flaw , researchers have designed criteria for which termination is guaranteed [Soh93, Plu90, UVG88, BS89b, SVG91, Ped91] Again, this illustrates how a deficiency in the language, introduced for efficiency reasons, can...
Cited by: More
Analysis and Transformation of Logic Programs - Post (1994)
(Correct)
Active bibliography (related documents): More All
0.5: A Brief Overview of Logic Programming Research at.. - Martens..
(Correct)
0.5: The Generalized Counting Method For Recursive Logic Queries - Sacca, Zaniolo (1988)
(Correct)
0.3: Mutually Exclusive Rules in Logic Programming - Kjell Post (1994)
(Correct)
Similar documents based on text: More All
0.3: Termination Analysis for Mercury using Convex Constraints - Fischer (2002)
(Correct)
0.2: S-HARP: A Scalable Parallel Dynamic Partitioner for Adaptive.. - Sohn, Simon (1998)
(Correct)
0.2: S-HARP: A Parallel Dynamic Spectral Partitioner - Sohn, Simon (1998)
(Correct)
BibTeX entry: (Update)
K. Sohn. Automated Termination Analysis for Logic Programs. PhD thesis, UC Santa Cruz, 1993. http://citeseer.ist.psu.edu/sohn93automated.html More
@techreport{ sohn93automated,
author = "Kirack Sohn",
title = "{AUTOMATED} {TERMINATION} {ANALYSIS} {FOR} {LOGIC} {PROGRAMS} (Ph.{D}. Thesis)",
number = "UCSC-CRL-93-49",
year = "1993",
url = "citeseer.ist.psu.edu/sohn93automated.html" }
Citations (may not include all citations):
3972
Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
1838
Foundations of Logic Programming (context) - Lloyd - 1984
981
Principles of Database and Knowledge-base Systems (context) - Ullman - 1989
815
Abstract interpretation: A unified lattice model for static .. (context) - Cousot, Cousot - 1977
717
Theory of Linear and Integer Programming (context) - Schrijver - 1986
640
Princeton University Press (context) - Rockafellar - 1970
440
The Art of Prolog (context) - Sterling, Shapiro - 1986
363
Programming in Prolog (context) - Clocksin, Mellish - 1981
250
Automatic discovery of linear restraints among variables of ..
- Cousot, Halbwachs - 1978
218
Abstract interpretation and application to logic programs (context) - Cousot, Cousot - 1992
159
Predicate logic as a programming language (context) - Kowalski - 1974
107
Convex Polytopes (context) - Grunbaum - 1967
104
Combinatorial Optimization (context) - Papadimitriou, Steiglitz - 1982
77
Termination of logic programs: the never-ending story (context) - De Schreye, Decorte
72
New Generation Computing (context) - Apt, Bezem - 1991
72
PROP revisited: Propositional formula as abstract domain for.. (context) - Cortesi, File et al. - 1991
64
Communications of the ACM (context) - Kowalski, logic - 1979
62
Some global optimizations for a prolog compiler (context) - Mellish - 1985
59
ositional logic programs and a magic wand (context) - Codish, Demoen et al. - 1993
59
Studies in pure Prolog: termination (context) - Apt, Pedreschi - 1990
51
Automatic mode inference for logic programs
- Debray, Warren - 1988
48
Abstract interpretation of Prolog programs (context) - Mellish - 1987
48
Implementing prolog - compiling predicate logic programs (context) - Warren - 1977
44
Efficient tests for top-down termination of logical rules (context) - Ullman, Van Gelder - 1988
40
Implementation of logical query languages for databases (context) - Ullman - 1985
38
Design overview of the Nail (context) - Morris, Ullman et al. - 1986
37
Abstract interpretation: Towards the global optimisation of .. (context) - Bruynooghe, Janssens et al. - 1987
33
Notes for a tutorial on abstract interpretation of logic pro.. (context) - Marriott, Sondergaard - 1989
28
A survey and comparison of methods for finding all vertices .. (context) - Matheiss, Rubin - 1980
27
Termination detection in logic programs using argument sizes (context) - Sohn, Van Gelder - 1991
26
Querying constraints (context) - Lassez - 1990
26
Inference of monotonicity constraints in Datalog programs (context) - Brodsky, Sagiv - 1989
25
Inference of inequality constraints in logic programs (context) - Brodsky, Sagiv - 1991
23
Bottom-up abstract interpretation of logic programs (context) - Marriott, Sondergaard - 1988
20
Essentials of Logic Programming (context) - Hogger - 1990
20
Simplification and elimination of redundant linear arithmeti.. (context) - Lassez, Huynh et al. - 1989
17
Groundness analysis for prolog: implementation and evaluatio..
- Le Charlier, Van Hentenryck - 1993
17
volume 446 of Lecture Notes in Artificial Intelligence (context) - Plumer, for - 1990
16
Flow analysis of Prolog programs (context) - Mannila, Ukkonen - 1987
15
Termination proofs for logic programs based on predicate ine.. (context) - Plumer - 1990
11
A termination test for logic programs (context) - Sagiv - 1991
10
The complexity of ordering subgoals (context) - Ullman, Vardi - 1988
9
On termination of Datalog programs (context) - Brodsky, Sagiv - 1989
8
Weighted graphs: a tool for studying the halting problem and.. (context) - Devienne - 1990
6
Redundancy in Mathematical Programming: A State-of-the-Art S.. (context) - Karwan, Lofti et al. - 1983
5
linear constraints and variable elimination (context) - Lassez - 1990
4
Automatic generation of control for logic programs (context) - Naish - 1983
2
Testing applicability of top-down capture rules (context) - Ullman, Van Gelder - 1985
2
A practical technique for detecting non-terminating queries .. (context) - De Schreye, Verschaetse et al. - 1990
2
The automatic generation of mode declaration for logic progr.. (context) - Mellish - 1981
1
the convergence of query evaluation (context) - Afrati, Papadimitriou et al. - 1989
1
Complexity of a top-down capture rule (context) - Sagiv, Ullman - 1984
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cse.ucsc.edu.html): More
Modeling Replica Divergence in a Weak-Consistency Protocol for .. - Golding, Long (1993)
(Correct)
Exact Arithmetic in Q with Applications in Celestial Mechanics - Conrad (1994)
(Correct)
Census: Collecting Host Information on a Wide Area Network - Ganatra (1992)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC