- Greg Nelson:
Reasoning about Quantifiers by Matching in the E-graph. CADE 2003: 166 - Hans de Nivelle:
Translation of Resolution Proofs into Short First-Order Proofs without Choice Axioms. CADE 2003: 365-379 - Guoqiang Pan, Moshe Y. Vardi:
Optimizing a BDD-Based Modal Solver. CADE 2003: 75-89 - Brigitte Pientka, Frank Pfenning:
Optimizing Higher-Order Pattern Unification. CADE 2003: 473-487 - Alexandre Riazanov, Andrei Voronkov:
Efficient Instance Retrieval with Standard and Relational Path Indexing. CADE 2003: 380-396 - Christophe Ringeissen:
Matching in a Class of Combined Non-disjoint Theories. CADE 2003: 212-227 - Manfred Schmidt-Schauß:
Decidability of Arity-Bounded Higher-Order Matching. CADE 2003: 488-502 - Renate A. Schmidt, Ullrich Hustadt:
A Principle for Incorporating Axioms into the First-Order Translation of Modal Formulae. CADE 2003: 412-426 - Aaron Stump:
Subset Types and Partial Functions. CADE 2003: 151-165 - Geoff Sutcliffe, Christian B. Suttner:
The CADE-19 ATP System Competition. CADE 2003: 295-296 - Christoph Walther, Stephan Schweitzer:
About VeriFun. CADE 2003: 322-327 - Franz Baader:
Automated Deduction - CADE-19, 19th International Conference on Automated Deduction Miami Beach, FL, USA, July 28 - August 2, 2003, Proceedings. Lecture Notes in Computer Science 2741, Springer 2003, ISBN 3-540-40559-3 [contents]