Digitale Bibliotheek
Sluiten Bladeren door artikelen uit een tijdschrift
 
Zoeken naar met titel:
ABCDEFGHIJKLMNOPQRSTUVWXYZ

     Tijdschrift beschrijving
       Alle jaargangen van het bijbehorende tijdschrift
         Alle afleveringen van het bijbehorende jaargang
                                       Alle artikelen van de bijbehorende aflevering
 
                             137 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 A basis for deductive database systems II Lloyd, J.W.
 1986
 1 p. 55-67
13 p.
 artikel
2 Absys: the first logic programming language —A retrospective and a commentary Elcock, E.W.
 1990
 1 p. 1-17
17 p.
 artikel
3 A confluent semantic basis for the analysis of concurrent constraint logic programs Codish, Michael
 1997
 1 p. 53-81
29 p.
 artikel
4 A constructive view of PROLOG Bojadziev, Damjan
 1986
 1 p. 69-74
6 p.
 artikel
5 A declarative semantics for depth-first logic programs 1 The research reported here is based on Ref. [12]. 1 Elbl, Birgit
 1999
 1 p. 27-66
40 p.
 artikel
6 A declarative state transition system Foster, Ian
 1991
 1 p. 45-67
23 p.
 artikel
7 A fixpoint semantics for disjunctive logic programs Minker, Jack
 1990
 1 p. 45-74
30 p.
 artikel
8 A KWIC (key word in context) bibliography on prolog and logic programming Poe, MichaelD.
 1984
 1 p. 81-99
19 p.
 artikel
9 A language for updating logic programs and its implementation Leone, Nicola
 1995
 1 p. 1-61
61 p.
 artikel
10 Algebraic and logical semantics for CLP languages with dynamic scheduling Marriott, Kim
 1997
 1 p. 71-84
14 p.
 artikel
11 Algorithms for testing the satisfiability of propositional formulae Gallo, Giorgio
 1989
 1 p. 45-61
17 p.
 artikel
12 A logical approach to cooperative information systems Bertino, Elisa
 2000
 1 p. 15-48
34 p.
 artikel
13 Alternation and the computational complexity of logic programs Shapiro, Ehud Y.
 1984
 1 p. 19-33
15 p.
 artikel
14 Amalgamating knowledge bases, III: Algorithms, data structures and query processing Adali, Sibel
 1996
 1 p. 45-88
44 p.
 artikel
15 A methodology for proving termination of logic programs Wang, Bal
 1994
 1 p. 1-30
30 p.
 artikel
16 An algebraic framework for the definition of compositional semantics of normal logic programs Lucio, Paqui
 1999
 1 p. 89-123
35 p.
 artikel
17 An approach to declarative programming based on a rewriting logic González-Moreno, J.C.
 1999
 1 p. 47-87
41 p.
 artikel
18 And—or parallelism on shared-memory multiprocessors Gupta, Gopal
 1993
 1 p. 59-89
31 p.
 artikel
19 A new term representation method for prolog Li, Xining
 1998
 1 p. 43-57
15 p.
 artikel
20 A note on the complexity of the satisfiability of modal Horn clauses Del Cerro, Luis Fariñas
 1987
 1 p. 1-10
10 p.
 artikel
21 A parallel prolog system for distributed memory Araujo, Lourdes
 1997
 1 p. 49-79
31 p.
 artikel
22 Applying interval arithmetic to real, integer, and boolean constraints Benhamou, Frédéric
 1997
 1 p. 1-24
24 p.
 artikel
23 A pragmatic reconstruction of λProlog Belleannée, Catherine
 1999
 1 p. 67-102
36 p.
 artikel
24 A procedural semantics for well-founded negation in logic programs Ross, Kenneth A.
 1992
 1 p. 1-22
22 p.
 artikel
25 A semantic basis for the termination analysis of logic programs Codish, Michael
 1999
 1 p. 103-123
21 p.
 artikel
26 A semantics for a class of stratified production system programs Raschid, Louiqa
 1994
 1 p. 31-57
27 p.
 artikel
27 A simple approach to supporting untagged objects in dynamically typed languages Bigot, Peter A.
 1997
 1 p. 25-47
23 p.
 artikel
28 A simple code improvement scheme for prolog Debray, Saumya K.
 1992
 1 p. 57-88
32 p.
 artikel
29 Automated theorem proving and logic programming: a natural symbiosis Wos, Larry
 1991
 1 p. 1-53
