Automated Deduction - CADE-19
Home > Computing and Information Technology > Computer science > Artificial intelligence > Automated Deduction - CADE-19: 19th International Conference on Automated Deduction Miami Beach, FL, USA, July 28 - August 2, 2003, Proceedings(2741 Lecture Notes in Computer Science)
Automated Deduction - CADE-19: 19th International Conference on Automated Deduction Miami Beach, FL, USA, July 28 - August 2, 2003, Proceedings(2741 Lecture Notes in Computer Science)

Automated Deduction - CADE-19: 19th International Conference on Automated Deduction Miami Beach, FL, USA, July 28 - August 2, 2003, Proceedings(2741 Lecture Notes in Computer Science)


     0     
5
4
3
2
1



International Edition


X
About the Book

This volume contains the papers presented at the 19th International Conference on Automated Deduction (CADE-19) held 28 July–2 August 2003 in Miami Beach, Florida, USA. They are divided into the following categories: – 4 contributions by invited speakers: one full paper and three short abstracts; – 29 accepted technical papers; – 7 descriptions of automated reasoning systems. These proceedings also contain a short description of the automated theor- proving system competition (CASC-19) organized by Geo? Sutcli?e and Chr- tian Suttner. Despite many competing smaller conferences and workshops covering di?- entaspectsofautomateddeduction,CADEisstillthemajorforumfordiscussing new results on all aspects of automated deduction as well as presenting new s- tems and improvements of established systems. In contrast to the previous year, when CADE was one of the conferences participating in the Third Federated Logic Conference (FLoC 2002), and next year, when CADE will be part of the Second International Joint Conference on Automated Reasoning (IJCAR 2004), CADE-19 was organized as a stand-alone event.

Table of Contents:
Session 1: Invited Talk.- SAT-Based Counterexample Guided Abstraction Refinement in Model Checking.- Session 2.- Equational Abstractions.- Deciding Inductive Validity of Equations.- Automating the Dependency Pair Method.- An AC-Compatible Knuth-Bendix Order.- Session 3.- The Complexity of Finite Model Reasoning in Description Logics.- Optimizing a BDD-Based Modal Solver.- A Translation of Looping Alternating Automata into Description Logics.- Session 4.- Foundational Certified Code in a Metalogical Framework.- Proving Pointer Programs in Higher-Order Logic.- ?.- Subset Types and Partial Functions.- Session 5.- Reasoning about Quantifiers by Matching in the E-graph.- Session 6.- A Randomized Satisfiability Procedure for Arithmetic and Uninterpreted Function Symbols.- Superposition Modulo a Shostak Theory.- Canonization for Disjoint Unions of Theories.- Matching in a Class of Combined Non-disjoint Theories.- Session 7.- Reasoning about Iteration in Gödel’s Class Theory.- Algorithms for Ordinal Arithmetic.- Certifying Solutions to Permutation Group Problems.- Session 8: System Descriptions.- TRP++ 2.0: A Temporal Resolution Prover.- IsaPlanner: A Prototype Proof Planner in Isabelle.- ’Living Book’ :- ’Deduction’, ’Slicing’, ’Interaction’.- The Homer System.- Session 9: CASC-19 Results.- The CADE-19 ATP System Competition.- Session 10: Invited Talk.- Proof Search and Proof Check for Equational and Inductive Theorems.- Session 11: System Descriptions.- The New WALDMEISTER Loop at Work.- About VeriFun.- How to Prove Inductive Theorems? QuodLibet!.- Session 12: Invited Talk.- Reasoning about Qualitative Representations of Space and Time.- Session 13.- Superposition with Equivalence Reasoning and Delayed Clause Normal Form Transformation.- The ModelEvolution Calculus.- Translation of Resolution Proofs into Short First-Order Proofs without Choice Axioms.- Efficient Instance Retrieval with Standard and Relational Path Indexing.- Session 14.- Monodic Temporal Resolution.- A Principle for Incorporating Axioms into the First-Order Translation of Modal Formulae.- Schematic Saturation for Decision and Unification Problems.- Session 15.- Unification Modulo ACUI Plus Homomorphisms/Distributivity.- Source-Tracking Unification.- Optimizing Higher-Order Pattern Unification.- Decidability of Arity-Bounded Higher-Order Matching.


Best Sellers


Product Details
  • ISBN-13: 9783540405597
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Height: 235 mm
  • No of Pages: 512
  • Returnable: N
  • Series Title: Lecture Notes in Artificial Intelligence
  • Width: 155 mm
  • ISBN-10: 3540405593
  • Publisher Date: 16 Jul 2003
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Series Title: 2741 Lecture Notes in Computer Science
  • Sub Title: 19th International Conference on Automated Deduction Miami Beach, FL, USA, July 28 - August 2, 2003, Proceedings


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Automated Deduction - CADE-19: 19th International Conference on Automated Deduction Miami Beach, FL, USA, July 28 - August 2, 2003, Proceedings(2741 Lecture Notes in Computer Science)
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Automated Deduction - CADE-19: 19th International Conference on Automated Deduction Miami Beach, FL, USA, July 28 - August 2, 2003, Proceedings(2741 Lecture Notes in Computer Science)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Automated Deduction - CADE-19: 19th International Conference on Automated Deduction Miami Beach, FL, USA, July 28 - August 2, 2003, Proceedings(2741 Lecture Notes in Computer Science)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!