The SCEAS System
Navigation Menu

Conferences in DBLP

International Conference on Logic Programming (iclp)
1990 (conf/iclp/90)

  1. Kazunori Ueda, Masao Morita
    A New Implementation Technique for Flat GHC. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:3-17 [Conf]
  2. Yu Inamura, Satoshi Onishi
    A Detection Algorithm of Perpetual Suspension in KL1. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:18-30 [Conf]
  3. Seif Haridi, Sverker Janson
    Kernel Andorra Prolog and its Computation Model. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:31-46 [Conf]
  4. Mark Korsloot, Hans M. Mulder
    Sequential Architecture Models for Prolog: A Performance Comparison. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:49-67 [Conf]
  5. Arie Harsat, Ran Ginosar
    An Extended RISC Methodology and its Application to FCP. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:67-82 [Conf]
  6. Kenji Nishida, Yasunori Kimura, Akira Matsumoto, Atsuhiro Goto
    Evaluation of MRB Garbage Collection on Parallel Logic Programming Architectures. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:83-95 [Conf]
  7. Oded Shmueli, Shalom Tsur
    Incremental Re-evaluation of LDL Queries. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:99-111 [Conf]
  8. Oded Shmueli, Shalom Tsur
    Logical Diagnosis of LDL Programs. [Citation Graph (2, 0)][DBLP]
    ICLP, 1990, pp:112-129 [Conf]
  9. Ulrike Griefahn, Stefan Lüttringhaus
    Top-Down Integrity Constraint Checking for Deductive Databases. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:130-144 [Conf]
  10. Vishv M. Malhotra
    An Algorithm for Optimal Back-Striding in Prolog. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:147-158 [Conf]
  11. Neng-Fa Zhou, Toshihisa Takagi, Kazuo Ushijima
    A Matching Tree Oriented Abstract Machine for Prolog. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:159-173 [Conf]
  12. Andrew Taylor
    LIPS on a MIPS: Results from a Prolog Compiler for a RISC. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:174-185 [Conf]
  13. Pascal Van Hentenryck
    Incremental Constraint Satisfaction in Logic Programming. [Citation Graph (1, 0)][DBLP]
    ICLP, 1990, pp:189-202 [Conf]
  14. Jukka Paakki
    A Logic-Based Modification of Attribute Grammars for Practical Compiler Writing. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:203-217 [Conf]
  15. Kalyan Muthukumar, Manuel V. Hermenegildo
    The DCG, UDG, and MEL Methods for Automatic Compile-time Parallelization of Logic Programs for Independent And-parallelism. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:221-236 [Conf]
  16. Manuel V. Hermenegildo, Francesca Rossi
    Non-Strict Independent And-Parallelism. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:237-252 [Conf]
  17. Manuel V. Hermenegildo, K. J. Greene
    &-Prolog and its Performance: Exploiting Independent And-Parallelism. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:253-268 [Conf]
  18. David M. Meyer, John S. Conery
    Architected Failure Handling for AND-Parallel Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:271-290 [Conf]
  19. Roberto Giacobazzi, Laura Ricci
    Pipeline Optimizations in AND-Parallel Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:291-305 [Conf]
  20. Antonio Brogi
    AND-Parallelism without Shared Variables. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:306-321 [Conf]
  21. Pier Giorgio Bosco, C. Cecchi, Corrado Moiso, M. Porta, G. Sofi
    Logic and Functional Programmin on Distributed Memory Architectures. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:325-339 [Conf]
  22. T. J. Reynolds, Petros Kefalas
    OR-Parallel Prolog and Search Problems in AI Applications. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:340-354 [Conf]
  23. Arthur L. Delcher, Simon Kasif
    Efficient Parallel Term Matching and Anti-Unification. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:355-369 [Conf]
  24. Remo Pareschi, Dale Miller
    Extending Definite Clause Grammars with Scoping Constructs. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:373-389 [Conf]
  25. A. John Power, Leon Sterling
    A Notion of Map between Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:390-404 [Conf]
  26. Hajime Sawamura, Toshiro Minami, Kaoru Yocota, Kyoko Ohashi
    A Logic Programming Approach to Specifying Logics and Constructing Proofs. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:405-424 [Conf]
  27. Laura Giordano, Alberto Martelli
    Generalized Stable Models, Truth Maintenance and Conflict Resolution. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:427-441 [Conf]
  28. François Fages
    A New Fixpoint Semantics for General Logic Programs Compared with the Well-Founded and the Stable Model Semantics. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:441-458 [Conf]
  29. Teodor C. Przymusinski
    Extended Stable Semantics for Normal and Disjunctive Programs. [Citation Graph (2, 0)][DBLP]
    ICLP, 1990, pp:459-477 [Conf]
  30. Luís Monteiro, António Porto
    A Transformational View of Inheritance in Logic Programming. [Citation Graph (1, 0)][DBLP]
    ICLP, 1990, pp:481-494 [Conf]
  31. Jean-Marc Andreoli, Remo Pareschi
    Linear Objects in a Logic Processes with Built-in Inheritance. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:495-510 [Conf]
  32. Joshua S. Hodas, Dale Miller
    Representing Objects in a Logic Programming Langueage with Scoping Constructs. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:511-526 [Conf]
  33. Yeh-Heng Sheng
    HIFUNLOG : Logic Programming with Higher-order Relational Functions. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:529-545 [Conf]
  34. Mantis H. M. Cheng, Maarten H. van Emden, B. E. Richards
    On Warren's Method for Functional Programming in Logic. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:546-560 [Conf]
  35. François Bry
    Intensional Updates: Abduction via Deduction. [Citation Graph (9, 0)][DBLP]
    ICLP, 1990, pp:561-575 [Conf]
  36. Michael Gelfond, Vladimir Lifschitz
    Logic Programs with Classical Negation. [Citation Graph (9, 0)][DBLP]
    ICLP, 1990, pp:579-597 [Conf]
  37. Robert A. Kowalski, Fariba Sadri
    Logic Programs with Exceptions. [Citation Graph (7, 0)][DBLP]
    ICLP, 1990, pp:598-613 [Conf]
  38. Krzysztof R. Apt, Marc Bezem
    Acyclic Programs. [Citation Graph (5, 0)][DBLP]
    ICLP, 1990, pp:617-633 [Conf]
  39. Lutz Plümer
    Termination Proofs for Logic Programs Based on Predicate Inequalities. [Citation Graph (1, 0)][DBLP]
    ICLP, 1990, pp:634-648 [Conf]
  40. Danny De Schreye, Kristof Verschaetse, Maurice Bruynooghe
    A Practical Technique for Detecting Non-terminating Queries for a Restricted Class of Horn Clauses, Using Directed, Weighted Graphs. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:649-663 [Conf]
  41. Kung-Kiu Lau, Steven David Prestwich
    Top-down Synthesis of Recursive Logic Procedures from First-order Logic Specifications. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:667-684 [Conf]
  42. Laurent Fribourg
    Extracting Logic Programs from Proofs that Use Extended Prolog Execution and Induction. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:685-699 [Conf]
  43. Kristof Verschaetse, Danny De Schreye, Maurice Bruynooghe
    Generation and Compilation of Efficient Computation Rules. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:700-714 [Conf]
  44. Dean Jacobs, Anno Langen, William H. Winsborough
    Multiple Specialization of Logic Programs with Run-Time Test. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:717-731 [Conf]
  45. John P. Gallagher, Maurice Bruynooghe
    The Derivation of an Algorithm for Program Specialisation. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:732-746 [Conf]
  46. Anne Mulkers, William H. Winsborough, Maurice Bruynooghe
    Analysis of Shared Data Structures for Compile-Time Garbage. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:747-762 [Conf]
  47. Raymond Reiter
    What Should a Database Know? [Citation Graph (2, 0)][DBLP]
    ICLP, 1990, pp:765- [Conf]
  48. Alain Colmerauer
    Prolog III as it Actually Is. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:766- [Conf]
  49. Moshe Y. Vardi
    Global Optimization Problems for Database Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:767-771 [Conf]
  50. David Harel
    How Hard Is It to Reason about Propositional Programs? [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:772-773 [Conf]
  51. Vijay A. Saraswat
    The Paradigm of Concurrent Constraint Programming. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:777-778 [Conf]
  52. Haim Gaifman
    Semantics of Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:779-782 [Conf]
  53. Catriel Beeri
    Logic Programming and Databases. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:783- [Conf]
  54. Dale Miller
    Higher-Order Logic Programming. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:784- [Conf]
  55. Jacques Chassin de Kergommeaux
    Parallel Logic Programming Systems. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:785- [Conf]
  56. Frank Pfenning
    Types in Logic Programming. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:786- [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002