53 p.
 artikel
30 Bottom-up computation of perfect models for disjunctive theories Fernández, JoséAlberto
 1995
 1 p. 33-51
19 p.
 artikel
31 Call for papers 1988
 1 p. 92-
1 p.
 artikel
32 Clausal intuitionistic logic I. fixed-point semantics McCarty, L.Thorne
 1988
 1 p. 1-31
31 p.
 artikel
33 Comments on “logic programming with equations” Bosco, Pier Giorgio
 1991
 1 p. 85-89
5 p.
 artikel
34 Completed logic programs and their consistency Sato, Taisuke
 1990
 1 p. 33-44
12 p.
 artikel
35 Cuts and side-effects in and-or parallel Prolog Gupta, Gopal
 1996
 1 p. 45-71
27 p.
 artikel
36 Datalog with non-deterministic choice computes NDB-PTIME Giannotti, Fosca
 1998
 1 p. 79-101
23 p.
 artikel
37 Defeasible logic versus Logic Programming without Negation as Failure Antoniou, G.
 2000
 1 p. 47-57
11 p.
 artikel
38 Definite-clause set grammars: a formalism for problem solving Tanaka, Takushi
 1991
 1 p. 1-17
17 p.
 artikel
39 Denotational and operational semantics for prolog Debray, Saumya K.
 1988
 1 p. 61-91
31 p.
 artikel
40 Depth-bounded bottom-up evaluation of logic programs Chomicki, Jan
 1995
 1 p. 1-31
31 p.
 artikel
41 Deterministic and nondeterministic computation, and horn programs, on abstract data types Tucker, J.V.
 1992
 1 p. 23-55
33 p.
 artikel
42 Differential methods in logic program analysis García de la Banda, Maria
 1998
 1 p. 1-37
37 p.
 artikel
43 Editorial Board 1995
 1 p. IFC-
1 p.
 artikel
44 Editorial Board 1999
 1 p. IFC-
1 p.
 artikel
45 Editorial Board 1999
 1 p. IFC-
1 p.
 artikel
46 Editorial Board 1998
 1 p. IFC-
1 p.
 artikel
47 Editorial Board 1998
 1 p. IFC-
1 p.
 artikel
48 Editorial Board 1998
 1 p. IFC-
1 p.
 artikel
49 Editorial Board 1995
 1 p. IFC-
1 p.
 artikel
50 Editorial Board 1995
 1 p. IFC-
1 p.
 artikel
51 Editorial Board 1996
 1 p. IFC-
1 p.
 artikel
52 Editorial Board 1997
 1 p. IFC-
1 p.
 artikel
53 Editorial Board 1996
 1 p. IFC-
1 p.
 artikel
54 Editorial Board 1997
 1 p. IFC-
1 p.
 artikel
55 Editorial Board 1996
 1 p. IFC-
1 p.
 artikel
56 Editorial board 1991
 1 p. IFC-
1 p.
 artikel
57 Editorial Board 1997
 1 p. IFC-
1 p.
 artikel
58 Editorial Board 1990
 1 p. IFC-
1 p.
 artikel
59 Editorial board 1993
 1 p. IFC-
1 p.
 artikel
60 Editorial board 1994
 1 p. IFC-
1 p.
 artikel
61 Editorial board 1991
 1 p. IFC-
1 p.
 artikel
62 Editorial Board 1992
 1 p. IFC-
1 p.
 artikel
63 Editorial Board 1984
 1 p. IFC-
1 p.
 artikel
64 Editorial Board 1987
 1 p. IFC-
1 p.
 artikel
65 Editorial Board 1988
 1 p. IFC-
1 p.
 artikel
66 Editorial Board 1986
 1 p. IFC-
1 p.
 artikel
67 Editorial board 1985
 1 p. IFC-
1 p.
 artikel
68 Editorial board 1989
 1 p. IFC-
1 p.
 artikel
69 Editor's introduction Robinson, J.A.
 1984
 1 p. 1-2
2 p.
 artikel
70 Efficient access mechanisms for tabled logic programs Ramakrishnan, I.V
 1999
 1 p. 31-54
24 p.
 artikel
71 Efficient loop detection in prolog using the tortoise-and-hare technique Van Gelder, Allen
 1987
 1 p. 23-31
9 p.
 artikel
72 Embedding revision programs in logic programming situation calculus Baral, Chitta
 1997
 1 p. 83-97
