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