The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Franz Baader, Jan Hladik, Carsten Lutz, Frank Wolter
    From Tableaux to Automata for Description Logics. [Citation Graph (0, 0)][DBLP]
    LPAR, 2003, pp:1-32 [Conf]
  2. Serge Autexier, Carsten Schürmann
    Disproving False Conjectures. [Citation Graph (0, 0)][DBLP]
    LPAR, 2003, pp:33-48 [Conf]
  3. Francisco-Jesús Martín-Mateos, José-Antonio Alonso, María-José Hidalgo, José-Luis Ruiz-Reina
    A Formal Proof of Dickson's Lemma in ACL2. [Citation Graph (0, 0)][DBLP]
    LPAR, 2003, pp:49-58 [Conf]
  4. Alberto Ciaffaglione, Luigi Liquori, Marino Miculan
    Imperative Object-Based Calculi in Co-inductive Type Theories. [Citation Graph (0, 0)][DBLP]
    LPAR, 2003, pp:59-77 [Conf]
  5. Robert Nieuwenhuis, Albert Oliveras
    Congruence Closure with Integer Offsets. [Citation Graph (0, 0)][DBLP]
    LPAR, 2003, pp:78-90 [Conf]
  6. Christoph Walther, Stephan Schweitzer
    A Machine-Verified Code Generator. [Citation Graph (0, 0)][DBLP]
    LPAR, 2003, pp:91-106 [Conf]
  7. Matthias Baaz, Christian G. Fermüller
    A Translation Characterizing the Constructive Content of Classical Theories. [Citation Graph (0, 0)][DBLP]
    LPAR, 2003, pp:107-121 [Conf]
  8. Sebastian Brandt, Anni-Yasmin Turhan, Ralf Küsters
    Extensions of Non-standard Inferences to Descriptions Logics with Transitive Roles. [Citation Graph (0, 0)][DBLP]
    LPAR, 2003, pp:122-136 [Conf]
  9. Bernhard Heinemann
    Extended Canonicity of Certain Topological Properties of Set Spaces. [Citation Graph (0, 0)][DBLP]
    LPAR, 2003, pp:137-151 [Conf]
  10. Silvio Ghilardi, Luigi Santocanale
    Algebraic and Model Theoretic Techniques for Fusion Decidability in Modal Logics. [Citation Graph (0, 0)][DBLP]
    LPAR, 2003, pp:152-166 [Conf]
  11. Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke
    Improving Dependency Pairs. [Citation Graph (0, 0)][DBLP]
    LPAR, 2003, pp:167-182 [Conf]
  12. Kumar Neeraj Verma
    On Closure under Complementation of Equational Tree Automata for Theories Extending AC. [Citation Graph (0, 0)][DBLP]
    LPAR, 2003, pp:183-197 [Conf]
  13. Barbara Morawska
    Completeness of E-Unification with Eager Variable Elimination. [Citation Graph (0, 0)][DBLP]
    LPAR, 2003, pp:198-212 [Conf]
  14. Serikzhan Badaev
    Computable Numberings. [Citation Graph (0, 0)][DBLP]
    LPAR, 2003, pp:213- [Conf]
  15. Boris Konev, Anatoli Degtyarev, Michael Fisher
    Handling Equality in Monodic Temporal Resolution. [Citation Graph (0, 0)][DBLP]
    LPAR, 2003, pp:214-228 [Conf]
  16. Dietmar Berwanger, Erich Grädel, Stephan Kreutzer
    Once upon a Time in a West - Determinacy, Definability, and Complexity of Path Games. [Citation Graph (0, 0)][DBLP]
    LPAR, 2003, pp:229-243 [Conf]
  17. Davy Van Nieuwenborgh, Dirk Vermeir
    Ordered Diagnosis. [Citation Graph (0, 0)][DBLP]
    LPAR, 2003, pp:244-258 [Conf]
  18. Toshiko Wakaki, Katsumi Inoue, Chiaki Sakama, Katsumi Nitta
    Computing Preferred Answer Sets in Answer Set Programming. [Citation Graph (0, 0)][DBLP]
    LPAR, 2003, pp:259-273 [Conf]
  19. Quoc Bao Vo, Abhaya C. Nayak, Norman Y. Foo
    A Syntax-Based Approach to Reasoning about Actions and Events. [Citation Graph (0, 0)][DBLP]
    LPAR, 2003, pp:274-288 [Conf]
  20. Thomas Wilke
    Minimizing Automata on Infinite Words. [Citation Graph (0, 0)][DBLP]
    LPAR, 2003, pp:289- [Conf]
  21. Margarita V. Korovina
    Gandy's Theorem for Abstract Structures without the Equality Test. [Citation Graph (0, 0)][DBLP]
    LPAR, 2003, pp:290-301 [Conf]
  22. Martin Fränzle, Christian Herde
    Efficient SAT Engines for Concise Logics: Accelerating Proof Search for Zero-One Linear Constraint Systems. [Citation Graph (0, 0)][DBLP]
    LPAR, 2003, pp:302-316 [Conf]
  23. Thierry Boy de la Tour, Mnacho Echenim
    NP-Completeness Results for Deductive Problems on Stratified Terms. [Citation Graph (0, 0)][DBLP]
    LPAR, 2003, pp:317-331 [Conf]
  24. Dietrich Kuske
    Is Cantor's Theorem Automatic? [Citation Graph (0, 0)][DBLP]
    LPAR, 2003, pp:332-345 [Conf]
  25. Markus Lohrey
    Automatic Structures of Bounded Degree. [Citation Graph (0, 0)][DBLP]
    LPAR, 2003, pp:346-360 [Conf]
  26. Jean-Michel Couvreur, Nasser Saheb, Grégoire Sutre
    An Optimal Automata Approach to LTL Model Checking of Probabilistic Systems. [Citation Graph (0, 0)][DBLP]
    LPAR, 2003, pp:361-375 [Conf]
  27. Christoph Beierle, Gabriele Kern-Isberner
    A Logical Study on Qualitative Default Reasoning with Probabilities. [Citation Graph (0, 0)][DBLP]
    LPAR, 2003, pp:376-388 [Conf]
  28. Paola Bruscoli, Alessio Guglielmi
    On Structuring Proof Search for First Order Linear Logic. [Citation Graph (0, 0)][DBLP]
    LPAR, 2003, pp:389-406 [Conf]
  29. Furio Honsell, Marina Lenisa, Rekha Redamalla
    Strict Geometry of Interaction Graph Models. [Citation Graph (0, 0)][DBLP]
    LPAR, 2003, pp:407-421 [Conf]
  30. Didier Galmiche, J.-M. Notin
    Connection-Based Proof Construction in Non-commutative Logic. [Citation Graph (0, 0)][DBLP]
    LPAR, 2003, pp:422-436 [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