15 p.
 artikel
73 Enhancing unification in PROLOG through clause indexing Colomb, Robert M.
 1991
 1 p. 23-44
22 p.
 artikel
74 Enumeration operators and modular logic programming Fitting, Melvin
 1987
 1 p. 11-21
11 p.
 artikel
75 Expressive capabilities description languages and query rewriting algorithms Vassalos, Vasilis
 2000
 1 p. 75-122
48 p.
 artikel
76 Extending negation as failure by abduction: A three-valued stable model semantics Giordano, Laura
 1996
 1 p. 31-67
37 p.
 artikel
77 Formal synthesis of a unification algorithm by the deductive-tableau method Nardi, Danielle
 1989
 1 p. 1-43
43 p.
 artikel
78 From context-free to definite-clause grammars: a type-theoretic approach Haas, Juergen
 1997
 1 p. 1-23
23 p.
 artikel
79 Guest editor's introduction: Logic-based heterogeneous information systems Ramakrishnan, Raghu
 2000
 1 p. 1-2
2 p.
 artikel
80 Hierarchical representation of legal knowledge with metaprogramming in logic Barklund, Jonas
 1994
 1 p. 55-80
26 p.
 artikel
81 Horn clause queries and generalizations Chandra, Ashok K.
 1985
 1 p. 1-15
15 p.
 artikel
82 Inference rules and proof procedures for inequations Mohan, Chilukuri K.
 1990
 1 p. 75-104
30 p.
 artikel
83 In Memoriam: Paris C. Kanellakis Van Hentenryck, Pascal
 1996
 1 p. 1-3
3 p.
 artikel
84 Intuitionistic deductive databases and the polynomial time hierarchy Bonner, Anthony J
 1997
 1 p. 1-47
47 p.
 artikel
85 KWIC (key word in context) 1984
 1 p. 100-142
43 p.
 artikel
86 {log}: A language for programming in logic with finite sets Dovier, Agostino
 1996
 1 p. 1-44
44 p.
 artikel
87 Logic programming and digital circuit analysis Clocksin, W.F.
 1987
 1 p. 59-82
24 p.
 artikel
88 Lower bounds for the lengths of refutations Ko, Hai-Ping
 1993
 1 p. 31-58
28 p.
 artikel
89 Matching of bounded set terms in the logic language LDL ++ Arni, Natraj
 1996
 1 p. 73-87
15 p.
 artikel
90 Minimal consequence in sentential logic Papalaskari, Mary-Angela
 1990
 1 p. 19-31
13 p.
 artikel
91 Model generation and state generation for disjunctive logic programs Seipel, Dietmar
 1997
 1 p. 49-69
21 p.
 artikel
92 Negation and minimality in disjunctive databases Schaerf, Marco
 1995
 1 p. 63-86
24 p.
 artikel
93 Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption Shepherdson, John C.
 1984
 1 p. 51-79
29 p.
 artikel
94 Negation as failure in the head Inoue, Katsumi
 1998
 1 p. 39-78
40 p.
 artikel
95 Negation as inconsistency. I Gabbay, D.M.
 1986
 1 p. 1-35
35 p.
 artikel
96 Notes on the implementation of PARLOG Clark, Keith
 1985
 1 p. 17-42
26 p.
 artikel
97 On determining the causes of nonunifiability Cox, P.T.
 1987
 1 p. 33-58
26 p.
 artikel
98 On-line algorithms for polynomially solvable satisfiability problems Ausiello, Giorgio
 1991
 1 p. 69-90
22 p.
 artikel
99 On negation in Hilog Ross, Kenneth A
 1994
 1 p. 27-53
27 p.
 artikel
100 On specifying database updates Reiter, Raymond
 1995
 1 p. 53-91
39 p.
 artikel
101 On termination of general logic programs w.R.T. constructive negation Marchiori, Elena
 1996
 1 p. 69-89
21 p.
 artikel
102 On the Floyd–Warshall algorithm for logic programs Papadimitriou, Christos
 1999
 1 p. 129-137
9 p.
 artikel
103 On the relationship between indexed grammars and logic programs Bertsch, Eberhard
 1994
 1 p. 81-98
18 p.
 artikel
104 On the sequential nature of unification Dwork, Cynthia
 1984
 1 p. 35-50
16 p.
 artikel
105 Operational and goal-independent denotational semantics for Prolog with cut Spoto, Fausto
 2000
 1 p. 1-46
