Buy Automated Deduction - CADE-11 Book by Deepak Kapur
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Home > Computing and Information Technology > Computer science > Artificial intelligence > Automated Deduction - CADE-11: 11th International Conference on Automated Deduction, Saratoga Springs, NY, USA, June 15-18, 1992. Proceedings(Lecture Notes in Artificial Intelligence)
Automated Deduction - CADE-11: 11th International Conference on Automated Deduction, Saratoga Springs, NY, USA, June 15-18, 1992. Proceedings(Lecture Notes in Artificial Intelligence)

Automated Deduction - CADE-11: 11th International Conference on Automated Deduction, Saratoga Springs, NY, USA, June 15-18, 1992. Proceedings(Lecture Notes in Artificial Intelligence)


     0     
5
4
3
2
1



International Edition


X
About the Book

This volume contains the papers presented at the EleventhInternational Conference on Automated Deduction (CADE-11)held in Saratoga Springs, NY, inJune 1992. A total of 136papers were submitted for presentation by researchers fromnearly 20 countries. Papers covered many topics including:resolution; term rewriting; natural deduction; theoremproving, in particular in algebra and geometry; paralleltheoremprovers; unification theory; constraint solving;logic programing; verification; multivalued, temporal andnonclassical logics; non-monotonic reasoning; planning;proof theory; higher-order logics; and inductive theoremproving. Each submission was reviewed by at least threeprogram committee members and 46 papers were selected forpresentation and publication. This volume also containsshort descriptions of 23 implementations of automateddeduction systems. The volume opens with a keynote addressby Larry Wos, winner of the first Herbrand Award forDistinguished Contributions to Automated Reasoning.

Table of Contents:
The impossibility of the automation of logical reasoning.- Automatic proofs in mathematical logic and analysis.- Proving geometry statements of constructive type.- The central variable strategy of str?ve.- Unification in the union of disjoint equational theories: Combining decision procedures.- Reduction and unification in Lambda calculi with subtypes.- A combinatory logic approach to higher-order E-unification (extended abstract).- Cycle unification.- A parallel completion procedure for term rewriting systems.- Grammar rewriting.- Polynomial interpretations and the complexity of algorithms.- Uniform traversal combinators: Definition, use and properties.- Sorted unification using set constraints.- An abstract view of sorted unification.- Unification in order-sorted algebras with overloading.- Puzzles and paradoxes.- Experiments in automated deduction with condensed detachment.- Caching and lemmaizing in model elimination theorem provers.- LIM+ challenge problems by RUE hyper-resolution.- Computing prime implicates incrementally.- Linear-input subset analysis.- Theoretical study of symmetries in propositional calculus and applications.- Difference matching.- Using middle-out reasoning to control the synthesis of tail-recursive programs.- The use of proof plans to sum series.- Disproving conjectures.- An interval-based temporal logic in a multivalued setting.- A normal form for first-order temporal formulae.- Semantic entailment in non classical logics based on proofs found in classical logic.- Embedding negation as failure into a model generation theorem prover.- Automated correctness proofs of machine code programs for a commercial microprocessor.- Proving the Chinese remainder theorem by the cover set induction.- Automatic program optimization through prooftransformation.- Proof search theory and practice in the (former) USSR (Tentative).- Basic paramodulation and superposition.- Theorem proving with ordering constrained clauses.- The special-relation rules are incomplete.- An improved method for adding equality to free variable semantic tableaux.- Proof search in the intuitionistic sequent calculus.- Implementing the meta-theory of deductive systems.- Tactic-based theorem proving and knowledge-based forward chaining: An experiment with Nuprl and Ontic.- Little theories.- Some termination criteria for narrowing and E-narrowing.- Decidable matching for convergent systems.- Free sequentially in orthogonal order-sorted rewriting systems with constructors.- Programming with equations: A framework for lazy parallel evaluation.- A many sorted logic with possibly empty sorts.- Theorem proving in non-standard logics based on the inverse method.- One more logic with uncertainty and resolution principle for it.- A natural deduction automated theorem proving system.- Isabelle-91.- The semantically guided linear deduction system.- The Shunyata system.- A geometry theorem prover for macintoshes.- FRI: Failure-resistant induction in RRL.- Herky: High performance rewriting in RRL.- IMPS: System description.- Proving equality theorems with hyper-linking.- Xpnet: A graphical interface to proof nets with an efficient proof checker.- &: Automated natural deduction.- An overview of Frapps 2.0: A framework for resolution-based automated proof procedure systems.- The GAZER theorem prover.- ROO: A parallel theorem prover.- RVF: An automated formal verification system.- KPROP — An AND-parallel theorem prover for propositional logic implemented in KL1 system abstract.- A report on ICL HOL.- PVS: A prototype verification system.- The KIVsystem: Systematic construction of verified software.- The tableau-based theorem prover 3 T A P for multiple-valued logics.- Analytica — A theorem prover in mathematica.- The FAUST — prover.- Eves system description.- MGTP: A parallel theorem prover based on lazy model generation.- Benchmark problems in which equality plays the major role.- Computing transitivity tables: A challenge for automated theorem provers.


Best Sellers


Product Details
  • ISBN-13: 9783540556022
  • 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: 800
  • Returnable: Y
  • Series Title: Lecture Notes in Artificial Intelligence
  • Width: 155 mm
  • ISBN-10: 3540556028
  • Publisher Date: 27 May 1992
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Series Title: Lecture Notes in Artificial Intelligence
  • Sub Title: 11th International Conference on Automated Deduction, Saratoga Springs, NY, USA, June 15-18, 1992. Proceedings


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Automated Deduction - CADE-11: 11th International Conference on Automated Deduction, Saratoga Springs, NY, USA, June 15-18, 1992. Proceedings(Lecture Notes in Artificial Intelligence)
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Automated Deduction - CADE-11: 11th International Conference on Automated Deduction, Saratoga Springs, NY, USA, June 15-18, 1992. Proceedings(Lecture Notes in Artificial Intelligence)
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-11: 11th International Conference on Automated Deduction, Saratoga Springs, NY, USA, June 15-18, 1992. Proceedings(Lecture Notes in Artificial Intelligence)

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

    Fresh on the Shelf


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!