Conferences in DBLP

Symposium on Logic Programming (SLP / ILPS / NACLP) (slp)
1991 (conf/slp/91)

1. Yosee Feldman, Ehud Y. Shapiro
   Temporal Debugging and its Visual Animation. [Citation Graph (0, 0)][DBLP]
   ISLP, 1991, pp:3-17 [Conf]
   
2. Mireille Ducassé
   Abstract Views of Prolog Executions in Opium. [Citation Graph (0, 0)][DBLP]
   ISLP, 1991, pp:18-32 [Conf]
   
3. Taisuke Sato, Fumio Motoyoshi
   A Complete Top-Down Interpreter for First Order Programs. [Citation Graph (0, 0)][DBLP]
   ISLP, 1991, pp:35-53 [Conf]
   
4. David W. Reed, Donald W. Loveland, Bruce T. Smith
   An Alternative Characterization of Disjunctive Logic Programs. [Citation Graph (0, 0)][DBLP]
   ISLP, 1991, pp:54-68 [Conf]
   
5. Melvin Fitting
   Well-Founded Semantics, Generalized. [Citation Graph (1, 0)][DBLP]
   ISLP, 1991, pp:71-84 [Conf]
   
6. Antonis C. Kakas, Paolo Mancarella
   Stable Theories for Logic Programs. [Citation Graph (0, 0)][DBLP]
   ISLP, 1991, pp:85-100 [Conf]
   
7. Laurent Fribourg
   Automatic Generation of Simplification Lemmas for Inductive Proofs. [Citation Graph (0, 0)][DBLP]
   ISLP, 1991, pp:103-116 [Conf]
   
8. Maurice Bruynooghe, Danny De Schreye, Bern Martens
   A General Criterion for Avoiding Infinite Unfolding During Partial Deduction of Logic Programs. [Citation Graph (0, 0)][DBLP]
   ISLP, 1991, pp:117-131 [Conf]
   
9. Kish Shen, Manuel V. Hermenegildo
   A Simulation Study of Or- and and Independent And-parallelism. [Citation Graph (0, 0)][DBLP]
   ISLP, 1991, pp:135-151 [Conf]
   
10. Gopal Gupta, Vítor Santos Costa, Rong Yang, Manuel V. Hermenegildo
    IDIOM: Integrating Dependent And-, Independent And-, and Or-parallelism. [Citation Graph (0, 0)][DBLP]
    ISLP, 1991, pp:152-166 [Conf]
    
11. Sverker Janson, Seif Haridi
    Programming Paradigms of the Andorra Kernel Language. [Citation Graph (0, 0)][DBLP]
    ISLP, 1991, pp:167-183 [Conf]
    
12. Bob Carpenter
    Typed Feature Structures: A Generalization of First-Order Terms. [Citation Graph (0, 0)][DBLP]
    ISLP, 1991, pp:187-201 [Conf]
    
13. T. L. Lakshman, Uday S. Reddy
    Typed Prolog: A Semantic Reconstruction of the Mycroft-O'Keefe Type System. [Citation Graph (0, 0)][DBLP]
    ISLP, 1991, pp:202-217 [Conf]
    
14. Ron van der Meyden
    A Clausal Logic for Deontic Action Specification. [Citation Graph (0, 0)][DBLP]
    ISLP, 1991, pp:221-238 [Conf]
    
15. Laura Giordano, Alberto Martelli
    A Modal Reconstruction of Blocks and Modules in Logic Programming. [Citation Graph (0, 0)][DBLP]
    ISLP, 1991, pp:239-253 [Conf]
    
16. André Mariën, Bart Demoen
    A New Scheme for Unification in WAM. [Citation Graph (0, 0)][DBLP]
    ISLP, 1991, pp:257-271 [Conf]
    
17. Christoph Beierle, Gregor Meyer, Heiner Semle
    Extending the Warren Abstract Machine to Polymorphic Order-Sorted Resolution. [Citation Graph (0, 0)][DBLP]
    ISLP, 1991, pp:272-286 [Conf]
    
18. William W. Wadge
    Higher-Order Horn Logic Programming. [Citation Graph (0, 0)][DBLP]
    ISLP, 1991, pp:289-303 [Conf]
    
19. James Harland, David J. Pym
    The Uniform Proof-Theoretic Foundation of Linear Logic Programming. [Citation Graph (0, 0)][DBLP]
    ISLP, 1991, pp:304-318 [Conf]
    
20. Raghu Ramakrishnan, S. Sudarshan
    Top-Down versus Bottom-Up Revisited. [Citation Graph (5, 0)][DBLP]
    ISLP, 1991, pp:321-336 [Conf]
    
21. David B. Kemp, Divesh Srivastava, Peter J. Stuckey
    Magic Sets and Bottom-Up Evaluation of Well-Founded Models. [Citation Graph (4, 0)][DBLP]
    ISLP, 1991, pp:337-351 [Conf]
    
22. Péter Szeredi
    Using Dynamic Predicates in an Or--Parallel Prolog System. [Citation Graph (0, 0)][DBLP]
    ISLP, 1991, pp:355-371 [Conf]
    
23. Scott Dietzen, Frank Pfenning
    A Declarative Alternative to "Assert" in Logic Programming. [Citation Graph (0, 0)][DBLP]
    ISLP, 1991, pp:372-386 [Conf]
    