46 p.
 artikel
106 Optimizing bottom-up evaluation of constraint queries Kemp, David B.
 1996
 1 p. 1-30
30 p.
 artikel
107 Parallel execution of logic programs by load sharing Lin, Zheng
 1997
 1 p. 25-51
27 p.
 artikel
108 Partial deduction of updateable definite logic programs Benkerimi, K.
 1994
 1 p. 1-26
26 p.
 artikel
109 Perspectives in deductive databases Minker, Jack
 1988
 1 p. 33-60
28 p.
 artikel
110 Polymorphic type analysis in logic programs by abstract interpretation Lu, Lunjin
 1998
 1 p. 1-54
54 p.
 artikel
111 Pressing for parallelism: a PROLOG program made Concurrent Sterling, Leon
 1986
 1 p. 75-92
18 p.
 artikel
112 Prolog for programmers Helm, Richard
 1987
 1 p. 83-84
2 p.
 artikel
113 Proving properties of committed choice logic programs Naish, Lee
 1989
 1 p. 63-84
22 p.
 artikel
114 Quantitative deduction and its fixpoint theory Van Emden, M.H.
 1986
 1 p. 37-53
17 p.
 artikel
115 Reasoning on constraints in CLP(FD) Lamma, Evelina
 1999
 1 p. 93-110
18 p.
 artikel
116 Recursive query plans for data integration Duschka, Oliver M.
 2000
 1 p. 49-73
25 p.
 artikel
117 Representing knowledge with theories about theories Stabler Jr., Edward P.
 1990
 1 p. 105-138
34 p.
 artikel
118 Return value placement and tail call optimization in high level languages Bigot, Peter A
 1999
 1 p. 1-29
29 p.
 artikel
119 Semantics of (disjunctive) logic programs based on partial evaluation Brass, Stefan
 1999
 1 p. 1-46
46 p.
 artikel
120 Set constructors, finite sets, and logical semantics Jayaraman, Bharat
 1999
 1 p. 55-77
23 p.
 artikel
121 Short note: procedural semantics and negative information of elementary formal system Yamamoto, Akihiro
 1992
 1 p. 89-97
9 p.
 artikel
122 Some global optimizations for a PROLOG compiler Mellish, C.S.
 1985
 1 p. 43-66
24 p.
 artikel
123 Stable generated models, partial temporal logic and disjunctive defaults Engelfriet, Joeri
 1999
 1 p. 1-25
25 p.
 artikel
124 Stable inference as intuitionistic validity Pearce, David
 1999
 1 p. 79-91
13 p.
 artikel
125 Stable models and their computation for logic programming with inheritance and true negation Buccafurri, F.
 1996
 1 p. 5-43
39 p.
 artikel
126 Strict and nonstrict independent and-parallelism in logic programs: Correctness, efficiency, and compile-time conditions Hermenegildo, Manuel V.
 1995
 1 p. 1-45
45 p.
 artikel
127 Subsumption-stratified datalog Meskes, Michael
 1998
 1 p. 55-90
36 p.
 artikel
128 Success and failure for hereditary Harrop formulae Harland, James
 1993
 1 p. 1-29
29 p.
 artikel
129 Synthesis of a unification algorithm in a logic programming calculus Eriksson, Lars-Henrik
 1984
 1 p. 3-18
16 p.
 artikel
130 The horn basis of a set of clauses Hébrard, Jean-Jacques
 1998
 1 p. 59-66
8 p.
 artikel
131 The reduce-or process model for parallel execution of logic programs Kalé, Laxmikant V.
 1991
 1 p. 55-84
30 p.
 artikel
132 Top-down semantics of fair computations of logic programs Emden, M.H.van
 1985
 1 p. 67-75
9 p.
 artikel
133 Transformational methodology for proving termination of logic programs Krishna Rao, M.R.K.
 1998
 1 p. 1-41
41 p.
 artikel
134 Unsolvable problems for SLDNF resolution Shepherdson, John C.
 1991
 1 p. 19-22
4 p.
 artikel
135 Using MedLan to integrate geographical data Aquilino, D.
 2000
 1 p. 3-14
12 p.
 artikel
136 Why untyped nonground metaprogramming is not (much of) a problem Martens, Bern
 1995
 1 p. 47-99
53 p.
 artikel
137 Worst-case groundness analysis using positive Boolean functions Codish, Michael
 1999
 1 p. 125-128
4 p.
 artikel
                             137 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland