The SCEAS System
Navigation Menu

Conferences in DBLP

International Conference on Logic Programming (iclp)
1991 (conf/iclp/91)

  1. Phan Minh Dung
    Negations as Hypotheses: An Abductive Foundation for Logic Programming. [Citation Graph (4, 0)][DBLP]
    ICLP, 1991, pp:3-17 [Conf]
  2. Marco A. Casanova, Andrea S. Hemerly, Ramiro A. de T. Guerreiro
    Explaining SLDNF Resolution with Non-Normal Defaults. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:18-31 [Conf]
  3. Alessandra Di Pierro, Maurizio Martelli, Catuscia Palamidessi
    Negation as Instantitation: A New Rule for the Treatment of Negation in Logic Programming. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:32-45 [Conf]
  4. Kalyan Muthukumar, Manuel V. Hermenegildo
    Combined Determination of Sharing and Freeness of Program Variables through Abstract Interpretation. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:49-63 [Conf]
  5. Baudouin Le Charlier, Kaninda Musumbu, Pascal Van Hentenryck
    A Generic Abstract Interpretation Algorithm and its Complexity Analysis. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:64-78 [Conf]
  6. Michael Codish, Dennis Dams, Eyal Yardeni
    Derivation and Safety of an Abstract Unification Algorithm for Groundness and Aliasing Analysis. [Citation Graph (1, 0)][DBLP]
    ICLP, 1991, pp:79-93 [Conf]
  7. Weidong Chen, David Scott Warren
    An Intensional Logic of (Multi-Arity) Set Abstractions. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:97-110 [Conf]
  8. Agostino Dovier, Eugenio G. Omodeo, Enrico Pontelli, Gianfranco Rossi
    {log}: A Logic Programming Language with Finite Sets. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:111-124 [Conf]
  9. Philippe Codognet, Thierry Sola
    Extending the WAM for Intelligent Backtracking. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:127-141 [Conf]
  10. Ludek Matyska, Adriana Jergová, David Toman
    Register Allocation in WAM. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:142-156 [Conf]
  11. Micha Meier
    Recursion versus Iteration in Prolog. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:157-169 [Conf]
  12. Eugene J. Rollins, Jeannette M. Wing
    Specifications as Search Keys for Software Libraries. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:173-187 [Conf]
  13. Jean-François Monin
    Real-size Compiler Writing Using Prolog with Arrows. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:188-201 [Conf]
  14. Bruno Marre
    Toward Automatic Test Data Set Selection Using Algebraic Specifications and Logic Programming. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:202-219 [Conf]
  15. Ugo Montanari, Francesca Rossi
    Perfect Relaxation in Constraint Logic Programming. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:223-237 [Conf]
  16. Maurizio Gabbrielli, Giorgio Levi
    Modeling Answer Constraints in Constraint Logic Programs. [Citation Graph (1, 0)][DBLP]
    ICLP, 1991, pp:238-252 [Conf]
  17. Dale Miller
    Unification of Simply Typed Lamda-Terms as Logic Programming. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:255-269 [Conf]
  18. Masami Hagiya
    Higher-Order Unification as a Theorem Proving Procedure. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:270-284 [Conf]
  19. Anthony S. K. Cheng, Peter J. Robinson, John Staples
    Higher Level Meta Programming in Qu-Prolog 3: 0. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:285-298 [Conf]
  20. Kristof Verschaetse, Danny De Schreye
    Deriving Termination Proofs for Logic Programs, Using Abstract Procedures. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:301-315 [Conf]
  21. Brian J. Ross, Alan Smaill
    An Algebraic Semantics of Prolog Program Termination. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:316-330 [Conf]
  22. Michael Codish, Moreno Falaschi, Kim Marriott
    Suspension Analysis for Concurrent Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:331-345 [Conf]
  23. Yael Moscowitz, Ehud Y. Shapiro
    Lexical Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:349-363 [Conf]
  24. Glenn Mansfield, Atsushi Togashi, Nobuhisa Miake, Shoichi Noguchi
    AMLOG-E: A New Approach towards Amalgamation. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:364-378 [Conf]
  25. Eyal Yardeni, Thom W. Frühwirth, Ehud Y. Shapiro
    Polymorphically Typed Logic Programs. [Citation Graph (2, 0)][DBLP]
    ICLP, 1991, pp:379-393 [Conf]
  26. Daniele Turi
    Extending S-Models to Logic Programs with Negation. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:397-411 [Conf]
  27. Yong Hu, Li-Yan Yuan
    Extended Well-Founded Model Semantics for General Logic Programs. [Citation Graph (2, 0)][DBLP]
    ICLP, 1991, pp:412-425 [Conf]
  28. Doug Palmer, Lee Naish
    NUA-Prolog: An Extension to the WAM for Parallel Andorra. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:429-442 [Conf]
  29. Vítor Santos Costa, David H. D. Warren, Rong Yang
    The Andorra-I Preprocessor: Supporting Full Prolog on the Basic Andorra Model. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:443-456 [Conf]
  30. Mark Korsloot, Evan Tick
    Compilation Techniques for Nondeterminate Flat Concurrent Logic Programming Languages. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:457-471 [Conf]
  31. Luís Moniz Pereira, Joaquim Nunes Aparício, José Júlio Alferes
    Nonmonotonic Reasoning with Well Founded Semantics. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:475-489 [Conf]
  32. Katsumi Inoue
    Extended Logic Programs with Default Assumptions. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:490-504 [Conf]
  33. Ken Satoh, Noboru Iwayama
    Computing Abduction by Using the TMS. [Citation Graph (3, 0)][DBLP]
    ICLP, 1991, pp:505-518 [Conf]
  34. Roland H. C. Yap
    Restriction Site Mapping in CLP(R). [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:521-534 [Conf]
  35. Hiroshi Fujita, Ryuzo Hasegawa
    A Model Generation Theorem Prover in KL1 Using a Ramified -Stack Algorithm. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:535-548 [Conf]
  36. Peter B. Reintjes
    A Set of Tools for VHDL Design. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:549-562 [Conf]
  37. Raymond T. Ng, V. S. Subrahmanian
    A Semantical Framework for Supporting Subjective and Conditional Probabilities in Deductive Databases. [Citation Graph (2, 0)][DBLP]
    ICLP, 1991, pp:565-580 [Conf]
  38. Didier Dubois, Jérôme Lang, Henri Prade
    Towards Possibilistic Logic Programming. [Citation Graph (4, 0)][DBLP]
    ICLP, 1991, pp:581-595 [Conf]
  39. Saumya K. Debray, Nai-Wei Lin
    Automatic Complexity Analysis of Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:599-613 [Conf]
  40. Jonathan M. Lever
    Proving Program Properties by Means of SLS-Resolution. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:614-628 [Conf]
  41. Livio Colussi, Elena Marchiori
    Proving Correctness of Logic Programs Using Axiomatic Semantics. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:629-642 [Conf]
  42. Leo Bachmair, Harald Ganzinger
    Perfect Model Semantics for Logic Programs with Equality. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:645-659 [Conf]
  43. José Alberto Fernández, Jack Minker
    Bottom-Up Evaluation of Hierarchical Disjunctive Deductive Databases. [Citation Graph (2, 0)][DBLP]
    ICLP, 1991, pp:660-675 [Conf]
  44. Hai-Ping Ko, Mark E. Nadel
    Substitution and Refutation Revisited. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:679-692 [Conf]
  45. Hendrik Decker
    On Generalized Cover Axioms. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:693-707 [Conf]
  46. James Harland
    A Clausal Form for the Completion of Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:711-725 [Conf]
  47. Teodor C. Przymusinski
    Well-Founded Completions of Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:726-741 [Conf]
  48. Pascal Van Hentenryck, Yves Deville
    The Cardinality Operator: A New Logical Connective for Constraint Logic Programming. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:745-759 [Conf]
  49. Donald A. Smith
    Constraint Operations for CLP(FT). [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:760-774 [Conf]
  50. Abderrahmane Aggoun, Nicolas Beldiceanu
    Overview of the CHIP Compiler System. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:775-789 [Conf]
  51. Shyam Mudambi
    Performances of Aurora on NUMA Machines. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:793-806 [Conf]
  52. Khayri A. M. Ali, Roland Karlsson
    Scheduling Or-Parallelism in Muse. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:807-821 [Conf]
  53. Vítor Santos Costa, David H. D. Warren, Rong Yang
    The Andorra-I Engine: A Parallel Implementation of the Basic Andorra Model. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:825-839 [Conf]
  54. Arie Harsat, Ran Ginosar
    CARMEL-4: The Unify-Spawn Machine for FCP. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:840-854 [Conf]
  55. Pascal Brisset, Olivier Ridoux
    Naïve Reverse Can be Linear. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:857-870 [Conf]
  56. Bharat Jayaraman, Gopalan Nadathur
    Implementation Techniques for Scoping Constructs in Logic Programming. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:871-886 [Conf]
  57. Stefan Böttcher
    On Transactions in Logic Programming Languages. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:889- [Conf]
  58. Bernard Migault, François Rousselot, Laurent Cervoni
    Prolog as a Host Language. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:890- [Conf]
  59. M. Puchhammer, R. Schlöglhofer
    A Rule-oriented FSM Design System with Prototyping Capabilities. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:891- [Conf]
  60. Toshinori Watanabe, Keiko Komatsu
    Co-operative Hierarchical Layout Problem Solver on Parallel Inference Machine. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:892- [Conf]
  61. Robert A. Ballance, Susan L. Graham
    Incremental Consistency Maintenance for Interactive Applications. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:895-909 [Conf]
  62. Robert A. Kowalski
    Legislation as Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:910- [Conf]
  63. Dale Miller
    Logics for Logic Programming: A Tutorial. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:911- [Conf]
  64. Bernard Robinet
    Logic Programming at IBM: From the Lab to the Customer. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:912-921 [Conf]
  65. R. S. Scowen
    An Overview of Prolog Standardization - Progress, Problems and Solutions. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:922-936 [Conf]
  66. Hassan Aït-Kaci
    Warren's Abstract Machine. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:939- [Conf]
  67. Patrick Cousot
    Abstract Interpretation of Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:940- [Conf]
  68. Yves Deville, Leon Sterling, Pierre Deransart
    Software Development and Logic Programming. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:941- [Conf]
  69. Gérard Ferrand
    Basic Concepts of Logic Programming and Prolog. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:942- [Conf]
  70. Seif Haridi
    Parallel Logic Programming based on the Andorra Principle. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:943- [Conf]
  71. Jean-Jacques Chabrier, Claudine Pradelles, Bruno Legeard
    Applications of Constraints Logic Programming Languages. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:944- [Conf]
  72. Giorgio Levi
    On the Semantics of Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:945- [Conf]
  73. António Porto
    Logic Programming Environments. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:946- [Conf]
  74. Patrick Saint-Dizier
    Logic Programming for Language Processing. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:947- [Conf]
  75. Taisuke Sato
    Full First Order Logic Programming and Truth Predicate. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:948- [Conf]
  76. Kazuo Taki
    Parallel Programming and Large-scale Applications in the FGCS Project. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:949- [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