The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Edmund M. Clarke
    SAT-Based Counterexample Guided Abstraction Refinement in Model Checking. [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:1- [Conf]
  2. José Meseguer, Miguel Palomino, Narciso Martí-Oliet
    Equational Abstractions. [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:2-16 [Conf]
  3. Jürgen Giesl, Deepak Kapur
    Deciding Inductive Validity of Equations. [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:17-31 [Conf]
  4. Nao Hirokawa, Aart Middeldorp
    Automating the Dependency Pair Method. [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:32-46 [Conf]
  5. Konstantin Korovin, Andrei Voronkov
    An AC-Compatible Knuth-Bendix Order. [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:47-59 [Conf]
  6. Carsten Lutz, Ulrike Sattler, Lidia Tendera
    The Complexity of Finite Model Reasoning in Description Logics. [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:60-74 [Conf]
  7. Guoqiang Pan, Moshe Y. Vardi
    Optimizing a BDD-Based Modal Solver. [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:75-89 [Conf]
  8. Jan Hladik, Ulrike Sattler
    A Translation of Looping Alternating Automata into Description Logics. [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:90-105 [Conf]
  9. Karl Crary, Susmit Sarkar
    Foundational Certified Code in a Metalogical Framework. [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:106-120 [Conf]
  10. Farhad Mehta, Tobias Nipkow
    Proving Pointer Programs in Higher-Order Logic. [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:121-135 [Conf]
  11. Dimitri Hendriks, Vincent van Oostrom
    adbmal [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:136-150 [Conf]
  12. Aaron Stump
    Subset Types and Partial Functions. [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:151-165 [Conf]
  13. Greg Nelson
    Reasoning about Quantifiers by Matching in the E-graph. [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:166- [Conf]
  14. Sumit Gulwani, George C. Necula
    A Randomized Satisfability Procedure for Arithmetic and Uninterpreted Function Symbols. [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:167-181 [Conf]
  15. Harald Ganzinger, Thomas Hillenbrand, Uwe Waldmann
    Superposition Modulo a Shostak Theory. [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:182-196 [Conf]
  16. Sava Krstic, Sylvain Conchon
    Canonization for Disjoint Unions of Theories. [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:197-211 [Conf]
  17. Christophe Ringeissen
    Matching in a Class of Combined Non-disjoint Theories. [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:212-227 [Conf]
  18. Johan G. F. Belinfante
    Reasoning about Iteration in Gödel's Class Theory. [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:228-242 [Conf]
  19. Panagiotis Manolios, Daron Vroon
    Algorithms for Ordinal Arithmetic. [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:243-257 [Conf]
  20. Arjeh M. Cohen, Scott H. Murray, Martin Pollet, Volker Sorge
    Certifying Solutions to Permutation Group Problems. [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:258-273 [Conf]
  21. Ullrich Hustadt, Boris Konev
    TRP++2.0: A Temporal Resolution Prover. [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:274-278 [Conf]
  22. Lucas Dixon, Jacques D. Fleuriot
    IsaPlanner: A Prototype Proof Planner in Isabelle. [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:279-283 [Conf]
  23. Peter Baumgartner, Ulrich Furbach, Margret Groß-Hardt, Alex Sinner
    'Living Book': -'Deduction', 'Slicing', 'Interaction'. [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:284-288 [Conf]
  24. Simon Colton, Sophie Huczynska
    The Homer System. [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:289-294 [Conf]
  25. Geoff Sutcliffe, Christian B. Suttner
    The CADE-19 ATP System Competition. [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:295-296 [Conf]
  26. Eric Deplagne, Claude Kirchner, Hélène Kirchner, Quang Huy Nguyen
    Proof Search and Proof Check for Equational and Inductive Theorems. [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:297-316 [Conf]
  27. Jean-Marie Gaillourdet, Thomas Hillenbrand, Bernd Löchner, Hendrik Spies
    The New WALDMEISTER Loop at Work. [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:317-321 [Conf]
  28. Christoph Walther, Stephan Schweitzer
    About VeriFun. [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:322-327 [Conf]
  29. Jürgen Avenhaus, Ulrich Kühler, Tobias Schmidt-Samoa, Claus-Peter Wirth
    How to Prove Inductive Theorems? QUODLIBET! [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:328-333 [Conf]
  30. Anthony G. Cohn
    Reasoning about Qualitative Representations of Space and Time. [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:334- [Conf]
  31. Harald Ganzinger, Jürgen Stuber
    Superposition with Equivalence Reasoning and Delayed Clause Normal Form Transformation. [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:335-349 [Conf]
  32. Peter Baumgartner, Cesare Tinelli
    The Model Evolution Calculus. [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:350-364 [Conf]
  33. Hans de Nivelle
    Translation of Resolution Proofs into Short First-Order Proofs without Choice Axioms. [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:365-379 [Conf]
  34. Alexandre Riazanov, Andrei Voronkov
    Efficient Instance Retrieval with Standard and Relational Path Indexing. [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:380-396 [Conf]
  35. Anatoli Degtyarev, Michael Fisher, Boris Konev
    Monodic Temporal Resolution. [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:397-411 [Conf]
  36. Renate A. Schmidt, Ullrich Hustadt
    A Principle for Incorporating Axioms into the First-Order Translation of Modal Formulae. [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:412-426 [Conf]
  37. Christopher Lynch
    Schematic Saturation for Decision and Unification Problems. [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:427-441 [Conf]
  38. Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch
    Unification Modulo ACU I Plus Homomorphisms/Distributivity. [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:442-457 [Conf]
  39. Venkatesh Choppella, Christopher T. Haynes
    Source-Tracking Unification. [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:458-472 [Conf]
  40. Brigitte Pientka, Frank Pfenning
    Optimizing Higher-Order Pattern Unification. [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:473-487 [Conf]
  41. Manfred Schmidt-Schauß
    Decidability of Arity-Bounded Higher-Order Matching. [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:488-502 [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