The SCEAS System
Navigation Menu

Conferences in DBLP

Russian Conference on Logic Programming / (lpar)
1992 (conf/lpar/1992)

  1. Halina Przymusinska, Teodor C. Przymusinski, Hirohisa Seki
    Soundness and Completeness of Partial Deductions for Well-Founded Semantics. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:1-12 [Conf]
  2. Steffen Hölldobler
    On Deductive Planning and the Frame Problem. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:13-29 [Conf]
  3. James Harland, David J. Pym
    On Resolution in Fragments of Classical Linear Logic. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:30-41 [Conf]
  4. Didier Galmiche, Guy Perrier
    A Procedure for Automatic Proof Nets Construction. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:42-53 [Conf]
  5. James Bowen, Dennis Bahler
    Free Logic and Infinite Constraint Networks. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:54-65 [Conf]
  6. Beat Wüthrich
    Towards Probabilistic Knowledge Bases. [Citation Graph (1, 0)][DBLP]
    LPAR, 1992, pp:66-77 [Conf]
  7. Barrett R. Bryant, Aiqin Pan
    Two-Level Grammar: A Funtional/Logic Query Language for Database and Knowledge-Base Systems. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:78-83 [Conf]
  8. Burkhard Freitag
    Extending Deductive Database Languages by Embedded Implications. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:84-95 [Conf]
  9. Ewing L. Lusk
    Controlling Redundancy in Large Search Spaces: Argonne-Style Theorem Proving Through the Years. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:96-106 [Conf]
  10. Matthias Baaz, Christian G. Fermüller
    Resolution for Many-Valued Logics. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:107-118 [Conf]
  11. Peter Baumgartner
    An Order Theory Resolution Calculus. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:119-130 [Conf]
  12. William McCune, Larry Wos
    Application of Automated Deduction to the Search for Single Axioms for Exponent Groups. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:131-136 [Conf]
  13. Hai-Ping Ko, Mark E. Nadel
    Elementary Lower Bounds for th Length of Refutations. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:137-147 [Conf]
  14. Uwe Egly
    Shortening Proofs by Quantifier Introduction. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:148-159 [Conf]
  15. Håkan Millroth
    Reform Compilation for Nonlinear Recursion. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:160-171 [Conf]
  16. Ulrich Neumerkel
    Pruning Infinite Failure Branches in Programs with Occur-Check. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:172-177 [Conf]
  17. Andrew Ireland
    The Use of Planning Critics in Mechanizing Inductive Proofs. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:178-189 [Conf]
  18. Michel Parigot
    Lambda-My-Calculus: An Algorithmic Interpretation of Classical Natural Deduction. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:190-201 [Conf]
  19. Thierry Boy de la Tour, Christoph Kreitz
    Building Proofs by Analogy via the Curry-Horward Isomorphism. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:202-213 [Conf]
  20. Siani Baker, Andrew Ireland, Alan Smaill
    On the Use of the Constructive Omega-Rule within Automated Deduction. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:214-225 [Conf]
  21. Wolfgang Ertel
    OR-Parallel Theorem Proving with Random Competition. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:226-237 [Conf]
  22. Christian B. Suttner
    Parallel Computation of Multiple Sets-of_Support. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:238-249 [Conf]
  23. Bogumil Hausman
    Towards Using the Andorra Kernel Language for Industrial Real-Time Applications. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:250-260 [Conf]
  24. Christophe Ringeissen
    Unification in a Combination of Equational Theories with Shared Constants and its Application to Primal Algebras. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:261-272 [Conf]
  25. Leo Bachmair, Harald Ganzinger
    Non-Clausal Resolution and Superposition with Selection and Redundancy Criteria. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:273-284 [Conf]
  26. Bernhard Gramlich
    Relating Innermost, Weak, Uniform and Modular Termination of Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:285-296 [Conf]
  27. Valentin M. Antimirov, Anatoli Degtyarev
    Consistency of Equational Enrichments. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:293-402 [Conf]
  28. Maurizio Gabbrielli, Giorgio Levi, Daniele Turi
    A Two Steps Semantics for Logic Programs with Negation. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:297-308 [Conf]
  29. Chitta Baral
    Generalized Negation As Failure and Semantics of Normal Disjunctive Logic Programs. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:309-319 [Conf]
  30. Mino Bai, Howard A. Blair
    General Model Theoretic Semantics for Higher-Order Horn Logic Programming. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:320-331 [Conf]
  31. José Alberto Fernández, Jack Minker
    Disjunctive Deductive Databases. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:332-356 [Conf]
  32. Alexander V. Voinov
    Netlog - A Concept Oriented Logic Programming Language. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:357-368 [Conf]
  33. Michael Fisher, Richard Owens
    From the Past to the Future: Executing Temporal Logic Programs. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:369-380 [Conf]
  34. Christoph Walther
    Computing Induction Axioms. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:381-392 [Conf]
  35. Paul Curzon
    A Programming Logic for a Verified Structured Assembly Language. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:403-408 [Conf]
  36. Gernot Salzer
    The Unification of Infinite Sets of Terms and Its Applications. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:409-420 [Conf]
  37. Michael Kohlhase
    Unification in Order-Sorted Type Theory. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:421-432 [Conf]
  38. Andrea Sattler-Klein
    Infinite, Canonical String Rewriting Systems Generated by Completion. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:433-444 [Conf]
  39. Francis Alexandre, Khaled Bsaïes, Jean-Pierre Finance, Alain Quéré
    Spes: A System for Logic Program Transformation. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:445-447 [Conf]
  40. Jean-Marc Andreoli, Remo Pareschi
    Linear Objects: a Logic Framework for Open System Programming. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:448-450 [Conf]
  41. Bernhard Bauer, Rolf Hennicker
    ISAR: An Interactive System for Algebraic Implementation Proofs. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:451-453 [Conf]
  42. Michael Beeson
    Mathpert: Computer Support for Learning Algebra, Trig, and Calculus. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:454-456 [Conf]
  43. Jorge B. Bocca, Michael Dahmen, Michael Freeston
    MegaLog - A Platform for Developing Knowledge Base Management Systems. [Citation Graph (1, 0)][DBLP]
    LPAR, 1992, pp:457-459 [Conf]
  44. Adel Bouhoula, Emmanuel Kounalis, Michaël Rusinowitch
    SPIKE, an Automatic Theorem Prover. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:460-462 [Conf]
  45. Li Dafa
    An Application to Teaching in Logic Course of ATP Based Natural Deduction. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:463-465 [Conf]
  46. Mark Dawson
    A Generic Logic Environment. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:466-468 [Conf]
  47. Michel Dorochevsky, Liang-Liang Li, Mike Reeve, Kees Schuerman, André Véron
    ElipSys - A Parallel Programming System based on Logic. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:469-471 [Conf]
  48. Mireille Ducassé
    Opium - A High-level Debugging Environment. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:472-474 [Conf]
  49. Ulrich Fraus, Heinrich Hußmann
    An Inductive Theorem Prover Based on Narrowing. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:475-477 [Conf]
  50. Terry Gaasterland, Parke Godfrey, Jack Minker, Lev Novik
    A Cooperative Answering System. [Citation Graph (1, 0)][DBLP]
    LPAR, 1992, pp:478-480 [Conf]
  51. Javier Leach, Susana Nieva
    MIZ-PR: A Theorem Prover for Polymorphic and Recursive Functions. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:481-483 [Conf]
  52. Pascal Manoury, Michel Parigot, Marianna Simonot
    ProPre A Programming Language with Proofs. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:484-486 [Conf]
  53. Julio García Marrtín, Juan José Moreno-Navarro
    FRIENDLY-WAM: An Interactive Tool to Understand the Compilation of PROLOG. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:487-489 [Conf]
  54. Micha Meier
    SEPIA - a Bases for Prolog Extensions. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:490-492 [Conf]
  55. Hans Nilsson
    The External Database in SICStus Prolog. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:493-495 [Conf]
  56. Jacques Noyé
    The KCM System: Speeding-up Logic Programming through Hardware Support. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:496-498 [Conf]
  57. Igor Romanenko
    Logican's Workbench. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:499-500 [Conf]
  58. Hajime Sawamura, Toshiro Minami, Kyoko Ohashi
    EUODHILOS: A General Reasoning System for a Variety of Logics. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:501-503 [Conf]
  59. Laurent Vieille, Petra Bayer, Volker Küchenhoff, Alexandre Lefebvre, Rainer Manthey
    The EKS-V1 System. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:504-506 [Conf]
  60. Mark Wallace, Thierry Le Provost
    CHIP and Propia. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:507-509 [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