The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Bruno Buchberger
    Mathematical Theory Exploration. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:1-2 [Conf]
  2. Adnan Darwiche
    Searching While Keeping a Trace: The Evolution from Satisfiability to Knowledge Compilation. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:3- [Conf]
  3. Dale Miller
    Representing and Reasoning with Operational Semantics. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:4-20 [Conf]
  4. Tobias Nipkow, Gertrud Bauer, Paula Schultz
    Flyspeck I: Tame Graphs. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:21-35 [Conf]
  5. Volker Sorge, Andreas Meier, Roy L. McCasland, Simon Colton
    Automatic Construction and Verification of Isotopy Invariants. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:36-51 [Conf]
  6. Sylvie Boldo
    Pitfalls of a Full Floating-Point Proof: Example on the Formal Proof of the Veltkamp/Dekker Algorithms. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:52-66 [Conf]
  7. Geoff Sutcliffe, Stephan Schulz, Koen Claessen, Allen Van Gelder
    Using the TPTP Language for Writing Derivations and Finite Interpretations. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:67-81 [Conf]
  8. Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret
    Stratified Context Unification Is NP-Complete. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:82-96 [Conf]
  9. Kaustuv Chaudhuri, Frank Pfenning, Greg Price
    A Logical Characterization of Forward and Backward Chaining in the Inverse Method. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:97-111 [Conf]
  10. Andrey Paskevich
    Connection Tableaux with Lazy Paramodulation. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:112-124 [Conf]
  11. Peter Baumgartner, Renate A. Schmidt
    Blocking and Other Enhancements for Bottom-Up Model Generation Methods. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:125-139 [Conf]
  12. Jürgen Zimmer, Serge Autexier
    The MathServe System for Semantic Web Reasoning Services. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:140-144 [Conf]
  13. Predrag Janicic, Pedro Quaresma
    System Description: GCLCprover + GeoThms. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:145-150 [Conf]
  14. Joe Hendrix, José Meseguer, Hitoshi Ohsaki
    A Sufficient Completeness Checker for Linear Order-Sorted Specifications Modulo Axioms. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:151-155 [Conf]
  15. Allen Van Gelder, Geoff Sutcliffe
    Extending the TPTP Language to Higher-Order Logic with Automated Parser Generation. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:156-161 [Conf]
  16. Robert L. Constable, Wojciech Moczydlowski
    Extracting Programs from Constructive HOL Proofs Via IZF Set-Theoretic Semantics. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:162-176 [Conf]
  17. John Harrison
    Towards Self-verification of HOL Light. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:177-191 [Conf]
  18. Sean McLaughlin
    An Interpretation of Isabelle/HOL in HOL Light. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:192-204 [Conf]
  19. Chad E. Brown
    Combining Type Theory and Untyped Set Theory. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:205-219 [Conf]
  20. Christoph Benzmüller, Chad E. Brown, Michael Kohlhase
    Cut-Simulation in Impredicative Logics. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:220-234 [Conf]
  21. Viorica Sofronie-Stokkermans
    Interpolation in Local Theory Extensions. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:235-250 [Conf]
  22. Anna Zamansky, Arnon Avron
    Canonical Gentzen-Type Calculi with (n, k)-ary Quantifiers. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:251-265 [Conf]
  23. Bernhard Beckert, André Platzer
    Dynamic Logic with Non-rigid Functions. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:266-280 [Conf]
  24. Jürgen Giesl, Peter Schneider-Kamp, René Thiemann
    Automatic Termination Proofs in the Dependency Pair Framework. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:281-286 [Conf]
  25. Franz Baader, Carsten Lutz, Boontawee Suntisrivaraporn
    CEL - A Polynomial-Time Reasoner for Life Science Ontologies. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:287-291 [Conf]
  26. Dmitry Tsarkov, Ian Horrocks
    Description Logic Reasoner: System Description. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:292-297 [Conf]
  27. Steven Obua, Sebastian Skalberg
    Importing HOL into Isabelle/HOL. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:298-302 [Conf]
  28. Hans de Nivelle, Jia Meng
    Geometric Resolution: A Proof Procedure Based on Finite Model Search. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:303-317 [Conf]
  29. Xiangxue Jia, Jian Zhang
    A Powerful Technique to Eliminate Isomorphism in Finite Model Search. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:318-331 [Conf]
  30. Adam Koprowski, Hans Zantema
    Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:332-346 [Conf]
  31. Roy Dyckhoff, Delia Kesner, Stephane Lengrand
    Strong Cut-Elimination Systems for Hudelmaier's Depth-Bounded Sequent Calculus for Implicational Logic. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:347-361 [Conf]
  32. Brigitte Pientka
    Eliminating Redundancy in Higher-Order Unification: A Lightweight Approach. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:362-376 [Conf]
  33. Florian Rabe
    First-Order Logic with Dependent Types. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:377-391 [Conf]
  34. Dexter Kozen, Christoph Kreitz, Eva Richter
    Automating Proofs in Category Theory. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:392-407 [Conf]
  35. Roland Zumkeller
    Formal Global Optimisation with Taylor Models. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:408-422 [Conf]
  36. Benjamin Grégoire, Laurent Théry
    A Purely Functional Library for Modular Arithmetic and Its Application to Certifying Large Prime Numbers. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:423-437 [Conf]
  37. Assia Mahboubi
    Proving Formally the Implementation of an Efficient gcd Algorithm for Polynomials. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:438-452 [Conf]
  38. Erik Reeber, Warren A. Hunt Jr.
    A SAT-Based Decision Procedure for the Subclass of Unrollable List Formulas in ACL2 (SULFA). [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:453-467 [Conf]
  39. Shuvendu K. Lahiri, Madanlal Musuvathi
    Solving Sparse Linear Constraints. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:468-482 [Conf]
  40. Olga Grinchtein, Martin Leucker, Nir Piterman
    Inferring Network Invariants Automatically. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:483-497 [Conf]
  41. Christian Urban, Stefan Berghofer
    A Recursion Combinator for Nominal Datatypes Implemented in Isabelle/HOL. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:498-512 [Conf]
  42. Maria Paola Bonacina, Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, Daniele Zucchelli
    Decidability and Undecidability Results for Nelson-Oppen and Rewrite-Based Decision Procedures. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:513-527 [Conf]
  43. Amine Chaieb
    Verifying Mixed Real-Integer Quantifier Elimination. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:528-540 [Conf]
  44. Stéphane Demri, Denis Lugiez
    Presburger Modal Logic Is PSPACE-Complete. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:541-556 [Conf]
  45. Florent Jacquemard, Michaël Rusinowitch, Laurent Vigneron
    Tree Automata with Equality Constraints Modulo Equational Theories. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:557-571 [Conf]
  46. Geoff Sutcliffe
    CASC-J3 - The 3rd IJCAR ATP System Competition. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:572-573 [Conf]
  47. Jörg Endrullis, Johannes Waldmann, Hans Zantema
    Matrix Interpretations for Proving Termination of Term Rewriting. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:574-588 [Conf]
  48. Alexander Krauss
    Partial Recursive Functions in Higher-Order Logic. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:589-603 [Conf]
  49. Benjamin Werner
    On the Strength of Proof-Irrelevant Type Theories. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:604-618 [Conf]
  50. Daria Walukiewicz-Chrzaszcz, Jacek Chrzaszcz
    Consistency and Completeness of Rewriting in the Calculus of Constructions. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:619-631 [Conf]
  51. Daniel J. Dougherty, Kathi Fisler, Shriram Krishnamurthi
    Specifying and Reasoning About Dynamic Access-Control Policies. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:632-646 [Conf]
  52. David Toman, Grant E. Weddell
    On Keys and Functional Dependencies as First-Class Citizens in Description Logics. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:647-661 [Conf]
  53. Yevgeny Kazakov, Boris Motik
    A Resolution-Based Decision Procedure for SHOIQ. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:662-677 [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