Declarative and procedural paradigms-do they really compete? (English)
National licence
Panel outline
- New search for: Boley, Harold
- New search for: Meier, Micha
- New search for: Moss, Chris
- New search for: Richter, Michael M.
- New search for: Voronkov, A. A.
- New search for: Boley, Harold
- New search for: Meier, Micha
- New search for: Moss, Chris
- New search for: Richter, Michael M.
- New search for: Voronkov, A. A.
In:
Processing Declarative Knowledge
;
383-398
;
1991
- Article/Chapter (Book) / Electronic Resource
-
Title:Declarative and procedural paradigms-do they really compete?
-
Subtitle:Panel outline
-
Contributors:Boley, Harold ( author ) / Meier, Micha ( author ) / Moss, Chris ( author ) / Richter, Michael M. ( author ) / Voronkov, A. A. ( author )
-
Published in:Processing Declarative Knowledge ; 383-398Lecture Notes in Computer Science ; 567 ; 383-398
-
Publisher:
- New search for: Springer Berlin Heidelberg
-
Place of publication:Berlin, Heidelberg
-
Publication date:1991-01-01
-
Size:16 pages
-
ISBN:
-
ISSN:
-
DOI:
-
Type of media:Article/Chapter (Book)
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Source:
Table of contents eBook
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
Efficient processing of declarative rule-based languages for DatabasesZaniolo, Carlo et al. | 1991
- 17
-
Has dedicated hardware for Prolog a future ?Dorochevsky, Michel / Noyé, Jacques / Thibault, Olivier et al. | 1991
- 32
-
Commercial applications of large Prolog knowledge basesMoss, Chris et al. | 1991
- 41
-
Compiling conceptual graphsEllis, Gerard et al. | 1991
- 56
-
Subsumption in knowledge graphsWillems, Mark et al. | 1991
- 67
-
A terminological knowledge representation system with complete inference algorithmsBaader, Franz / Hollunder, Bernhard et al. | 1991
- 87
-
An introduction to dynamic concept systemsJaeger, Herbert et al. | 1991
- 107
-
Querying concept-based knowledge basesLenzerini, Maurizio / Schaerf, Andrea et al. | 1991
- 124
-
Subsumption computation in an object-oriented data modelArtale, A. / Cesarini, F. / Soda, G. et al. | 1991
- 141
-
A concise presentation of ITLGuarino, Nicola et al. | 1991
- 161
-
Distributed disjunctions for LIFEBackofen, Rolf / Euler, Lutz / Görz, Günther et al. | 1991
- 171
-
Reasoning with maximal time intervalsRibeiro, Cristina / Porto, António et al. | 1991
- 179
-
Nonclassical models for logic programsKriaučiukas, Valentinas et al. | 1991
- 191
-
Logical operational semantics of Parlog part I: And-ParallelismBörger, Egon / Riccobene, Elvinia et al. | 1991
- 199
-
A tool for building connectionist-like networks based on term unificationMarkov, Zdravko et al. | 1991
- 214
-
Providing declarative access to a processing system for satellite image dataRiekert, Wolf-Fritz et al. | 1991
- 221
-
Declarative functionality descriptions of interactive reasoning modulesTreur, Jan et al. | 1991
- 237
-
Rule-aided constraint resolution in LaureCaseau, Yves et al. | 1991
- 257
-
Flang: A functional-logic languageMantsivoda, Andrei V. et al. | 1991
- 271
-
Processing functional definitions as declarative knowledge: A reduced bytecode implementation of a functional logic machineBonzon, Pierre et al. | 1991
- 279
-
Reducing scheduling overheads for concurrent logic programsKing, Andy / Soper, Paul et al. | 1991
- 287
-
A general framework for knowledge compilationKautz, Henry / Selman, Bart et al. | 1991
- 301
-
Data-driven transformation of meta-interpreters: A sketchCosmadopoulos, Yannis / Sergot, Marek / Southwick, Richard W. et al. | 1991
- 309
-
Improving the efficiency of constraint logic programming languages by deriving specialized versionsBruynooghe, M. / Dumortier, V. / Janssens, G. et al. | 1991
- 318
-
Parallelizing Prolog on shared-memory multiprocessorsYaoqing, Gao / Dingxing, Wang / Xiaolin, Qiu / Zhiyi, Hwang / Shouren, Hu et al. | 1991
- 336
-
Processing abductive reasoning via Contextual Logic ProgrammingLamma, Evelina / Mello, Paola et al. | 1991
- 344
-
Efficient implementation of narrowing and rewritingHanus, Michael et al. | 1991
- 366
-
Tim: The toulouse inference machine for non-classical logic programmingBalbiani, Philippe / Herzig, Andreas / Marques, Mamede Lima et al. | 1991
- 383
-
Declarative and procedural paradigms-do they really compete?Boley, Harold / Meier, Micha / Moss, Chris / Richter, Michael M. / Voronkov, A. A. et al. | 1991
- 399
-
The GCLA II programming languageAronsson, Martin / Eriksson, Lars-Henrik et al. | 1991
- 402
-
A brief description of the PROTOS-L systemBeierle, Christoph / Meyer, Gregor / Semle, Heiner et al. | 1991
- 405
-
PCPL — PROLOG constraint processing library version 2.0Fricke, Stefan / Hein, Manfred et al. | 1991
- 408
-
A mini-description of the ITL systemGuarino, Nicola et al. | 1991
- 411
-
Taxon: A concept language with concrete domainsHanschke, Philipp / Abecker, Andreas / Drollinger, Dennis et al. | 1991
- 414
-
The ALF system: An efficient implementation of a functional logic languageHanus, Michael et al. | 1991
- 417
-
Transforming horn clauses for forward reasoningHinkelmann, Knut / Harm, Martin / Labisch, Thomas et al. | 1991
- 420
-
Implementation of the functional-logic language flangMantsivoda, A. / Petukhin, V. et al. | 1991
- 422
-
SEPIA 3.0 — An extensible prolog systemMeier, Micha / Schimpf, Joachim et al. | 1991
- 425
-
FIDO: Exploring finite domain consistency techniques in logic programmingMeyer, Manfred / Müller, Jörg / Schrödl, Stefan et al. | 1991