The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Jonas Barklund: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jonas Barklund, Nils Hagner, Malik Wafin
    Condition Graphs. [Citation Graph (1, 0)][DBLP]
    ICLP/SLP, 1988, pp:435-446 [Conf]
  2. Per Jonsson, Jonas Barklund
    Characterizing Signal Behaviour Using Genetic Programming. [Citation Graph (0, 0)][DBLP]
    Evolutionary Computing, AISB Workshop, 1996, pp:62-72 [Conf]
  3. Monika Danielsson, Jonas Barklund
    Persistent Data Storage for Prolog. [Citation Graph (0, 0)][DBLP]
    DEXA, 1990, pp:456-463 [Conf]
  4. Andreas Hamfelt, Jonas Barklund
    An Intelligent Object Oriented Modelling to Legal Data Bases Combining Logic Programming and Hypertext. [Citation Graph (0, 0)][DBLP]
    DEXA, 1990, pp:56-61 [Conf]
  5. Jonas Barklund, Nils Hagner, Malik Wafin
    KL1 in Condition Graphs on a Connection Machine. [Citation Graph (0, 0)][DBLP]
    FGCS, 1988, pp:1041-1050 [Conf]
  6. Jonas Barklund, Håkan Millroth
    Providing Iteration and concurrency in Logic Programs Through Bounded Quantifications. [Citation Graph (0, 0)][DBLP]
    FGCS, 1992, pp:817-824 [Conf]
  7. Jonas Barklund, Pierangelo Dell'Acqua, Stefania Costantini, Gaetano Aurelio Lanzarone
    Multiple Metareasoning Agents for Flexible Query-Answering Systems. [Citation Graph (0, 0)][DBLP]
    FQAS, 1996, pp:155-166 [Conf]
  8. Jonas Barklund, Pierangelo Dell'Acqua, Stefania Costantini, Gaetano Aurelio Lanzarone
    Semantical Properties of SLD-Resolution with Reflection. [Citation Graph (0, 0)][DBLP]
    ICLP, 1995, pp:830- [Conf]
  9. Jonas Barklund, Håkan Millroth
    Hash Tables in Logic Programming. [Citation Graph (0, 0)][DBLP]
    ICLP, 1987, pp:411-427 [Conf]
  10. Henrik Arro, Jonas Barklund, Johan Bevemyr
    Parallel Bounded Quantifiers - Preliminary Results. [Citation Graph (0, 0)][DBLP]
    IJCSLP Workshop on Concurrent and Parallel Implementations, 1992, pp:- [Conf]
  11. Jonas Barklund, Pierangelo Dell'Acqua, Stefania Costantini, Gaetano Aurelio Lanzarone
    Reflection through Constraint Satisfaction. [Citation Graph (0, 0)][DBLP]
    ICLP, 1994, pp:742- [Conf]
  12. Jonas Barklund, Katrin Boberg, Pierangelo Dell'Acqua
    A Basis for a Multi-Level Meta-Logic Programming Language. [Citation Graph (0, 0)][DBLP]
    META, 1994, pp:262-275 [Conf]
  13. Jonas Barklund, Johan Bevemyr
    Prolog with Arrays and Bounded Quantifications. [Citation Graph (0, 0)][DBLP]
    LPAR, 1993, pp:28-39 [Conf]
  14. Jonas Barklund
    What Is a Meta-Variable in Prolog? [Citation Graph (0, 0)][DBLP]
    META, 1988, pp:383-398 [Conf]
  15. John Alan Robinson, Jonas Barklund
    Vesper. [Citation Graph (0, 0)][DBLP]
    Machine Intelligence 15, 1995, pp:360-377 [Conf]
  16. Jonas Barklund
    Efficient interpretation of Prolog programs. [Citation Graph (0, 0)][DBLP]
    PLDI, 1987, pp:132-137 [Conf]
  17. Jonas Barklund
    Tabulation of Functions in Definite Clause Programs. [Citation Graph (0, 0)][DBLP]
    PLILP, 1994, pp:465-466 [Conf]
  18. Jonas Barklund, Johan Bevemyr
    Executing Bounded Quantifications on Shared Memory Multiprocessors. [Citation Graph (0, 0)][DBLP]
    PLILP, 1993, pp:302-317 [Conf]
  19. Jonas Barklund, Pierangelo Dell'Acqua, Stefania Costantini, Gaetano Aurelio Lanzarone
    SLD - Resolution with Reflection. [Citation Graph (0, 0)][DBLP]
    SLP, 1994, pp:554-568 [Conf]
  20. Jonas Barklund, Pierangelo Dell'Acqua, Stefania Costantini, Gaetano Aurelio Lanzarone
    Semantical Properties of Encodings in Logic Programming. [Citation Graph (0, 0)][DBLP]
    ILPS, 1995, pp:288-302 [Conf]
  21. Jonas Barklund, Håkan Millroth
    Garbage Cut for Garbage Collection of Iterative Prolog Programs. [Citation Graph (0, 0)][DBLP]
    SLP, 1986, pp:276-283 [Conf]
  22. Jonas Barklund, Håkan Millroth
    Integrating Complex Data Structures in Prolog. [Citation Graph (0, 0)][DBLP]
    SLP, 1987, pp:415-425 [Conf]
  23. Margus Veanes, Jonas Barklund
    On the Number of Edges in Cycletrees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:57, n:4, pp:225-229 [Journal]
  24. Margus Veanes, Jonas Barklund
    Construction of Natural Cycletrees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:60, n:6, pp:313-318 [Journal]
  25. Jonas Barklund, Andreas Hamfelt
    Hierarchical Representation of Legal Knowledge with Metaprogramming in Logic. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1994, v:18, n:1, pp:55-80 [Journal]
  26. Margus Veanes, Jonas Barklund
    Natural Cycletrees: Flexible Interconnection Graphs. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1996, v:33, n:1, pp:44-54 [Journal]
  27. Jonas Barklund, Johan Bevemyr
    Prolog with arrays and bounded quantifications. [Citation Graph (0, 0)][DBLP]
    J. Prog. Lang., 1996, v:4, n:3, pp:117-141 [Journal]
  28. Jonas Barklund, Pierangelo Dell'Acqua, Stefania Costantini, Gaetano Aurelio Lanzarone
    Reflection principles in computational logic. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2000, v:10, n:6, pp:743-786 [Journal]
  29. Jonas Barklund
    Bounded Quantifications for Iteration and Concurrency in Logic Programming. [Citation Graph (0, 0)][DBLP]
    New Generation Comput., 1994, v:12, n:2, pp:161-182 [Journal]
  30. Henrik Arro, Jonas Barklund, Johan Bevemyr
    Parallel Bounded Quantification - Preliminary Results. [Citation Graph (0, 0)][DBLP]
    SIGPLAN Notices, 1993, v:28, n:8, pp:117-124 [Journal]

Search in 0.003secs, Finished in 0.303secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002