The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Danny De Schreye: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Danny De Schreye, Maurice Bruynooghe
    The Compilation of Forward Checking Regimes through Meta-Interpretation and Transformation. [Citation Graph (1, 0)][DBLP]
    META, 1988, pp:217-231 [Conf]
  2. Maurice Bruynooghe, Danny De Schreye
    Some Thoughts on the Role of Examples in Program Transformation and its Relevance for Explanation-based Learning. [Citation Graph (0, 0)][DBLP]
    AII, 1989, pp:60-77 [Conf]
  3. Danny De Schreye, Alexander Serebrenik
    Acceptability with General Orderings. [Citation Graph (0, 0)][DBLP]
    Computational Logic: Logic Programming and Beyond, 2002, pp:187-210 [Conf]
  4. Danny De Schreye, Bern Martens
    A sensible least Herbrand semantics for untyped Vanilla meta-programming and its extension to a limited form of amalgamation. [Citation Graph (0, 0)][DBLP]
    CNKBS, 1992, pp:49-51 [Conf]
  5. Marc Denecker, Guy Duchatelet, Frank Piessens, Kristof Van Belleghem, Danny De Schreye
    Using Event Calculus for Protocol Specification: An Experiment. [Citation Graph (0, 0)][DBLP]
    Deductive Databases / Abduction in Deductive Databases, 1995, pp:187-201 [Conf]
  6. Danny De Schreye, Dirk Pollet, Johan Ronsyn, Maurice Bruynooghe
    Implementing Finite-domain Constraint Logic Programming on Top of a Prolog-System with Delay-mechanism. [Citation Graph (0, 0)][DBLP]
    ESOP, 1990, pp:106-117 [Conf]
  7. Marc Denecker, Danny De Schreye
    On the Duality of Abduction and Model Generation. [Citation Graph (0, 0)][DBLP]
    FGCS, 1992, pp:650-657 [Conf]
  8. Bern Martens, Danny De Schreye, Maurice Bruynooghe
    Sound and Complete Partial Deduction with Unfolding Based on Well-Founded Measures. [Citation Graph (0, 0)][DBLP]
    FGCS, 1992, pp:473-480 [Conf]
  9. Danny De Schreye, Kristof Verschaetse, Maurice Bruynooghe
    A Framework for Analyzing the Termination of Definite Logic Programs with respect to Call Patterns. [Citation Graph (0, 0)][DBLP]
    FGCS, 1992, pp:481-488 [Conf]
  10. Sofie Verbaeten, Danny De Schreye
    Termination Analysis of Tabled Logic Programs Using Mode and Type Information. [Citation Graph (0, 0)][DBLP]
    Fuji International Symposium on Functional and Logic Programming, 1999, pp:163-178 [Conf]
  11. Dmitri Boulanger, Danny De Schreye
    Compiling Control Revisited: A New Approach based upon Abstract Interpretation. [Citation Graph (0, 0)][DBLP]
    ICLP, 1994, pp:699-713 [Conf]
  12. Kristof Van Belleghem, Marc Denecker, Danny De Schreye
    Representing Continuous Change in the Abductive Event Calculus. [Citation Graph (0, 0)][DBLP]
    ICLP, 1994, pp:225-239 [Conf]
  13. Kristof Van Belleghem, Marc Denecker, Danny De Schreye
    Combining Situation Calculus and Event Calculus. [Citation Graph (0, 0)][DBLP]
    ICLP, 1995, pp:83-97 [Conf]
  14. Kristof Van Belleghem, Marc Denecker, Danny De Schreye
    A Strong Correspondence between Description Logics and Open Logic Programming. [Citation Graph (0, 0)][DBLP]
    ICLP, 1997, pp:346-360 [Conf]
  15. Marc Denecker, Kristof Van Belleghem, Guy Duchatelet, Frank Piessens, Danny De Schreye
    A Realistic Experiment in Knowledge Representation in Open Event Calculus: Protocol Specification. [Citation Graph (0, 0)][DBLP]
    JICSLP, 1996, pp:170-184 [Conf]
  16. Stefaan Decorte, Danny De Schreye
    Demand-Driven and Constraint-Based Automatic Left-Termination Analysis for Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 1997, pp:78-92 [Conf]
  17. Stefaan Decorte, Danny De Schreye
    Termination Analysis: Some Practical Properties of the Norm and Level Mapping Space. [Citation Graph (0, 0)][DBLP]
    IJCSLP, 1998, pp:235-249 [Conf]
  18. Marc Denecker, Danny De Schreye
    SLDNFA: An Abductive Procedure for Normal Abductive Programs. [Citation Graph (0, 0)][DBLP]
    JICSLP, 1992, pp:686-700 [Conf]
  19. Michael Leuschel, Danny De Schreye, D. Andre de Waal
    A Conceptual Embedding of Folding into Partial Deduction: Towards a Maximal Integration. [Citation Graph (0, 0)][DBLP]
    JICSLP, 1996, pp:319-332 [Conf]
  20. Bern Martens, Danny De Schreye
    A Perfect Herbrand Semantics for Untyped Vanilla Meta-Programming. [Citation Graph (0, 0)][DBLP]
    JICSLP, 1992, pp:511-525 [Conf]
  21. Manh Thang Nguyen, Danny De Schreye
    Polynomial Interpretations as a Basis for Termination Analysis of Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 2005, pp:311-325 [Conf]
  22. Danny De Schreye, Kristof Verschaetse, Maurice Bruynooghe
    A Practical Technique for Detecting Non-terminating Queries for a Restricted Class of Horn Clauses, Using Directed, Weighted Graphs. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:649-663 [Conf]
  23. Kristof Verschaetse, Danny De Schreye
    Deriving Termination Proofs for Logic Programs, Using Abstract Procedures. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:301-315 [Conf]
  24. Wim Vanhoof, Bern Martens, Danny De Schreye, Karel De Vlaminck
    Specialising the Other Way Arond. [Citation Graph (0, 0)][DBLP]
    IJCSLP, 1998, pp:279-293 [Conf]
  25. Kristof Verschaetse, Danny De Schreye, Maurice Bruynooghe
    Generation and Compilation of Efficient Computation Rules. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:700-714 [Conf]
  26. Kristof Van Belleghem, Marc Denecker, Danny De Schreye
    The Abductive Event Calculus as a General Framework for Temporal Databases. [Citation Graph (0, 0)][DBLP]
    ICTL, 1994, pp:301-316 [Conf]
  27. Maurice Bruynooghe, Luc De Raedt, Danny De Schreye
    Explanation Based Program Transformation. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1989, pp:407-412 [Conf]
  28. Stefaan Decorte, Danny De Schreye, Michael Leuschel, Bern Martens, Konstantinos F. Sagonas
    Termination Analysis for Tabled Logic Programming. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1997, pp:111-127 [Conf]
  29. Michael Leuschel, Danny De Schreye
    Logic Program Specialisation: How to Be More Specific (Abstract). [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1996, pp:58- [Conf]
  30. Bern Martens, Danny De Schreye
    Some Further Issues in Finite Unfolding (Abstract). [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1993, pp:159-161 [Conf]
  31. Alexander Serebrenik, Danny De Schreye
    Non-tranformational termination analysis of logic programs, based on general term-orderings. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 2000, pp:- [Conf]
  32. Alexander Serebrenik, Danny De Schreye
    Non-transformational Termination Analysis of Logic Programs, Based on General Term-Orderings. [Citation Graph (0, 0)][DBLP]
    LOPSTR (LNCS 2042: Selected Papers), 2000, pp:69-85 [Conf]
  33. Alexander Serebrenik, Danny De Schreye
    Proving Termination with Adornments. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 2003, pp:108-109 [Conf]
  34. Wim Vanhoof, Danny De Schreye, Bern Martens
    Bottom-Up Specialisation of Logic Programs. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1998, pp:325-327 [Conf]
  35. Kristof Verschaetse, Stefaan Decorte, Danny De Schreye
    Automatic Termination Analysis. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1992, pp:168-183 [Conf]
  36. Manh Thang Nguyen, Danny De Schreye
    Polytool: Proving Termination Automatically Based on Polynomial Interpretations. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 2006, pp:210-218 [Conf]
  37. Alexander Serebrenik, Danny De Schreye
    On Termination of Meta-Programs. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:517-530 [Conf]
  38. Alexander Serebrenik, Danny De Schreye
    Inference of Termination Conditions for Numerical Loops in Prolog. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:654-668 [Conf]
  39. Henk Vandecasteele, Danny De Schreye
    Implementing a Finite-domain CLP-language on Top of Prolog: a Transformational Approach. [Citation Graph (0, 0)][DBLP]
    LPAR, 1994, pp:84-98 [Conf]
  40. Alexander Serebrenik, Danny De Schreye
    Hasta-La-Vista: Termination Analyser for Logic Programs. [Citation Graph (0, 0)][DBLP]
    WLPE, 2003, pp:60-74 [Conf]
  41. Dmitri Boulanger, Maurice Bruynooghe, Danny De Schreye
    Compiling Control Revisited: A New approach Based Upon Abstract Interpretation for Constraint Logic Programs. [Citation Graph (0, 0)][DBLP]
    LPE, 1993, pp:39-51 [Conf]
  42. Marc Denecker, Danny De Schreye
    Justification Semantics: A Unifiying Framework for the Semantics of Logic Programs. [Citation Graph (0, 0)][DBLP]
    LPNMR, 1993, pp:365-379 [Conf]
  43. Danny De Schreye, Bern Martens
    A Sensible Least Herbrand Semantics for Untyped Vanilla Meta-Programming and its Extension to a Limited Form of Amalgamation. [Citation Graph (0, 0)][DBLP]
    META, 1992, pp:192-204 [Conf]
  44. Danny De Schreye, Kristof Verschaetse
    Tutorial on Termination of Logic Programs. [Citation Graph (0, 0)][DBLP]
    META, 1992, pp:70-88 [Conf]
  45. Jon Sneyers, Joost Vennekens, Danny De Schreye
    Probabilistic-Logical Modeling of Music. [Citation Graph (0, 0)][DBLP]
    PADL, 2006, pp:60-72 [Conf]
  46. Michael Leuschel, Danny De Schreye
    Towards Creating Specialised Integrity Checks through Partial Evaluation of Meta-Interpreters. [Citation Graph (0, 0)][DBLP]
    PEPM, 1995, pp:253-263 [Conf]
  47. Michael Leuschel, Danny De Schreye
    Logic Program Specialisation: How To Be More Specific. [Citation Graph (0, 0)][DBLP]
    PLILP, 1996, pp:137-151 [Conf]
  48. Kristof Verschaetse, Danny De Schreye
    Deriving of Linear Size Relations by Abstract Interpretation. [Citation Graph (0, 0)][DBLP]
    PLILP, 1992, pp:296-310 [Conf]
  49. Danny De Schreye, Maurice Bruynooghe
    An Application of Abstract Interpretation in Source Level Program Transformation. [Citation Graph (0, 0)][DBLP]
    PLILP, 1988, pp:35-57 [Conf]
  50. Wim Vanhoof, Danny De Schreye, Bern Martens
    A Framework for Bottom Up Specialisation of Logic Programs. [Citation Graph (0, 0)][DBLP]
    PLILP/ALP, 1998, pp:54-72 [Conf]
  51. Sofie Verbaeten, Konstantinos F. Sagonas, Danny De Schreye
    Modular Termination Proofs for Prolog with Tabling. [Citation Graph (0, 0)][DBLP]
    PPDP, 1999, pp:342-359 [Conf]
  52. Alexander Serebrenik, Danny De Schreye
    On Termination of Logic Programs with Floating Point Computations. [Citation Graph (0, 0)][DBLP]
    SAS, 2002, pp:151-164 [Conf]
  53. Maurice Bruynooghe, Danny De Schreye, Bruno Krekels
    Compiling Control. [Citation Graph (0, 0)][DBLP]
    SLP, 1986, pp:70-77 [Conf]
  54. Maurice Bruynooghe, Danny De Schreye, Bern Martens
    A General Criterion for Avoiding Infinite Unfolding During Partial Deduction of Logic Programs. [Citation Graph (0, 0)][DBLP]
    ISLP, 1991, pp:117-131 [Conf]
  55. Stefaan Decorte, Danny De Schreye, Massimo Fabris
    Automatic Inference of Norms: A Missing Link in Automatic Termination Analysis. [Citation Graph (0, 0)][DBLP]
    ILPS, 1993, pp:420-436 [Conf]
  56. Marc Denecker, Danny De Schreye
    Representing Incomplete Knowledge in Abductive Logic Programming. [Citation Graph (0, 0)][DBLP]
    ILPS, 1993, pp:147-163 [Conf]
  57. Danny De Schreye, Michael Leuschel, Bern Martens
    Tutorial on Program Specialisation (Abstract). [Citation Graph (0, 0)][DBLP]
    ILPS, 1995, pp:615-616 [Conf]
  58. Sofie Verbaeten, Marc Denecker, Danny De Schreye
    Compositionality of Normal Open Logic Programs. [Citation Graph (0, 0)][DBLP]
    ILPS, 1997, pp:371-385 [Conf]
  59. Michael Leuschel, Danny De Schreye
    Constrained Partial Deduction. [Citation Graph (0, 0)][DBLP]
    WLP, 1997, pp:0-0 [Conf]
  60. Sven Verdoolaege, Marc Denecker, Ness Schelkens, Danny De Schreye, Frank Van Eynde
    Semantic interpretation of temporal information by abductive inference. [Citation Graph (0, 0)][DBLP]
    CLIN, 1999, pp:- [Conf]
  61. Sofie Verbaeten, Danny De Schreye
    Termination of Simply-Moded Well-Typed Logic Programs under a Tabled Execution Mechanism. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 2001, v:12, n:1/2, pp:157-196 [Journal]
  62. Danny De Schreye, Maurice Bruynooghe, Kristof Verschaetse
    On the Existence of Nonterminating Queries for a Restricted Class of PROLOG-Clauses. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1989, v:41, n:2, pp:237-248 [Journal]
  63. Danny De Schreye, Maurice Bruynooghe, Bart Demoen, Marc Denecker, Gerda Janssens, Bern Martens
    Project Report on LP+: A Second Generation Logic Programming Language. [Citation Graph (0, 0)][DBLP]
    AI Commun., 2000, v:13, n:1, pp:13-18 [Journal]
  64. Sven Verdoolaege, Marc Denecker, Ness Schelkens, Danny De Schreye, Frank Van Eynde
    Semantic interpretation of temporal information by abductive inference [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  65. Sofie Verbaeten, Danny De Schreye, Konstantinos F. Sagonas
    Termination Proofs for Logic Programs with Tabling [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  66. Alexander Serebrenik, Danny De Schreye
    Termination analysis of logic programs using acceptability with general term orders [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  67. Danny De Schreye, Alexander Serebrenik
    Acceptability with general orderings [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  68. Alexander Serebrenik, Danny De Schreye
    Inference of termination conditions for numerical loops [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  69. Alexander Serebrenik, Danny De Schreye
    Inference of termination conditions for numerical loops in Prolog [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  70. Alexander Serebrenik, Danny De Schreye
    On termination of meta-programs [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  71. Michael Leuschel, Bern Martens, Danny De Schreye
    Some Achievements and Prospects in Partial Deduction. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1998, v:30, n:3es, pp:4- [Journal]
  72. Danny De Schreye, Bern Martens, Gunther Sablon, Maurice Bruynooghe
    Compiling Bottom-up and Mixed Derivations into Top-down Executable Logic Programs. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 1991, v:7, n:3, pp:337-358 [Journal]
  73. Alexander Serebrenik, Danny De Schreye
    Termination of Floating-Point Computations. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2005, v:34, n:2, pp:141-177 [Journal]
  74. Wim Vanhoof, Danny De Schreye, Bern Martens
    Bottom-up Partial Deduction of Logic Programs [Citation Graph (0, 0)][DBLP]
    Journal of Functional and Logic Programming, 1999, v:1999, n:Special Issue 2, pp:- [Journal]
  75. Maurice Bruynooghe, Danny De Schreye, Bruno Krekels
    Compiling Control. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1989, v:6, n:1&2, pp:135-162 [Journal]
  76. Kristof Van Belleghem, Marc Denecker, Danny De Schreye
    On the Relation Between Situation Calculus and Event Calculus. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1997, v:31, n:1-3, pp:3-37 [Journal]
  77. Marc Denecker, Danny De Schreye
    SLDNFA: An Abductive Procedure for Abductive Logic Programs. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1998, v:34, n:2, pp:111-167 [Journal]
  78. Michael Leuschel, Danny De Schreye
    Creating Specialised Integrity Checks Through Partial Evaluation of Meta-Interpreters. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1998, v:36, n:2, pp:149-193 [Journal]
  79. Bern Martens, Danny De Schreye
    Why Untyped Nonground Metaprogramming Is Not (Much Of) A Problem. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1995, v:22, n:1, pp:47-99 [Journal]
  80. Bern Martens, Danny De Schreye
    Automatic Finite Unfolding Using Well-Founded Measures. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1996, v:28, n:2, pp:89-146 [Journal]
  81. Danny De Schreye, Stefaan Decorte
    Termination of Logic Programs: The Never-Ending Story. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1994, v:19, n:, pp:199-260 [Journal]
  82. Danny De Schreye, Robert Glück, Jesper Jørgensen, Michael Leuschel, Bern Martens, Morten Heine Sørensen
    Erratum to: "Conjunctive Partial Deduction: Foundations, Control, Algorithms and Experiments". [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 2000, v:43, n:3, pp:265- [Journal]
  83. Danny De Schreye, Robert Glück, Jesper Jørgensen, Michael Leuschel, Bern Martens, Morten Heine Sørensen
    Conjunctive Partial Deduction: Foundations, Control, Algorithms, and Experiments. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1999, v:41, n:2-3, pp:231-277 [Journal]
  84. Sofie Verbaeten, Marc Denecker, Danny De Schreye
    Compositionality of Normal Open Logic Programs. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 2000, v:42, n:3, pp:151-183 [Journal]
  85. Danny De Schreye, Maurice Bruynooghe
    On the Transformation of Logic Programs with Instantiation Based Computation Rules. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1989, v:7, n:2, pp:125-154 [Journal]
  86. Marc Denecker, Danny De Schreye
    Representing Incomplete Knowledge in Abductive Logic Programming. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1995, v:5, n:5, pp:553-577 [Journal]
  87. Maurice Bruynooghe, Danny De Schreye, Bern Martens
    A General Criterion for Avoiding Infinite Unfolding during Partial Deduction. [Citation Graph (0, 0)][DBLP]
    New Generation Comput., 1992, v:11, n:1, pp:47-79 [Journal]
  88. Michael Leuschel, Danny De Schreye
    Constrained Partial Deduction and the Preservation of Characteristic Trees. [Citation Graph (0, 0)][DBLP]
    New Generation Comput., 1998, v:16, n:3, pp:283-342 [Journal]
  89. Danny De Schreye, Kristof Verschaetse
    Deriving Linear Size Relations for Logic Programs by Abstract Interpretation. [Citation Graph (0, 0)][DBLP]
    New Generation Comput., 1995, v:13, n:2, pp:117-154 [Journal]
  90. Marc Denecker, Danny De Schreye
    On the Duality of Abduction and Model Generation in a Framework for Model Generation with Equality. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:122, n:1&2, pp:225-262 [Journal]
  91. Bern Martens, Danny De Schreye, Tamás Horváth
    Sound and Complete Partial Deduction with Unfolding Based on Well-Founded Measures. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:122, n:1&2, pp:97-117 [Journal]
  92. Sofie Verbaeten, Danny De Schreye, Konstantinos F. Sagonas
    Termination proofs for logic programs with tabling. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2001, v:2, n:1, pp:57-92 [Journal]
  93. Stefaan Decorte, Danny De Schreye, Henk Vandecasteele
    Constraint-based termination analysis of logic programs. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1999, v:21, n:6, pp:1137-1195 [Journal]
  94. Michael Leuschel, Bern Martens, Danny De Schreye
    Controlling Generalization amd Polyvariance in Partial Deduction of Normal Logic Programs. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1998, v:20, n:1, pp:208-258 [Journal]
  95. Alexander Serebrenik, Danny De Schreye
    Inference of termination conditions for numerical loops in Prolog. [Citation Graph (0, 0)][DBLP]
    TPLP, 2004, v:4, n:5-6, pp:719-751 [Journal]
  96. Alexander Serebrenik, Danny De Schreye
    On termination of meta-programs. [Citation Graph (0, 0)][DBLP]
    TPLP, 2005, v:5, n:3, pp:355-390 [Journal]

  97. Termination of Programs using Term Rewriting and SAT Solving. [Citation Graph (, )][DBLP]


  98. Termination Analysis of CHR Revisited. [Citation Graph (, )][DBLP]


  99. Automating Termination Proofs for CHR. [Citation Graph (, )][DBLP]


  100. A New Approach to Non-termination Analysis of Logic Programs. [Citation Graph (, )][DBLP]


  101. Proving Termination by Invariance Relations. [Citation Graph (, )][DBLP]


  102. Termination Analysis of Logic Programs Based on Dependency Graphs. [Citation Graph (, )][DBLP]


  103. Termination Analysis of General Logic Programs for Moded Queries: A Dynamic Approach [Citation Graph (, )][DBLP]


  104. Termination Prediction for General Logic Programs [Citation Graph (, )][DBLP]


  105. Polytool: polynomial interpretations as a basis for termination analysis of Logic programs [Citation Graph (, )][DBLP]


Search in 0.103secs, Finished in 0.109secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002