Digitale Bibliotheek
Sluiten Bladeren door artikelen uit een tijdschrift
     Tijdschrift beschrijving
       Alle jaargangen van het bijbehorende tijdschrift
         Alle afleveringen van het bijbehorende jaargang
                                       Alle artikelen van de bijbehorende aflevering
 
                             67 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 Abstract interpretation based on Alexander Templates Kanamori, Tadashi
1993
1-2 p. 31-54
24 p.
artikel
2 Abstract interpretation based on oldt resolution Kanamori, Tadashi
1993
1-2 p. 1-30
30 p.
artikel
3 A calculus for the construction of modular prolog programs Sannella, D.T.
1992
1-2 p. 147-177
31 p.
artikel
4 A comparison of three PROLOG extensions Reed, David W.
1992
1-2 p. 25-50
26 p.
artikel
5 A complete axiomatization of a theory with feature and arity constraints Backofen, Rolf
1995
1-2 p. 37-71
35 p.
artikel
6 A high-performance low risc machine for logic programming Mills, J.W
1989
1-2 p. 179-212
34 p.
artikel
7 A linear axiomatization of negation as failure Cerrito, Serenella
1992
1-2 p. 1-24
24 p.
artikel
8 A logical analysis of modules in logic programming Miller, Dale
1989
1-2 p. 79-108
30 p.
artikel
9 An expert system for harmonizing chorales in the style of J.S. Bach Ebci̇oğlu, Kemal
1990
1-2 p. 145-185
41 p.
artikel
10 An implementation of narrowing Josephson, Alan
1989
1-2 p. 57-77
21 p.
artikel
11 A simple test improves checking satisfiability Lozinskii, Eliezer L.
1993
1-2 p. 99-111
13 p.
artikel
12 A Temporal extension of Prolog Hrycej, Tomas
1993
1-2 p. 113-145
33 p.
artikel
13 AUNT: A Universal netlist translator Reintjes, Peter B.
1990
1-2 p. 5-19
15 p.
artikel
14 Basic transformation operations which preserve computed answer substitutions of logic programs Bossi, A.
1993
1-2 p. 47-87
41 p.
artikel
15 Compilation of set terms in the logic data language (LDL) Shmueli, Oded
1992
1-2 p. 89-119
31 p.
artikel
16 Compiling control Bruynooghe, Maurice
1989
1-2 p. 135-162
28 p.
artikel
17 Database updates in the event calculus Kowalski, Robert
1992
1-2 p. 121-146
26 p.
artikel
18 Decidability of logic program semantics and applications to testing Ruggieri, Salvatore
2000
1-2 p. 103-137
35 p.
artikel
19 Editorial Board 1995
1-2 p. IFC-
1 p.
artikel
20 Editorial Board 1990
1-2 p. IFC-
1 p.
artikel
21 Editorial Board 1992
1-2 p. IFC-
1 p.
artikel
22 Editorial Board 1992
1-2 p. IFC-
1 p.
artikel
23 Editorial board 1993
1-2 p. IFC-
1 p.
artikel
24 Editorial Board 1993
1-2 p. IFC-
1 p.
artikel
25 Editorial Board 1989
1-2 p. IFC-
1 p.
artikel
26 Efficient run-time type checking of typed logic programs Dart, Philip W.
1992
1-2 p. 31-69
39 p.
artikel
27 Extending SLD resolution to equational horn clauses using E-unification Gallier, Jean H
1989
1-2 p. 3-43
41 p.
artikel
28 Feature-constraint logics for unification grammars Smolka, Gert
1992
1-2 p. 51-87
37 p.
artikel
29 Guest editors Haridi, Seif
1989
1-2 p. 1-2
2 p.
artikel
30 Guest Editor's Introduction Komorowski, Jan
1993
1-2 p. 1-3
3 p.
artikel
31 Guest editor's introduction Sterling, Leon
1990
1-2 p. 1-3
3 p.
artikel
32 Index 2000
1-2 p. 157-
1 p.
artikel
33 Index 2000
1-2 p. 159-
1 p.
artikel
34 Logic-based configuration with a semantic network Searls, David B
1990
1-2 p. 53-73
21 p.
artikel
35 Logic programming for real-time control of telecommunication switching systems Elshiewy, Nabiel A.
1990
1-2 p. 121-144
24 p.
artikel
36 Loop checking and negation Bol, Roland N.
1993
1-2 p. 147-175
29 p.
artikel
37 Loop checking in partial deduction Bol, Roland
1993
1-2 p. 25-46
22 p.
artikel
38 Meta-agent programs Dix, Jürgen
2000
1-2 p. 1-60
60 p.
artikel
39 Metainterpreters for expert system construction Sterling, Leon
1989
1-2 p. 163-178
16 p.
artikel
40 Mockingbird: A logical methodology for testing Gorlick, Michael M.
1990
1-2 p. 95-119
25 p.
artikel
41 Modeling simultaneous events with default reasoning and tight derivations Van Gelder, Allen
1990
1-2 p. 41-52
12 p.
artikel
42 More on tractable disjunctive Datalog Ben-Eliyahu-Zohary, Rachel
2000
1-2 p. 61-101
41 p.
artikel
43 Negation as failure using tight derivations for general logic programs Van Gelder, Allen
1989
1-2 p. 109-133
25 p.
artikel
44 On rewrite programs: Semantics and relationship with prolog Bonacina, Maria Paola
1992
1-2 p. 155-180
26 p.
artikel
45 On the use of advanced logic programming languages in computational linguistics Coupet-Grimal, Solange
1995
1-2 p. 121-159
39 p.
artikel
46 On Van Gelder's loop detection algorithm Skordev, Dimiter
1992
1-2 p. 181-183
3 p.
artikel
47 Pair-sharing over rational trees King, Andy
2000
1-2 p. 139-155
17 p.
artikel
48 Parallel bottom-up processing of datalog queries Ganguly, Sumit
1992
1-2 p. 101-126
26 p.
artikel
49 Partial deduction for structured logic programming Bugliesi, Michele
1993
1-2 p. 89-122
34 p.
artikel
50 Principles and implementation of deductive parsing Shieber, Stuart M.
1995
1-2 p. 3-36
34 p.
artikel
51 Prolog: subsumption of equality axioms by the homogeneous form Elcock, E.W.
1989
1-2 p. 45-56
12 p.
artikel
52 Proving termination properties of prolog programs: A semantic approach Baudinet, Marianne
1992
1-2 p. 1-29
29 p.
artikel
53 PYTHON: An expert squeezer Sterling, Leon
1990
1-2 p. 21-39
19 p.
artikel
54 Solving large combinatorial problems in logic programming Dincbas, Mehmet
1990
1-2 p. 75-93
19 p.
artikel
55 Solving the incremental satisfiability problem Hooker, J.N.
1993
1-2 p. 177-186
10 p.
artikel
56 Special issue: Computational linguistics and logic programming Dahl, V.
1995
1-2 p. 1-2
2 p.
artikel
57 String variable grammar: A logic grammar formalism for the biological language of DNA Searls, David B.
1995
1-2 p. 73-102
30 p.
artikel
58 Strong termination of logic programs Bezem, Marc
1993
1-2 p. 79-97
19 p.
artikel
59 The defining power of stratified and hierarchical logic programs Jäger, Gerhard
1993
1-2 p. 55-77
23 p.
artikel
60 The expressive power of side effects in prolog Makowsky, J.A.
1992
1-2 p. 179-188
10 p.
artikel
61 The loop absorption and the generalization strategies for the development of logic programs and partial deduction Proietti, Maurizio
1993
1-2 p. 123-161
39 p.
artikel
62 The term rewriting approach to automated theorem proving Hsiang, Jieh
1992
1-2 p. 71-99
29 p.
artikel
63 Towards a methodology for the design of abstract machines for logic programming languages Nilsson, Ulf
1993
1-2 p. 163-189
27 p.
artikel
64 Unfold⧸fold transformation of general logic programs for the well-founded semantics Seki, Hirohisa
1993
1-2 p. 5-23
19 p.
artikel
65 Unified logic programming approach to the abduction of plans and intentions in information-seeking dialogues Quaresma, Paulo
1995
1-2 p. 103-119
17 p.
artikel
66 Van Gelder's response Van Gelder, A.
1992
1-2 p. 185-
1 p.
artikel
67 What should a database know? Reiter, Raymond
1992
1-2 p. 127-153
27 p.
artikel
                             67 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland