The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Neil D. Jones
    Program Termination Analysis by Size-Change Graphs (Abstract). [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:1-4 [Conf]
  2. Lawrence C. Paulson
    SET Cardholder Registration: The Secrecy Proofs. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:5-12 [Conf]
  3. Andrei Voronkov
    Algorithms, Datastructures, and other Issues in Efficient Automated Deduction. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:13-28 [Conf]
  4. Volker Haarslev, Ralf Möller, Michael Wessel
    The Description Logic ALCNHR+ Extended with Concrete Domains: A Practically Motivated Approach. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:29-44 [Conf]
  5. Carsten Lutz
    NEXPTIME-Complete Description Logics with Concrete Domains. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:45-60 [Conf]
  6. Volker Haarslev, Ralf Möller, Anni-Yasmin Turhan
    Exploiting Pseudo Models for TBox and ABox Reasoning in Expressive Description Logics. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:61-75 [Conf]
  7. Ulrike Sattler, Moshe Y. Vardi
    The Hybrid µ-Calculus. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:76-91 [Conf]
  8. Franz Baader, Stephan Tobies
    The Inverse Method Implements the Automata Approach for Modal Satisfiability. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:92-106 [Conf]
  9. Regimantas Pliuskevicius
    Deduction-Based Decision Procedure for a Clausal Miniscoped Fragment of FTL. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:107-120 [Conf]
  10. Carsten Lutz, Holger Sturm, Frank Wolter, Michael Zakharyaschev
    Tableaux for Temporal Description Logic with Constant Domains. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:121-136 [Conf]
  11. Serenella Cerrito, Marta Cialdea Mayer
    Free-Variable Tableaux for Constant-Domain Quantified Modal Logics with Rigid and Non-rigid Designation. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:137-151 [Conf]
  12. Andrea Formisano, Eugenio G. Omodeo, Marco Temperini
    Instructing Equational Set-Reasoning with Otter. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:152-167 [Conf]
  13. Stefan Szeider
    NP-Completeness of Refutability by Literal-Once Resolution. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:168-181 [Conf]
  14. Reiner Hähnle, Neil V. Murray, Erik Rosenthal
    Ordered Resolution vs. Connection Graph Resolution. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:182-194 [Conf]
  15. Jürgen Stuber
    A Model-Based Completeness Proof of Extended Narrowing and Resolution. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:195-210 [Conf]
  16. Hans de Nivelle, Ian Pratt-Hartmann
    A Resolution-Based Decision Procedure for the Two-Variable Fragment with Equality. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:211-225 [Conf]
  17. Uwe Waldmann
    Superposition and Chaining for Totally Ordered Divisible Abelian Groups. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:226-241 [Conf]
  18. Harald Ganzinger, Robert Nieuwenhuis, Pilar Nivela
    Context Trees. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:242-256 [Conf]
  19. Robert Nieuwenhuis, Thomas Hillenbrand, Alexandre Riazanov, Andrei Voronkov
    On the Evaluation of Indexing Techniques for Theorem Proving. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:257-271 [Conf]
  20. Sylvie Doutre, Jérôme Mengin
    Preferred Extensions of Argumentation Frameworks: Query Answering and Computation. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:272-288 [Conf]
  21. Pablo A. Armelín, David J. Pym
    Bunched Logic Programming. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:289-304 [Conf]
  22. Kewen Wang
    A Top-Down Procedure for Disjunctive Well-Founded Semantics. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:305-317 [Conf]
  23. Michael Beeson
    A Second-Order Theorem Prover Applied to Circumscription. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:318-324 [Conf]
  24. Christian Anger, Kathrin Konczak, Thomas Linke
    NoMoRe : A System for Non-monotonic Reasoning with Logic Programs under Answer Set Semantics. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:325-330 [Conf]
  25. Marco Benedetti
    Conditional Pure Literal Graphs. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:331-346 [Conf]
  26. Enrico Giunchiglia, Marco Maratea, Armando Tacchella, Davide Zambonin
    Evaluating Search Heuristics and Optimization Techniques in Propositional Satisfiability. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:347-363 [Conf]
  27. Enrico Giunchiglia, Massimo Narizzano, Armando Tacchella
    QUBE: A System for Deciding Quantified Boolean Formulas Satisfiability. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:364-369 [Conf]
  28. Stephan Schulz
    System Abstract: E 0.61. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:370-375 [Conf]
  29. Alexandre Riazanov, Andrei Voronkov
    Vampire 1.1 (System Description). [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:376-380 [Conf]
  30. Reinhold Letz, Gernot Stenz
    DCTP - A Disconnection Calculus Theorem Prover - System Abstract. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:381-385 [Conf]
  31. Marko Luther
    More On Implicit Syntax. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:386-400 [Conf]
  32. Brigitte Pientka
    Termination and Reduction Checking for Higher-Order Logic Programs. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:401-415 [Conf]
  33. Armin Fiedler
    P.rex: An Interactive Proof Explainer. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:416-420 [Conf]
  34. Stephan Schmitt, Lori Lorigo, Christoph Kreitz, Aleksey Nogin
    JProver : Integrating Connection-Based Theorem Proving into Interactive Proof Assistants. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:421-426 [Conf]
  35. Gilles Audemard, Laurent Henocque
    The eXtended Least Number Heuristic. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:427-442 [Conf]
  36. Kahlil Hodgson, John K. Slaney
    System Description: SCOTT-5. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:443-447 [Conf]
  37. Maria Paola Bonacina
    Combination of Distributed Search and Multi-search in Peers-mcd.d. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:448-452 [Conf]
  38. Luis Fariñas del Cerro, David Fauthoux, Olivier Gasquet, Andreas Herzig, Dominique Longin, Fabio Massacci
    Lotrec : The Generic Tableau Prover for Modal and Description Logics. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:453-458 [Conf]
  39. Jens Happe
    The MODPROF Theorem Prover. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:459-463 [Conf]
  40. Peter F. Patel-Schneider, Roberto Sebastiani
    A New System and Methodology for Generating Random Modal Formulae. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:464-468 [Conf]
  41. Jürgen Giesl, Deepak Kapur
    Decidable Classes of Inductive Theorems. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:469-484 [Conf]
  42. Xavier Urbain
    Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:485-498 [Conf]
  43. Christopher Lynch, Barbara Morawska
    Decidability and Complexity of Finitely Closable Linear Equational Theories. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:499-513 [Conf]
  44. Harald Ganzinger, David A. McAllester
    A New Meta-complexity Theorem for Bottom-Up Logic Programs. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:514-528 [Conf]
  45. Arnon Avron, Iddo Lev
    Canonical Propositional Gentzen-Type Systems. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:529-544 [Conf]
  46. Martin Giese
    Incremental Closure of Free Variable Tableaux. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:545-560 [Conf]
  47. Uwe Egly, Stephan Schmitt
    Deriving Modular Programs from Short Proofs. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:561-577 [Conf]
  48. Nicolas Peltier
    A General Method for Using Schematizations in Automated Deduction. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:578-592 [Conf]
  49. Aart Middeldorp
    Approximating Dependency Graphs Using Tree Automata Techniques. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:593-610 [Conf]
  50. Bernard Boigelot, Sébastien Jodogne, Pierre Wolper
    On the Use of Weak Automata for Deciding Linear Arithmetic with Integer and Real Variables. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:611-625 [Conf]
  51. Bernhard Beckert, Steffen Schlager
    A Sequent Calculus for First-Order Dynamic Logic with Trace Modalities. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:626-641 [Conf]
  52. Wolfgang Reif, Gerhard Schellhorn, Andreas Thums
    Flaw Detection in Formal Specifications. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:642-657 [Conf]
  53. Jürgen Avenhaus, Bernd Löchner
    CCE: Testing Ground Joinability. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:658-662 [Conf]
  54. Alessandro Armando, Luca Compagna, Silvio Ranise
    System Description: RDL : Rewrite and Decision Procedure Laboratory. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:663-669 [Conf]
  55. Joshua S. Hodas, Naoyuki Tamura
    lolliCop - A Linear Logic Implementation of a Lean Connection-Method Theorem Prover for First-Order Classical Logic. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:670-684 [Conf]
  56. Dominique Pastre
    MUSCADET 2.3: A Knowledge-Based Theorem Prover Based on Natural Deduction. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:685-689 [Conf]
  57. Jörg Lücke
    Hilberticus - A Tool Deciding an Elementary Sublanguage of Set Theory. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:690-695 [Conf]
  58. Dominique Larchey-Wendling, Dominique Méry, Didier Galmiche
    STRIP: Structural Sharing for Efficient Proof-Search. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:696-700 [Conf]
  59. Volker Haarslev, Ralf Möller
    RACER System Description. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:701-706 [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