The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Roland N. Bol: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Krzysztof R. Apt, Roland N. Bol
    Logic Programming and Negation: A Survey. [Citation Graph (2, 0)][DBLP]
    J. Log. Program., 1994, v:19, n:, pp:9-71 [Journal]
  2. Krzysztof R. Apt, Roland N. Bol, Jan Willem Klop
    On the Safe Termination of PROLOG Programs. [Citation Graph (1, 0)][DBLP]
    ICLP, 1989, pp:353-368 [Conf]
  3. Roland N. Bol, Lars Degerstedt
    Tabulated Resolution for Well Founded Semantics. [Citation Graph (1, 0)][DBLP]
    ILPS, 1993, pp:199-219 [Conf]
  4. Roland N. Bol
    Loop Checking and Negation. [Citation Graph (1, 0)][DBLP]
    J. Log. Program., 1993, v:15, n:1&2, pp:147-175 [Journal]
  5. Roland N. Bol, Krzysztof R. Apt, Jan Willem Klop
    An Analysis of Loop Checking Mechanisms for Logic Programs. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:86, n:1, pp:35-79 [Journal]
  6. Roland N. Bol, Krzysztof R. Apt, Jan Willem Klop
    On the Power of Subsumption and Context Checks. [Citation Graph (0, 0)][DBLP]
    DISCO, 1990, pp:131-140 [Conf]
  7. Johan Blom, Roland N. Bol, Lars Kempe
    Automatic Detection of Feature Interactions in Temporal Logic. [Citation Graph (0, 0)][DBLP]
    FIW, 1995, pp:1-19 [Conf]
  8. Roland N. Bol, Jan Friso Groote
    The Meaning of Negative Premises in Transition System Specifications. [Citation Graph (0, 0)][DBLP]
    ICALP, 1991, pp:481-494 [Conf]
  9. Roland N. Bol, Lars Degerstedt
    The Underlying Search for Magic Templates and Tabulation. [Citation Graph (0, 0)][DBLP]
    ICLP, 1993, pp:793-811 [Conf]
  10. Jos C. M. Baeten, Jan A. Bergstra, Roland N. Bol
    A Real Time Process Logic. [Citation Graph (0, 0)][DBLP]
    ICTL, 1994, pp:30-47 [Conf]
  11. Roland N. Bol
    Loop Checking and Negation. [Citation Graph (0, 0)][DBLP]
    JELIA, 1990, pp:121-138 [Conf]
  12. Roland N. Bol, Jan Friso Groote
    The meaning of Negative Premises in Transition System Specifications. [Citation Graph (0, 0)][DBLP]
    LPNMR, 1990, pp:2-9 [Conf]
  13. Roland N. Bol
    Towards More Efficient Loop Checks. [Citation Graph (0, 0)][DBLP]
    NACLP, 1990, pp:465-479 [Conf]
  14. Sebastiaan van Vlijmen, Arjan van Waveren, Steven Klusener, Wilco Koorn, Liang Oei, Roland N. Bol, Frank van der Duyn Schouten, Stefan Vos de Wael
    Epitomes of Four other Cases. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1999, v:21, n:, pp:- [Journal]
  15. Marc Bezem, Roland N. Bol, Jan Friso Groote
    Formalizing Process Algebraic Verifications in the Calculus of Constructions. [Citation Graph (0, 0)][DBLP]
    Formal Asp. Comput., 1997, v:9, n:1, pp:1-48 [Journal]
  16. Roland N. Bol, Jan Friso Groote
    The Meaning of Negative Premises in Transition System Specifications. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1996, v:43, n:5, pp:863-914 [Journal]
  17. Roland N. Bol
    Loop checking in partial deduction. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1993, v:16, n:1, pp:25-46 [Journal]
  18. Roland N. Bol, Lars Degerstedt
    Tabulated Resolution for the Well-Founded Semantics. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1998, v:34, n:2, pp:67-109 [Journal]
  19. Roland N. Bol
    Generalizing Completeness Results for Loop Checks in Logic Programming. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:104, n:1, pp:3-28 [Journal]

Search in 0.276secs, Finished in 0.277secs
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