AAAAAA

   
Results: 1-25 | 26-50 | 51-75 | 76-100 | >>

Table of contents of journal: The *Journal of logic programming

Results: 76-100/155

Authors: HAAS J JAYARAMAN B
Citation: J. Haas et B. Jayaraman, FROM CONTEXT-FREE TO DEFINITE-CLAUSE GRAMMARS - A TYPE-THEORETIC APPROACH, The journal of logic programming, 30(1), 1997, pp. 1-23

Authors: LIN Z
Citation: Z. Lin, PARALLEL EXECUTION OF LOGIC PROGRAMS BY LOAD SHARING, The journal of logic programming, 30(1), 1997, pp. 25-51

Authors: CODISH M FALASCHI M MARRIOTT K WINSBOROUGH W
Citation: M. Codish et al., A CONFLUENT SEMANTIC BASIS FOR THE ANALYSIS OF CONCURRENT CONSTRAINT LOGIC PROGRAMS, The journal of logic programming, 30(1), 1997, pp. 53-81

Authors: BARAL C
Citation: C. Baral, EMBEDDING REVISION PROGRAMS IN LOGIC PROGRAMMING SITUATION CALCULUS, The journal of logic programming, 30(1), 1997, pp. 83-97

Authors: GUPTA G CARLSSON M
Citation: G. Gupta et M. Carlsson, GUEST EDITORS INTRODUCTION - HIGH-PERFORMANCE IMPLEMENTATIONS OF LOGIC PROGRAMMING SYSTEMS, The journal of logic programming, 29(1-3), 1996, pp. 1-3

Authors: TAYLOR A
Citation: A. Taylor, PARMA - BRIDGING THE PERFORMANCE GAP BETWEEN IMPERATIVE AND LOGIC PROGRAMMING, The journal of logic programming, 29(1-3), 1996, pp. 5-16

Authors: SOMOGYI Z HENDERSON F CONWAY T
Citation: Z. Somogyi et al., THE EXECUTION ALGORITHM OF MERCURY, AN EFFICIENT PURELY DECLARATIVE LOGIC PROGRAMMING LANGUAGE, The journal of logic programming, 29(1-3), 1996, pp. 17-64

Authors: TARAU P DEBOSSCHERE K DEMOEN B
Citation: P. Tarau et al., PARTIAL TRANSLATION - TOWARDS A PORTABLE AND EFFICIENT PROLOG IMPLEMENTATION TECHNOLOGY, The journal of logic programming, 29(1-3), 1996, pp. 65-83

Authors: KRALL A
Citation: A. Krall, THE VIENNA ABSTRACT MACHINE, The journal of logic programming, 29(1-3), 1996, pp. 85-106

Authors: HOLMER BK SANO B CARLTON M VANROY P DESPAIN AM
Citation: Bk. Holmer et al., DESIGN AND ANALYSIS OF HARDWARE FOR HIGH-PERFORMANCE PROLOG, The journal of logic programming, 29(1-3), 1996, pp. 107-139

Authors: TICK E MASSEY BC LARSON JS
Citation: E. Tick et al., EXPERIENCE WITH THE SUPER MONACO OPTIMIZING COMPILER, The journal of logic programming, 29(1-3), 1996, pp. 141-169

Authors: DEBRAY S GUDEMAN D BIGOT P
Citation: S. Debray et al., DETECTION AND OPTIMIZATION OF SUSPENSION-FREE LOGIC PROGRAMS, The journal of logic programming, 29(1-3), 1996, pp. 171-194

Authors: SMITH DA
Citation: Da. Smith, MULTILOG AND DATA OR PARALLELISM, The journal of logic programming, 29(1-3), 1996, pp. 195-244

Authors: SHEN K
Citation: K. Shen, OVERVIEW OF DASWAM - EXPLOITATION OF DEPENDENT AND PARALLELISM, The journal of logic programming, 29(1-3), 1996, pp. 245-293

Authors: CODISH M DAMS D FILE G BRUYNOOGHE M
Citation: M. Codish et al., ON THE DESIGN OF A CORRECT FREENESS ANALYSIS FOR LOGIC PROGRAMS, The journal of logic programming, 28(3), 1996, pp. 181-206

Authors: DEGTYAREV A VORONKOV A
Citation: A. Degtyarev et A. Voronkov, A NOTE ON SEMANTICS OF LOGIC PROGRAMS WITH EQUALITY BASED ON COMPLETE-SETS OF E-UNIFIERS, The journal of logic programming, 28(3), 1996, pp. 207-216

Authors: LINDGREN T
Citation: T. Lindgren, POLYVARIANT DETECTION OF UNINITIALIZED ARGUMENTS OF PROLOG PREDICATES, The journal of logic programming, 28(3), 1996, pp. 217-229

Authors: BECKERT B POSEGGA J
Citation: B. Beckert et J. Posegga, LOGIC PROGRAMMING AS A BASIS FOR LEAN AUTOMATED DEDUCTION, The journal of logic programming, 28(3), 1996, pp. 231-236

Authors: MARTENS B DESCHREYE D
Citation: B. Martens et D. Deschreye, AUTOMATIC FINITE UNFOLDING USING WELL-FOUNDED MEASURES, The journal of logic programming, 28(2), 1996, pp. 89-146

Authors: APT KR GABBRIELLI M PEDRESCHI D
Citation: Kr. Apt et al., A CLOSER LOOK AT DECLARATIVE INTERPRETATIONS, The journal of logic programming, 28(2), 1996, pp. 147-180

Authors: DOVIER A OMODEO EG PONTELLI E ROSSI G
Citation: A. Dovier et al., (LOG) - A LANGUAGE FOR PROGRAMMING IN LOGIC WITH FINITE SETS, The journal of logic programming, 28(1), 1996, pp. 1-44

Authors: ADALI S SUBRAHMANIAN VS
Citation: S. Adali et Vs. Subrahmanian, AMALGAMATING KNOWLEDGE BASES .3. ALGORITHMS, DATA-STRUCTURES, AND QUERY-PROCESSING, The journal of logic programming, 28(1), 1996, pp. 45-88

Authors: CODOGNET P DIAZ D
Citation: P. Codognet et D. Diaz, COMPILING CONSTRAINTS IN CLP(FD), The journal of logic programming, 27(3), 1996, pp. 185-226

Authors: DEVIENNE P LEBEGUE P PARRAIN A ROUTIER JC WURTZ J
Citation: P. Devienne et al., SMALLEST HORN CLAUSE PROGRAMS, The journal of logic programming, 27(3), 1996, pp. 227-267

Authors: DRABENT W
Citation: W. Drabent, COMPLETENESS OF SLDNF-RESOLUTION FOR NONFLOUNDERING QUERIES, The journal of logic programming, 27(2), 1996, pp. 89-106
Risultati: 1-25 | 26-50 | 51-75 | 76-100 | >>