The SCEAS System
Navigation Menu

Conferences in DBLP

International Conference on Automated Deduction (CADE) (cade)
2002 (conf/cade/2002)

  1. Ian Horrocks
    Reasoning with Expressive Description Logics: Theory and Practice. [Citation Graph (0, 0)][DBLP]
    CADE, 2002, pp:1-15 [Conf]
  2. Guoqiang Pan, Ulrike Sattler, Moshe Y. Vardi
    BDD-Based Decision Procedures for K. [Citation Graph (0, 0)][DBLP]
    CADE, 2002, pp:16-30 [Conf]
  3. Andrew Bernard, Peter Lee
    Temporal Logic for Proof-Carrying Code. [Citation Graph (0, 0)][DBLP]
    CADE, 2002, pp:31-46 [Conf]
  4. Robert R. Schneck, George C. Necula
    A Gradual Approach to a More Trustworthy, Yet Scalable, Proof-Carrying Code. [Citation Graph (0, 0)][DBLP]
    CADE, 2002, pp:47-62 [Conf]
  5. Martin Strecker
    Formal Verification of a Java Compiler in Isabelle. [Citation Graph (0, 0)][DBLP]
    CADE, 2002, pp:63-77 [Conf]
  6. Uwe Egly
    Embedding Lax Logic into Intuitionistic Logic. [Citation Graph (0, 0)][DBLP]
    CADE, 2002, pp:78-93 [Conf]
  7. Dominique Larchey-Wendling
    Combining Proof-Search and Counter-Model Construction for Deciding Gödel-Dummett Logic. [Citation Graph (0, 0)][DBLP]
    CADE, 2002, pp:94-110 [Conf]
  8. Didier Galmiche, Daniel Méry
    Connection-Based Proof Search in Propositional BI Logic. [Citation Graph (0, 0)][DBLP]
    CADE, 2002, pp:111-128 [Conf]
  9. Jesper B. Møller
    DDDLIB: A Library for Solving Quantified Difference Inequalities. [Citation Graph (0, 0)][DBLP]
    CADE, 2002, pp:129-133 [Conf]
  10. Joe Hurd
    An LCF-Style Interface between HOL and First-Order Logic. [Citation Graph (0, 0)][DBLP]
    CADE, 2002, pp:134-138 [Conf]
  11. Jürgen Zimmer, Michael Kohlhase
    System Description: The MathWeb Software Bus for Distributed Mathematical Reasoning. [Citation Graph (0, 0)][DBLP]
    CADE, 2002, pp:139-143 [Conf]
  12. Jörg H. Siekmann, Christoph Benzmüller, Vladimir Brezhnev, Lassaad Cheikhrouhou, Armin Fiedler, Andreas Franke, Helmut Horacek, Michael Kohlhase, Andreas Meier, Erica Melis, Markus Moschner, Immanuel Normann, Martin Pollet, Volker Sorge, Carsten Ullrich, Claus-Peter Wirth, Jürgen Zimmer
    Proof Development with OMEGA. [Citation Graph (0, 0)][DBLP]
    CADE, 2002, pp:144-149 [Conf]
  13. Mateja Jamnik, Manfred Kerber, Martin Pollet
    Learn Omega-matic: System Description. [Citation Graph (0, 0)][DBLP]
    CADE, 2002, pp:150-155 [Conf]
  14. Carlos Areces, Juan Heguiabehere
    HyLoRes 1.0: Direct Resolution for Hybrid Logics. [Citation Graph (0, 0)][DBLP]
    CADE, 2002, pp:156-160 [Conf]
  15. Eugene Goldberg
    Testing Satisfiability of CNF Formulas by Computing a Stable Set of Points. [Citation Graph (0, 0)][DBLP]
    CADE, 2002, pp:161-180 [Conf]
  16. Thierry Boy de la Tour
    A Note on Symmetry Heuristics in SEM. [Citation Graph (0, 0)][DBLP]
    CADE, 2002, pp:181-194 [Conf]
  17. Gilles Audemard, Piergiorgio Bertoli, Alessandro Cimatti, Artur Kornilowicz, Roberto Sebastiani
    A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions. [Citation Graph (0, 0)][DBLP]
    CADE, 2002, pp:195-210 [Conf]
  18. Wolfgang Ahrendt
    Deductive Search for Errors in Free Data Type Specifications Using Model Generation. [Citation Graph (0, 0)][DBLP]
    CADE, 2002, pp:211-225 [Conf]
  19. Gilles Audemard, Belaid Benhamou
    Reasoning by Symmetry and Function Ordering in Finite Model Generation. [Citation Graph (0, 0)][DBLP]
    CADE, 2002, pp:226-240 [Conf]
  20. Bernhard Gramlich, Reinhard Pichler
    Algorithmic Aspects of Herbrand Models Represented by Ground Atoms with Ground Equations. [Citation Graph (0, 0)][DBLP]
    CADE, 2002, pp:241-259 [Conf]
  21. Lilia Georgieva, Ullrich Hustadt, Renate A. Schmidt
    A New Clausal Class Decidable by Hyperresolution. [Citation Graph (0, 0)][DBLP]
    CADE, 2002, pp:260-274 [Conf]
  22. Christoph Weidenbach, Uwe Brahm, Thomas Hillenbrand, Enno Keen, Christian Theobald, Dalibor Topic
    S PASS Version 2.0. [Citation Graph (0, 0)][DBLP]
    CADE, 2002, pp:275-279 [Conf]
  23. Stephan Schulz, Geoff Sutcliffe
    System Description: GrAnDe 1.0. [Citation Graph (0, 0)][DBLP]
    CADE, 2002, pp:280-284 [Conf]
  24. Simon Colton
    The HR Program for Theorem Generation. [Citation Graph (0, 0)][DBLP]
    CADE, 2002, pp:285-289 [Conf]
  25. Michael W. Whalen, Johann Schumann, Bernd Fischer
    AutoBayes/CC - Combining Program Synthesis with Automatic Code Certification - System Description. [Citation Graph (0, 0)][DBLP]
    CADE, 2002, pp:290-294 [Conf]
  26. Lintao Zhang, Sharad Malik
    The Quest for Efficient Boolean Satisfiability Solvers. [Citation Graph (0, 0)][DBLP]
    CADE, 2002, pp:295-313 [Conf]
  27. Cristina Borralleras, Salvador Lucas, Albert Rubio
    Recursive Path Orderings Can Be Context-Sensitive. [Citation Graph (0, 0)][DBLP]
    CADE, 2002, pp:314-331 [Conf]
  28. Harald Ganzinger
    Shostak Light. [Citation Graph (0, 0)][DBLP]
    CADE, 2002, pp:332-346 [Conf]
  29. Jonathan Ford, Natarajan Shankar
    Formal Verification of a Combination Decision Procedure. [Citation Graph (0, 0)][DBLP]
    CADE, 2002, pp:347-362 [Conf]
  30. Calogero G. Zarba
    Combining Multisets with Integers. [Citation Graph (0, 0)][DBLP]
    CADE, 2002, pp:363-376 [Conf]
  31. Lawrence C. Paulson
    The Reflection Theorem: A Study in Meta-theoretic Reasoning. [Citation Graph (0, 0)][DBLP]
    CADE, 2002, pp:377-391 [Conf]
  32. Aaron Stump, David L. Dill
    Faster Proof Checking in the Edinburgh Logical Framework. [Citation Graph (0, 0)][DBLP]
    CADE, 2002, pp:392-407 [Conf]
  33. Chad E. Brown
    Solving for Set Variables in Higher-Order Theorem Proving. [Citation Graph (0, 0)][DBLP]
    CADE, 2002, pp:408-422 [Conf]
  34. Orna Kupferman, Ulrike Sattler, Moshe Y. Vardi
    The Complexity of the Graded µ-Calculus. [Citation Graph (0, 0)][DBLP]
    CADE, 2002, pp:423-437 [Conf]
  35. Leonardo Mendonça de Moura, Harald Rueß, Maria Sorea
    Lazy Theorem Proving for Bounded Model Checking over Infinite Domains. [Citation Graph (0, 0)][DBLP]
    CADE, 2002, pp:438-455 [Conf]
  36. Miquel Bofill, Albert Rubio
    Well-Foundedness Is Sufficient for Completeness of Ordered Paramodulation. [Citation Graph (0, 0)][DBLP]
    CADE, 2002, pp:456-470 [Conf]
  37. Christopher Lynch, Barbara Morawska
    Basic Syntactic Mutation. [Citation Graph (0, 0)][DBLP]
    CADE, 2002, pp:471-485 [Conf]
  38. Thomas Hillenbrand, Bernd Löchner
    The Next W ALDMEISTER Loop. [Citation Graph (0, 0)][DBLP]
    CADE, 2002, pp:486-500 [Conf]
  39. Jean-Marc Andreoli
    Focussing Proof-Net Construction as a Middleware Paradigm. [Citation Graph (0, 0)][DBLP]
    CADE, 2002, pp:501-516 [Conf]
  40. Matthias Baaz
    Proof Analysis by Resolution. [Citation Graph (0, 0)][DBLP]
    CADE, 2002, pp:517-532 [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