A framework for computing finite SLD trees (Q2258840): Difference between revisions

@@ Property / describes a project that uses @@
+COSTA
@@ Property / describes a project that uses: COSTA / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+DPPD
@@ Property / describes a project that uses: DPPD / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jlamp.2014.11.006
+Normal rank
@@ Property / OpenAlex ID @@
+W2115949022
@@ Property / OpenAlex ID: W2115949022 / rank @@
+Normal rank
@@ Property / cites work @@
+Cost analysis of object-oriented bytecode programs
+Normal rank
@@ Property / cites work @@
+Resource-Driven CLP-Based Test Case Generation
@@ Property / cites work: Resource-Driven CLP-Based Test Case Generation / rank @@
+Normal rank
@@ Property / cites work @@
+Q3716279
@@ Property / cites work: Q3716279 / rank @@
+Normal rank
@@ Property / cites work @@
+Narrowing vs. SLD-resolution
@@ Property / cites work: Narrowing vs. SLD-resolution / rank @@
+Normal rank
@@ Property / cites work @@
+Q5389079
@@ Property / cites work: Q5389079 / rank @@
+Normal rank
@@ Property / cites work @@
+Termination Graphs for Java Bytecode
@@ Property / cites work: Termination Graphs for Java Bytecode / rank @@
+Normal rank
@@ Property / cites work @@
+A practical framework for theabstract interpretation of logic programs
+Normal rank
@@ Property / cites work @@
+A general criterion for avoiding infinite unfolding during partial deduction
+Normal rank
@@ Property / cites work @@
+From failure to success: Comparing a denotational and a declarative semantics for Horn clause logic
+Normal rank
@@ Property / cites work @@
+Conjunctive partial deduction: foundations, control, algorithms, and experiments
+Normal rank
@@ Property / cites work @@
+Test case generation for object-oriented imperative languages in CLP
+Normal rank
@@ Property / cites work @@
+The integration of functions into logic programming: From theory to practice
+Normal rank
@@ Property / cites work @@
+Lazy abstraction
@@ Property / cites work: Lazy abstraction / rank @@
+Normal rank
@@ Property / cites work @@
+Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
+Normal rank
@@ Property / cites work @@
+Q4414739
@@ Property / cites work: Q4414739 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3992908
@@ Property / cites work: Q3992908 / rank @@
+Normal rank
@@ Property / cites work @@
+Partial evaluation in logic programming
@@ Property / cites work: Partial evaluation in logic programming / rank @@
+Normal rank
@@ Property / cites work @@
+A Finite Representation of the Narrowing Space
@@ Property / cites work: A Finite Representation of the Narrowing Space / rank @@
+Normal rank
@@ Property / cites work @@
+Q5389149
@@ Property / cites work: Q5389149 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4038706
@@ Property / cites work: Q4038706 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2723919
@@ Property / cites work: Q2723919 / rank @@
+Normal rank
@@ Property / cites work @@
+Transformation of logic programs: Foundations and techniques
+Normal rank
@@ Property / cites work @@
+Automated termination analysis for logic programs with cut
+Normal rank
@@ Property / cites work @@
+Q3746920
@@ Property / cites work: Q3746920 / rank @@
+Normal rank
@@ Property / cites work @@
+A Hybrid Approach to Conjunctive Partial Evaluation of Logic Programs
+Normal rank
@@ Property / cites work @@
+Annotation of logic programs for independent AND-parallelism by partial evaluation
+Normal rank
@@ Property / cites work @@
+Towards Erlang Verification by Term Rewriting
@@ Property / cites work: Towards Erlang Verification by Term Rewriting / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2258840