Conferences in DBLP
Edmund M. Clarke SAT-Based Counterexample Guided Abstraction Refinement in Model Checking. [Citation Graph (0, 0)][DBLP ] CADE, 2003, pp:1- [Conf ] José Meseguer , Miguel Palomino , Narciso Martí-Oliet Equational Abstractions. [Citation Graph (0, 0)][DBLP ] CADE, 2003, pp:2-16 [Conf ] Jürgen Giesl , Deepak Kapur Deciding Inductive Validity of Equations. [Citation Graph (0, 0)][DBLP ] CADE, 2003, pp:17-31 [Conf ] Nao Hirokawa , Aart Middeldorp Automating the Dependency Pair Method. [Citation Graph (0, 0)][DBLP ] CADE, 2003, pp:32-46 [Conf ] Konstantin Korovin , Andrei Voronkov An AC-Compatible Knuth-Bendix Order. [Citation Graph (0, 0)][DBLP ] CADE, 2003, pp:47-59 [Conf ] 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 ] Guoqiang Pan , Moshe Y. Vardi Optimizing a BDD-Based Modal Solver. [Citation Graph (0, 0)][DBLP ] CADE, 2003, pp:75-89 [Conf ] Jan Hladik , Ulrike Sattler A Translation of Looping Alternating Automata into Description Logics. [Citation Graph (0, 0)][DBLP ] CADE, 2003, pp:90-105 [Conf ] Karl Crary , Susmit Sarkar Foundational Certified Code in a Metalogical Framework. [Citation Graph (0, 0)][DBLP ] CADE, 2003, pp:106-120 [Conf ] Farhad Mehta , Tobias Nipkow Proving Pointer Programs in Higher-Order Logic. [Citation Graph (0, 0)][DBLP ] CADE, 2003, pp:121-135 [Conf ] Dimitri Hendriks , Vincent van Oostrom adbmal [Citation Graph (0, 0)][DBLP ] CADE, 2003, pp:136-150 [Conf ] Aaron Stump Subset Types and Partial Functions. [Citation Graph (0, 0)][DBLP ] CADE, 2003, pp:151-165 [Conf ] Greg Nelson Reasoning about Quantifiers by Matching in the E-graph. [Citation Graph (0, 0)][DBLP ] CADE, 2003, pp:166- [Conf ] 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 ] Harald Ganzinger , Thomas Hillenbrand , Uwe Waldmann Superposition Modulo a Shostak Theory. [Citation Graph (0, 0)][DBLP ] CADE, 2003, pp:182-196 [Conf ] Sava Krstic , Sylvain Conchon Canonization for Disjoint Unions of Theories. [Citation Graph (0, 0)][DBLP ] CADE, 2003, pp:197-211 [Conf ] Christophe Ringeissen Matching in a Class of Combined Non-disjoint Theories. [Citation Graph (0, 0)][DBLP ] CADE, 2003, pp:212-227 [Conf ] Johan G. F. Belinfante Reasoning about Iteration in Gödel's Class Theory. [Citation Graph (0, 0)][DBLP ] CADE, 2003, pp:228-242 [Conf ] Panagiotis Manolios , Daron Vroon Algorithms for Ordinal Arithmetic. [Citation Graph (0, 0)][DBLP ] CADE, 2003, pp:243-257 [Conf ] 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 ] Ullrich Hustadt , Boris Konev TRP++2.0: A Temporal Resolution Prover. [Citation Graph (0, 0)][DBLP ] CADE, 2003, pp:274-278 [Conf ] Lucas Dixon , Jacques D. Fleuriot IsaPlanner: A Prototype Proof Planner in Isabelle. [Citation Graph (0, 0)][DBLP ] CADE, 2003, pp:279-283 [Conf ] 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 ] Simon Colton , Sophie Huczynska The Homer System. [Citation Graph (0, 0)][DBLP ] CADE, 2003, pp:289-294 [Conf ] Geoff Sutcliffe , Christian B. Suttner The CADE-19 ATP System Competition. [Citation Graph (0, 0)][DBLP ] CADE, 2003, pp:295-296 [Conf ] 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 ] 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 ] Christoph Walther , Stephan Schweitzer About VeriFun. [Citation Graph (0, 0)][DBLP ] CADE, 2003, pp:322-327 [Conf ] 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 ] Anthony G. Cohn Reasoning about Qualitative Representations of Space and Time. [Citation Graph (0, 0)][DBLP ] CADE, 2003, pp:334- [Conf ] 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 ] Peter Baumgartner , Cesare Tinelli The Model Evolution Calculus. [Citation Graph (0, 0)][DBLP ] CADE, 2003, pp:350-364 [Conf ] 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 ] Alexandre Riazanov , Andrei Voronkov Efficient Instance Retrieval with Standard and Relational Path Indexing. [Citation Graph (0, 0)][DBLP ] CADE, 2003, pp:380-396 [Conf ] Anatoli Degtyarev , Michael Fisher , Boris Konev Monodic Temporal Resolution. [Citation Graph (0, 0)][DBLP ] CADE, 2003, pp:397-411 [Conf ] 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 ] Christopher Lynch Schematic Saturation for Decision and Unification Problems. [Citation Graph (0, 0)][DBLP ] CADE, 2003, pp:427-441 [Conf ] 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 ] Venkatesh Choppella , Christopher T. Haynes Source-Tracking Unification. [Citation Graph (0, 0)][DBLP ] CADE, 2003, pp:458-472 [Conf ] Brigitte Pientka , Frank Pfenning Optimizing Higher-Order Pattern Unification. [Citation Graph (0, 0)][DBLP ] CADE, 2003, pp:473-487 [Conf ] Manfred Schmidt-Schauß Decidability of Arity-Bounded Higher-Order Matching. [Citation Graph (0, 0)][DBLP ] CADE, 2003, pp:488-502 [Conf ]