| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A basis for deductive database systems
|
Lloyd, J.W.
|
|
1985
|
|
2 |
p. 93-109
17 p.
|
artikel
|
| 2 |
Abstract interpretation of logic programs using magic transformations
|
Debray, Saumya
|
|
1994
|
|
2 |
p. 149-176
28 p.
|
artikel
|
| 3 |
A closer look at declarative interpretations
|
Apt, Krzysztof R.
|
|
1996
|
|
2 |
p. 147-180
34 p.
|
artikel
|
| 4 |
A data-dependency-based intelligent backtracking scheme for PROLOG
|
Kumar, Vipin
|
|
1988
|
|
2 |
p. 165-181
17 p.
|
artikel
|
| 5 |
A deterministic prolog fixpoint semantics
|
Fitting, Melvin
|
|
1985
|
|
2 |
p. 111-118
8 p.
|
artikel
|
| 6 |
A fixpoint characterization of abductive logic programs
|
Inoue, Katsumi
|
|
1996
|
|
2 |
p. 107-136
30 p.
|
artikel
|
| 7 |
A general modal framework for the event calculus and its skeptical and credulous variants
|
Cervesato, Iliano
|
|
1999
|
|
2 |
p. 111-164
54 p.
|
artikel
|
| 8 |
A linear control algorithm for a class of rule-based systems
|
Ghallab, Malik
|
|
1991
|
|
2 |
p. 117-132
16 p.
|
artikel
|
| 9 |
A logical foundation for logic programming I: Biconsequence relations and nonmonotonic completion
|
Bochman, Alexander
|
|
1998
|
|
2 |
p. 151-170
20 p.
|
artikel
|
| 10 |
A logical foundation for logic programming II: Semantics of general logic programs
|
Bochman, Alexander
|
|
1998
|
|
2 |
p. 171-194
24 p.
|
artikel
|
| 11 |
A logical reconstruction of Prolog II
|
van Emden, M.H.
|
|
1984
|
|
2 |
p. 143-149
7 p.
|
artikel
|
| 12 |
A logical semantics for hypothetical rulebases with deletion
|
Bonner, Anthony J.
|
|
1997
|
|
2 |
p. 119-170
52 p.
|
artikel
|
| 13 |
An algebraic approach to sharing analysis of logic programs
|
Codish, Michael
|
|
2000
|
|
2 |
p. 111-149
39 p.
|
artikel
|
| 14 |
Analysis of sequential PROLOG programs
|
Onai, Rikio
|
|
1986
|
|
2 |
p. 119-141
23 p.
|
artikel
|
| 15 |
An argumentation-theoretic foundation for logic programming
|
Dung, Phan Minh
|
|
1995
|
|
2 |
p. 151-177
27 p.
|
artikel
|
| 16 |
And-parallel execution of logic programs on a shared-memory multiprocessor
|
Lin, Yow-Jian
|
|
1991
|
|
2 |
p. 155-178
24 p.
|
artikel
|
| 17 |
A new definition of SLDNF-resolution
|
Apt, Krzysztof R.
|
|
1994
|
|
2 |
p. 177-190
14 p.
|
artikel
|
| 18 |
A platform for restriction mapping
|
Yee, Chut N.
|
|
1997
|
|
2 |
p. 81-99
19 p.
|
artikel
|
| 19 |
A practical framework for theabstract interpretation of logic programs
|
Bruynooghe, Maurice
|
|
1991
|
|
2 |
p. 91-124
34 p.
|
artikel
|
| 20 |
A program transformation from equational programs into logic programs
|
Togashi, Atsushi
|
|
1987
|
|
2 |
p. 85-103
19 p.
|
artikel
|
| 21 |
A sequential abstract machine for flat concurrent prolog
|
Houri, Avshalom
|
|
1989
|
|
2 |
p. 85-123
39 p.
|
artikel
|
| 22 |
A survey of deductive database systems
|
Ramakrishnan, Raghu
|
|
1995
|
|
2 |
p. 125-149
25 p.
|
artikel
|
| 23 |
A tool for developing interactive configuration applications
|
Axling, Tomas
|
|
1996
|
|
2 |
p. 147-168
22 p.
|
artikel
|
| 24 |
A type system for logic programs
|
Yardeni, Eyal
|
|
1991
|
|
2 |
p. 125-153
29 p.
|
artikel
|
| 25 |
Autoepistemic logics as a unifying framework for the semantics of logic programs
|
Bonatti, Piero A.
|
|
1995
|
|
2 |
p. 91-149
59 p.
|
artikel
|
| 26 |
Automata-driven indexing of prolog clauses
|
Ramesh, R.
|
|
1995
|
|
2 |
p. 151-202
52 p.
|
artikel
|
| 27 |
Automatic compile-time parallelization of logic programs for restricted, goal level, independent and parallelism
|
Muthukumar, K.
|
|
1999
|
|
2 |
p. 165-218
54 p.
|
artikel
|
| 28 |
Automatic finite unfolding using well-founded measures
|
Martens, Bern
|
|
1996
|
|
2 |
p. 89-146
58 p.
|
artikel
|
| 29 |
Bilattices and the semantics of logic programming
|
Fitting, Melvin
|
|
1991
|
|
2 |
p. 91-116
26 p.
|
artikel
|
| 30 |
Canonical logic programs
|
Jaffar, Joxan
|
|
1986
|
|
2 |
p. 143-155
13 p.
|
artikel
|
| 31 |
Clausal intuitionistic logic II. tableau proof procedures
|
McCarty, L.Thorne
|
|
1988
|
|
2 |
p. 93-132
40 p.
|
artikel
|
| 32 |
Combining negation as failure and embedded implications in logic programs
|
Giordano, Laura
|
|
1998
|
|
2 |
p. 91-147
57 p.
|
artikel
|
| 33 |
Comments on “general failure of logic programs”
|
Jaffar, Joxan
|
|
1986
|
|
2 |
p. 115-118
4 p.
|
artikel
|
| 34 |
Completeness of SLDNF-resolution for nonfloundering queries
|
Drabent, Wḱlodzimierz
|
|
1996
|
|
2 |
p. 89-106
18 p.
|
artikel
|
| 35 |
Computer support for protocol-based treatment of cancer
|
Hammond, Peter
|
|
1996
|
|
2 |
p. 93-111
19 p.
|
artikel
|
| 36 |
Constraint logic programming for examination timetabling
|
Boizumault, P
|
|
1996
|
|
2 |
p. 217-233
17 p.
|
artikel
|
| 37 |
Constructive negation by pruning
|
Fages, François
|
|
1997
|
|
2 |
p. 85-118
34 p.
|
artikel
|
| 38 |
Correctness of unification without occur check in prolog
|
Chadha, Ritu
|
|
1994
|
|
2 |
p. 99-122
24 p.
|
artikel
|
| 39 |
Creating specialised integrity checks through partial evaluation of meta-interpreters
|
Leuschel, Michael
|
|
1998
|
|
2 |
p. 149-193
45 p.
|
artikel
|
| 40 |
Data-parallel concurrent constraint programming
|
Tong, Bo-Ming
|
|
1998
|
|
2 |
p. 103-150
48 p.
|
artikel
|
| 41 |
Efficient unification of quantified terms
|
Staples, John
|
|
1988
|
|
2 |
p. 133-149
17 p.
|
artikel
|
| 42 |
Equality, types, modules, and (why not?) generics for logic programming
|
Goguen, Joseph A.
|
|
1984
|
|
2 |
p. 179-210
32 p.
|
artikel
|
| 43 |
Equivalence of well-founded and stable semantics
|
Gire, Françoise
|
|
1994
|
|
2 |
p. 95-111
17 p.
|
artikel
|
| 44 |
Expressiveness of stable model semantics for disjunctive logic programs with functions
|
Eiter, Thomas
|
|
1997
|
|
2 |
p. 167-178
12 p.
|
artikel
|
| 45 |
Extending Prolog with nonmonotonic reasoning
|
Chen, Weidong
|
|
1996
|
|
2 |
p. 169-183
15 p.
|
artikel
|
| 46 |
Extremal problems in logic programming and stable model computation
|
Cholewinski, Pawel
|
|
1999
|
|
2 |
p. 219-242
24 p.
|
artikel
|
| 47 |
Flow analysis of dynamic logic programs
|
Debray, Saumya K.
|
|
1989
|
|
2 |
p. 149-176
28 p.
|
artikel
|
| 48 |
General failure of logic programs
|
Le, Van Tu
|
|
1985
|
|
2 |
p. 157-165
9 p.
|
artikel
|
| 49 |
Guest editor's introduction Special Issue: Applications of Logic Programming
|
Sterling, L
|
|
1996
|
|
2 |
p. 91-92
2 p.
|
artikel
|
| 50 |
HORNLOG: A graph-based interpreter for general Horn clauses
|
Gallier, Jean H.
|
|
1987
|
|
2 |
p. 119-155
37 p.
|
artikel
|
| 51 |
Implementing parallel algorithms in concurrent prolog: The Maxflow experience
|
Hillerstein, Lisa
|
|
1986
|
|
2 |
p. 157-184
28 p.
|
artikel
|
| 52 |
Intelligent data retrieval in prolog: An illuminating idea
|
Ruggieri, Cristina
|
|
1996
|
|
2 |
p. 169-198
30 p.
|
artikel
|
| 53 |
Interprocedural analyses: a comparison
|
Seidl, Helmut
|
|
2000
|
|
2 |
p. 123-156
34 p.
|
artikel
|
| 54 |
Logical levels of problem solving
|
Sterling, Leon
|
|
1984
|
|
2 |
p. 151-163
13 p.
|
artikel
|
| 55 |
Logic and algebraic languages for interoperability in multidatabase systems
|
Lakshmanan, Laks V.S.
|
|
1997
|
|
2 |
p. 101-149
49 p.
|
artikel
|
| 56 |
Logic continuations
|
Haynes, Christopher T.
|
|
1987
|
|
2 |
p. 157-176
20 p.
|
artikel
|
| 57 |
Memory- and buffer-referencing characteristics of a WAM-based PROLOG
|
Tick, Evan
|
|
1991
|
|
2 |
p. 133-162
30 p.
|
artikel
|
| 58 |
On Delphi lemmas and other memoing techniques for deterministic logic programs
|
Tarau, Paul
|
|
1997
|
|
2 |
p. 145-163
19 p.
|
artikel
|
| 59 |
On derived dependencies and connected databases
|
Dart, Philip W.
|
|
1991
|
|
2 |
p. 163-188
26 p.
|
artikel
|
| 60 |
Optimal groundness analysis using propositional logic
|
Cortesi, Agostino
|
|
1996
|
|
2 |
p. 137-167
31 p.
|
artikel
|
| 61 |
Order-sorted feature theory unification
|
Aït-Kaci, Hassan
|
|
1997
|
|
2 |
p. 99-124
26 p.
|
artikel
|
| 62 |
Oriented equational clauses as a programming language
|
Fribourg, Laurent
|
|
1984
|
|
2 |
p. 165-177
13 p.
|
artikel
|
| 63 |
Or-parallel Prolog on a distributed memory architecture
|
Silva, Fernando
|
|
2000
|
|
2 |
p. 173-186
14 p.
|
artikel
|
| 64 |
Or-parallel PROLOG on shared memory multiprocessors
|
Ciepielewski, Andrzej
|
|
1989
|
|
2 |
p. 125-147
23 p.
|
artikel
|
| 65 |
Prolog for structured character description and font design
|
Dürst, Martin J
|
|
1996
|
|
2 |
p. 133-146
14 p.
|
artikel
|
| 66 |
Prolog program transformations and tree manipulation algorithms
|
Nakagawa, Hiroshi
|
|
1985
|
|
2 |
p. 77-91
15 p.
|
artikel
|
| 67 |
Relating logic programs and attribute grammars
|
Deransart, Pierre
|
|
1985
|
|
2 |
p. 119-155
37 p.
|
artikel
|
| 68 |
Run-time type computations in the Warren Abstract machine
|
Beierle, Christoph
|
|
1994
|
|
2 |
p. 123-148
26 p.
|
artikel
|
| 69 |
Scoping constructs in logic programming: Implementation problems and their solution
|
Nadathur, Gopalan
|
|
1995
|
|
2 |
p. 119-161
43 p.
|
artikel
|
| 70 |
SLDNFA: An abductive procedure for abductive logic programs
|
Denecker, Marc
|
|
1998
|
|
2 |
p. 111-167
57 p.
|
artikel
|
| 71 |
SLDR-resolution: Parallelizing structural recursion in logic programs
|
Millroth, Håkan
|
|
1995
|
|
2 |
p. 93-117
25 p.
|
artikel
|
| 72 |
Special section: Ten Years of Logic Programming
|
Bruynooghe, M.
|
|
1995
|
|
2 |
p. 87-88
2 p.
|
artikel
|
| 73 |
Stable models are generated by a stable chain
|
Herre, Heinrich
|
|
1997
|
|
2 |
p. 165-177
13 p.
|
artikel
|
| 74 |
Structuring logic programs: a modal approach
|
Giordano, Laura
|
|
1994
|
|
2 |
p. 59-94
36 p.
|
artikel
|
| 75 |
Subset-logic programs and their implementation
|
Jayaraman, Bharat
|
|
2000
|
|
2 |
p. 71-110
40 p.
|
artikel
|
| 76 |
Tabulated resolution for the well-founded semantics
|
Bol, Roland
|
|
1998
|
|
2 |
p. 67-109
43 p.
|
artikel
|
| 77 |
Termination of well-moded programs
|
Etalle, S.
|
|
1999
|
|
2 |
p. 243-257
15 p.
|
artikel
|
| 78 |
The consistency of negation as failure
|
Flannagan, Tim
|
|
1986
|
|
2 |
p. 93-114
22 p.
|
artikel
|
| 79 |
The deevolution of concurrent logic programming languages
|
Tick, E.
|
|
1995
|
|
2 |
p. 89-123
35 p.
|
artikel
|
| 80 |
The IFF proof procedure for abductive logic programming
|
Fung, Tze Ho
|
|
1997
|
|
2 |
p. 151-165
15 p.
|
artikel
|
| 81 |
The NRL Protocol Analyzer: An Overview
|
Meadows, Catherine
|
|
1996
|
|
2 |
p. 113-131
19 p.
|
artikel
|
| 82 |
Toward a declarative semantics for infinite objects in logic programming
|
Golson, William G.
|
|
1988
|
|
2 |
p. 151-164
14 p.
|
artikel
|
| 83 |
Tracing Prolog programs by source instrumentation is efficient enough
|
Ducassé, Mireille
|
|
2000
|
|
2 |
p. 157-172
16 p.
|
artikel
|
| 84 |
Ultrametric spaces and logic programming
|
Priess-Crampe, Sibylla
|
|
2000
|
|
2 |
p. 59-70
12 p.
|
artikel
|
| 85 |
Undecidable boundedness problems for datalog programs
|
Hillebrand, Gerd G
|
|
1995
|
|
2 |
p. 163-190
28 p.
|
artikel
|
| 86 |
Unification as a complexity measure for logic programming
|
Itai, A.
|
|
1987
|
|
2 |
p. 105-117
13 p.
|
artikel
|
| 87 |
Update by means of inference rules
|
Przymusinski, Teodor C.
|
|
1997
|
|
2 |
p. 125-143
19 p.
|
artikel
|
| 88 |
Using logic programming and coroutining for electronic CAD
|
Bieker, Ulrich
|
|
1996
|
|
2 |
p. 199-215
17 p.
|
artikel
|
Tijdschrift beschrijving