BibSLEIGH — Proceedings of the 19th International Conference on Automated Deduction

Franz Baader
Proceedings of the 19th International Conference on Automated Deduction
CADE, 2003.

TEST

@proceedings{CADE-2003,
	address       = "19th International Conference on Automated Deduction Miami Beach, Florida, USA",
	editor        = "Franz Baader",
	isbn          = "3-540-40559-3",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 19th International Conference on Automated Deduction}",
	volume        = 2741,
	year          = 2003,
}

Contents (41 items)

CADE-2003-Clarke #abstraction #model checking #refinement #satisfiability: SAT-Based Counterexample Guided Abstraction Refinement in Model Checking (EMC), p. 1.
CADE-2003-MeseguerPM #abstraction #equation: Equational Abstractions (JM, MP, NMO), pp. 2–16.
CADE-2003-GieslK #equation #induction: Deciding Inductive Validity of Equations (JG, DK), pp. 17–31.
CADE-2003-HirokawaM #automation #dependence: Automating the Dependency Pair Method (NH, AM), pp. 32–46.
CADE-2003-KorovinV #order: An AC-Compatible Knuth-Bendix Order (KK, AV), pp. 47–59.
CADE-2003-LutzST #complexity #finite #logic #reasoning: The Complexity of Finite Model Reasoning in Description Logics (CL, US, LT), pp. 60–74.
CADE-2003-PanV #optimisation: Optimizing a BDD-Based Modal Solver (GP, MYV), pp. 75–89.
CADE-2003-HladikS #automaton #logic: A Translation of Looping Alternating Automata into Description Logics (JH, US), pp. 90–105.
CADE-2003-CraryS #framework #logic: Foundational Certified Code in a Metalogical Framework (KC, SS), pp. 106–120.
CADE-2003-MehtaN #higher-order #logic #pointer #proving #source code: Proving Pointer Programs in Higher-Order Logic (FM, TN), pp. 121–135.
CADE-2003-HendriksO: adbmal (DH, VvO), pp. 136–150.
CADE-2003-Stump #set: Subset Types and Partial Functions (AS), pp. 151–165.
CADE-2003-Nelson #quantifier #reasoning: Reasoning about Quantifiers by Matching in the E-graph (GN), p. 166.
CADE-2003-GulwaniN #random: A Randomized Satisfability Procedure for Arithmetic and Uninterpreted Function Symbols (SG, GCN), pp. 167–181.
CADE-2003-GanzingerHW: Superposition Modulo a Shostak Theory (HG, TH, UW), pp. 182–196.
CADE-2003-KrsticC: Canonization for Disjoint Unions of Theories (SK, SC), pp. 197–211.
CADE-2003-Ringeissen: Matching in a Class of Combined Non-disjoint Theories (CR), pp. 212–227.
CADE-2003-Belinfante #reasoning: Reasoning about Iteration in Gödel’s Class Theory (JGFB), pp. 228–242.
CADE-2003-ManoliosV #algorithm: Algorithms for Ordinal Arithmetic (PM, DV), pp. 243–257.
CADE-2003-CohenMPS #permutation #problem: Certifying Solutions to Permutation Group Problems (AMC, SHM, MP, VS), pp. 258–273.
CADE-2003-HustadtK #proving: TRP++2.0: A Temporal Resolution Prover (UH, BK), pp. 274–278.
CADE-2003-DixonF #named #prototype #proving #theorem proving: IsaPlanner: A Prototype Proof Planner in Isabelle (LD, JDF), pp. 279–283.
CADE-2003-BaumgartnerFGS #deduction #interactive #quote #slicing: “Living Book” :- “Deduction”, “Slicing”, “Interaction” (PB, UF, MGH, AS), pp. 284–288.
CADE-2003-ColtonH: The Homer System (SC, SH), pp. 289–294.
CADE-2003-SutcliffeS #contest: The CADE-19 ATP System Competition (GS, CBS), pp. 295–296.
CADE-2003-DeplagneKKN #equation #induction #proving #theorem: Proof Search and Proof Check for Equational and Inductive Theorems (ED, CK, HK, QHN), pp. 297–316.
CADE-2003-GaillourdetHLS: The New WALDMEISTER Loop at Work (JMG, TH, BL, HS), pp. 317–321.
CADE-2003-WaltherS: About VeriFun (CW, SS), pp. 322–327.
CADE-2003-AvenhausKSW #exclamation #how #induction #theorem: How to Prove Inductive Theorems? QUODLIBET! (JA, UK, TSS, CPW), pp. 328–333.
CADE-2003-Cohn #reasoning: Reasoning about Qualitative Representations of Space and Time (AGC), p. 334.
CADE-2003-GanzingerS #equivalence #normalisation #reasoning: Superposition with Equivalence Reasoning and Delayed Clause Normal Form Transformation (HG, JS), pp. 335–349.
CADE-2003-BaumgartnerT #calculus #evolution: The Model Evolution Calculus (PB, CT), pp. 350–364.
CADE-2003-Nivelle #axiom #first-order #proving: Translation of Resolution Proofs into Short First-Order Proofs without Choice Axioms (HdN), pp. 365–379.
CADE-2003-RiazanovV #performance #relational #retrieval #standard: Efficient Instance Retrieval with Standard and Relational Path Indexing (AR, AV), pp. 380–396.
CADE-2003-DegtyarevFK: Monodic Temporal Resolution (AD, MF, BK), pp. 397–411.
CADE-2003-SchmidtH #axiom #first-order: A Principle for Incorporating Axioms into the First-Order Translation of Modal Formulae (RAS, UH), pp. 412–426.
CADE-2003-Lynch #problem #unification: Schematic Saturation for Decision and Unification Problems (CL), pp. 427–441.
CADE-2003-AnantharamanNR #morphism #unification: Unification Modulo ACU I Plus Homomorphisms/Distributivity (SA, PN, MR), pp. 442–457.
CADE-2003-ChoppellaH #unification: Source-Tracking Unification (VC, CTH), pp. 458–472.
CADE-2003-PientkaP #higher-order #optimisation #unification: Optimizing Higher-Order Pattern Unification (BP, FP), pp. 473–487.
CADE-2003-Schmidt-Schauss #bound #decidability #higher-order: Decidability of Arity-Bounded Higher-Order Matching (MSS), pp. 488–502.

Franz BaaderProceedings of the 19th International Conference on Automated DeductionCADE, 2003.

Contents (41 items)

Franz Baader
Proceedings of the 19th International Conference on Automated Deduction
CADE, 2003.