24. David B. Kemp, Peter J. Stuckey
    Semantics of Logic Programs with Aggregates. [Citation Graph (4, 0)][DBLP]
    ISLP, 1991, pp:387-401 [Conf]
    
25. Bruno De Backer, Henri Beringer
    Intelligent Backtracking for CLP Languages: An Application to CLP(R). [Citation Graph (0, 0)][DBLP]
    ISLP, 1991, pp:405-419 [Conf]
    
26. Niels Jørgensen, Kim Marriott, Spiro Michaylov
    Some Global Compile-Time Optimizations for CLP(R). [Citation Graph (0, 0)][DBLP]
    ISLP, 1991, pp:420-434 [Conf]
    
27. Yves Caseau
    Abstract Interpretation of Constraints on Order-Sorted Domains. [Citation Graph (0, 0)][DBLP]
    ISLP, 1991, pp:435-452 [Conf]
    
28. Ian T. Foster, William H. Winsborough
    Copy Avoidance through Compile-Time Analysis and Local Reuse. [Citation Graph (0, 0)][DBLP]
    ISLP, 1991, pp:455-469 [Conf]
    
29. Yasuo Hidaka, Hanpei Koike, Jun'ichi Tatemura, Hidehiko Tanaka
    A Static Load Partitioning Method based on Execution Profile for Committed Choice Languages. [Citation Graph (0, 0)][DBLP]
    ISLP, 1991, pp:470-484 [Conf]
    
30. Håkan Millroth
    Reforming Compilation of Logic Programs. [Citation Graph (0, 0)][DBLP]
    ISLP, 1991, pp:485-499 [Conf]
    
31. Lutz Plümer
    Automatic Termination Proofs for Prolog Programs Operating on Nonground Terms. [Citation Graph (0, 0)][DBLP]
    ISLP, 1991, pp:503-517 [Conf]
    
32. Yehoshua Sagiv
    A Termination Test for Logic Programs. [Citation Graph (0, 0)][DBLP]
    ISLP, 1991, pp:518-532 [Conf]
    
33. Pierre Deransart, Gérard Ferrand, Michel Téguia
    NSTO Programs (Not Subject to Occur-Check). [Citation Graph (0, 0)][DBLP]
    ISLP, 1991, pp:533-547 [Conf]
    
34. Raymond T. Ng, V. S. Subrahmanian
    Relating Dempster-Shafer Theory to Stable Semantics. [Citation Graph (1, 0)][DBLP]
    ISLP, 1991, pp:551-565 [Conf]
    
35. Luís Moniz Pereira, Joaquim Nunes Aparício, José Júlio Alferes
    Counterfactual Reasoning Based on Revising Assumptions. [Citation Graph (0, 0)][DBLP]
    ISLP, 1991, pp:566-577 [Conf]
    
36. Thomas Filkorn, Richard Schmid, Erik Tidén, Peter Warkentin
    Experiences from a Large Industrial Circuit Design Application. [Citation Graph (0, 0)][DBLP]
    ISLP, 1991, pp:581-595 [Conf]
    
37. Paul A. Strooper, Daniel Hoffman
    Prolog Testing of C Modules. [Citation Graph (0, 0)][DBLP]
    ISLP, 1991, pp:596-608 [Conf]
    
38. Tadashi Kawamura
    Derivation of Efficient Logic Programs by Synthesizing New Predicates. [Citation Graph (0, 0)][DBLP]
    ISLP, 1991, pp:611-625 [Conf]
    
39. Hideaki Nakayama
    Program Transformation under the Principle of Proof as Program. [Citation Graph (0, 0)][DBLP]
    ISLP, 1991, pp:626-640 [Conf]
    
40. Kung-Kiu Lau, Steven David Prestwich
    Synthesis of a Family of Recursive Sorting Procedures. [Citation Graph (0, 0)][DBLP]
    ISLP, 1991, pp:641-658 [Conf]
    
41. Christoph Brzoska
    Temporal Logic Programming and its Relation to Constraint Logic Programming. [Citation Graph (0, 0)][DBLP]
    ISLP, 1991, pp:661-677 [Conf]
    
42. Igor Mozetic, Christian Holzbaur
    Integrating Numerical and Qualitative Models within Constraint Logic Programming. [Citation Graph (0, 0)][DBLP]
    ISLP, 1991, pp:678-693 [Conf]
    
43. Ugo Montanari, Francesca Rossi
    True Concurrency in Concurrent Constraint Programming. [Citation Graph (0, 0)][DBLP]
    ISLP, 1991, pp:694-713 [Conf]
    
44. Johan van Benthem
    Reasoning and Programming: Analogies between Logic and Computation. [Citation Graph (0, 0)][DBLP]
    ISLP, 1991, pp:717-718 [Conf]
    
45. Koichi Furukawa
    Fifth Generation Computer Project: Towards Large-Scale Knowledge Information Processing. [Citation Graph (0, 0)][DBLP]
    ISLP, 1991, pp:719-731 [Conf]
    
46. Teodor C. Przymusinski
    Non-Monotonic Reasoning and Logic Programming. [Citation Graph (0, 0)][DBLP]
    ISLP, 1991, pp:735-736 [Conf]
    
47. Ian T. Foster, Carl Kesselman, Stephen Taylor
    Using Compositional Programming to Write Portable, High-Performance Parallel Programs. [Citation Graph (0, 0)][DBLP]
    ISLP, 1991, pp:737-738 [Conf]