Conferences in DBLP

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

1. Thomas Eiter, Georg Gottlob
   On the Complexity of Theory Curbing. [Citation Graph (0, 0)][DBLP]
   LPAR, 2000, pp:1-19 [Conf]
   
2. Bruno Courcelle
   Graph Operations and Monadic Second-Order Logic: A Survey. [Citation Graph (0, 0)][DBLP]
   LPAR, 2000, pp:20-24 [Conf]
   
3. Jean-Yves Marion, Jean-Yves Moyen
   Efficient First Order Functional Program Interpreter with Time Bound Certifications. [Citation Graph (0, 0)][DBLP]
   LPAR, 2000, pp:25-42 [Conf]
   
4. Wolfgang Grieskamp, Markus Lepper
   Encoding Temporal Logics in Executable Z: A Case Study for the ZETA System. [Citation Graph (0, 0)][DBLP]
   LPAR, 2000, pp:43-53 [Conf]
   
5. Slawomir Lasota
   Behavioural Constructor Implementation for Regular Algebras. [Citation Graph (0, 0)][DBLP]
   LPAR, 2000, pp:54-69 [Conf]
   
6. Thomas Hallgren, Aarne Ranta
   An Extensible Proof Text Editor. [Citation Graph (0, 0)][DBLP]
   LPAR, 2000, pp:70-84 [Conf]
   
7. David Delahaye
   A Tactic Language for the System Coq. [Citation Graph (0, 0)][DBLP]
   LPAR, 2000, pp:85-95 [Conf]
   
8. Miyuki Koshimura, Ryuzo Hasegawa
   Proof Simplification for Model Generation and Its Applications. [Citation Graph (0, 0)][DBLP]
   LPAR, 2000, pp:96-113 [Conf]
   
9. Christian G. Fermüller, Georg Moser
   Have Spass with OCC1N_g⁼. [Citation Graph (0, 0)][DBLP]
   LPAR, 2000, pp:114-130 [Conf]
   
10. Florent Jacquemard, Michaël Rusinowitch, Laurent Vigneron
    Compiling and Verifying Security Protocols. [Citation Graph (0, 0)][DBLP]
    LPAR, 2000, pp:131-160 [Conf]
    
11. Jan Friso Groote, Jaco van de Pol
    Equational Binary Decision Diagrams. [Citation Graph (0, 0)][DBLP]
    LPAR, 2000, pp:161-178 [Conf]
    
12. Céecile Canovas-Dumas, Paul Caspi
    A PVS Proof Obligation Generator for Lustre Programs. [Citation Graph (0, 0)][DBLP]
    LPAR, 2000, pp:179-188 [Conf]
    
13. Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
    Efficient Structural Information Analysis for Real CLP Languages. [Citation Graph (0, 0)][DBLP]
    LPAR, 2000, pp:189-206 [Conf]
    
14. Jean-Vincent Loddo, Roberto Di Cosmo
    Playing Logic Programs with the Alpha-Beta Algorithm. [Citation Graph (0, 0)][DBLP]
    LPAR, 2000, pp:207-224 [Conf]
    
15. Nikolay Pelov, Emmanuel De Mot, Marc Denecker
    Logic Programming Approaches for Representing and Solving Constraint Satisfaction Problems: A Comparison. [Citation Graph (0, 0)][DBLP]
    LPAR, 2000, pp:225-239 [Conf]
    
16. Matthias Baaz, Agata Ciabattoni, Richard Zach
    Quantified Propositional Gödel Logics. [Citation Graph (0, 0)][DBLP]
    LPAR, 2000, pp:240-256 [Conf]
    
17. Philippe de Groote
    Proof-Search in Implicative Linear Logic as a Matching Problem. [Citation Graph (0, 0)][DBLP]
    LPAR, 2000, pp:257-274 [Conf]
    
18. Dieter Spreen
    A New Model Construction for the Polymorphic Lambda Calculus. [Citation Graph (0, 0)][DBLP]
    LPAR, 2000, pp:275-292 [Conf]
    
19. Richard Statman
    Church's Lambda Delta Calculus. [Citation Graph (0, 0)][DBLP]
    LPAR, 2000, pp:293-307 [Conf]
    
20. Sergio Greco, Ester Zumpano
    Querying Inconsistent Databases. [Citation Graph (0, 0)][DBLP]
    LPAR, 2000, pp:308-325 [Conf]
    
21. Ian Horrocks, Ulrike Sattler, Sergio Tessaris, Stephan Tobies
    How to Decide Query Containment Under Constraints Using a Description Logic. [Citation Graph (0, 0)][DBLP]
    LPAR, 2000, pp:326-343 [Conf]
    
22. Gilles Barthe, Bernard P. Serpette
    Static Reduction Analysis for Imperative Object Oriented Languages. [Citation Graph (0, 0)][DBLP]
    LPAR, 2000, pp:344-361 [Conf]
    
23. Roberta Gori
    An Abstract Interpretation Approach to Termination of Logic Programs. [Citation Graph (0, 0)][DBLP]
    LPAR, 2000, pp:362-380 [Conf]
    
24. Elvira Albert, Michael Hanus, Germán Vidal
    Using an Abstract Representation to Specialize Functional Logic Programs. [Citation Graph (0, 0)][DBLP]
    LPAR, 2000, pp:381-398 [Conf]
    
25. Wim Vanhoof
    Binding-Time Analysis by Constraint Solving. A Modular and Higher-Order Approach for Mercury. [Citation Graph (0, 0)][DBLP]
    LPAR, 2000, pp:399-416 [Conf]
    
26. Erich Grädel
    Efficient Evaluation Methods for Guarded Logics and Datalog LITE. [Citation Graph (0, 0)][DBLP]
    LPAR, 2000, pp:417- [Conf]
    
27. Jean-Marc Talbot
    On the Alternation-Free Horn Mu-calculus. [Citation Graph (0, 0)][DBLP]
    LPAR, 2000, pp:418-435 [Conf]
    
28. Steffen Hölldobler, Dietrich Kuske
    The Boundary between Decidable and Undecidable Fragments of the Fluent Calculus. [Citation Graph (0, 0)][DBLP]
    LPAR, 2000, pp:436-450 [Conf]
    
29. Helko Lehmann, Michael Leuschel
    Solving Planning Problems by Partial Deduction. [Citation Graph (0, 0)][DBLP]
    LPAR, 2000, pp:451-468 [Conf]
    
30. Ján Sefránek
    A Kripkean Semantics for Dynamic Logic Programming. [Citation Graph (0, 0)][DBLP]
    LPAR, 2000, pp:469-486 [Conf]