| 000 | 07047nam a22005175i 4500 | ||
|---|---|---|---|
| 001 | 978-3-540-47252-0 | ||
| 003 | DE-He213 | ||
| 005 | 20160624102021.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 121227s1992 gw | s |||| 0|eng d | ||
| 020 |
_a9783540472520 _9978-3-540-47252-0 |
||
| 024 | 7 |
_a10.1007/3-540-55602-8 _2doi |
|
| 050 | 4 | _aQ334-342 | |
| 050 | 4 | _aTJ210.2-211.495 | |
| 072 | 7 |
_aUYQ _2bicssc |
|
| 072 | 7 |
_aTJFM1 _2bicssc |
|
| 072 | 7 |
_aCOM004000 _2bisacsh |
|
| 082 | 0 | 4 |
_a006.3 _223 |
| 245 | 1 | 0 |
_aAutomated Deduction—CADE-11 _h[electronic resource] : _b11th International Conference on Automated Deduction Saratoga Springs, NY, USA, June 15–18, 1992 Proceedings / _cedited by Deepak Kapur. |
| 260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1992. |
|
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1992. |
|
| 300 |
_aXVI, 800 p. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aLecture Notes in Computer Science, Lecture Notes in Artificial Intelligence, _x0302-9743 ; _v607 |
|
| 505 | 0 | _aThe 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 proof transformation -- 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 KIV system: 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. | |
| 520 | _aThis volume contains the papers presented at the Eleventh International Conference on Automated Deduction (CADE-11) held in Saratoga Springs, NY, inJune 1992. A total of 136 papers were submitted for presentation by researchers from nearly 20 countries. Papers covered many topics including: resolution; term rewriting; natural deduction; theorem proving, in particular in algebra and geometry; parallel theoremprovers; unification theory; constraint solving; logic programing; verification; multivalued, temporal and nonclassical logics; non-monotonic reasoning; planning; proof theory; higher-order logics; and inductive theorem proving. Each submission was reviewed by at least three program committee members and 46 papers were selected for presentation and publication. This volume also contains short descriptions of 23 implementations of automated deduction systems. The volume opens with a keynote address by Larry Wos, winner of the first Herbrand Award for Distinguished Contributions to Automated Reasoning. | ||
| 650 | 0 | _aComputer science. | |
| 650 | 0 | _aArtificial intelligence. | |
| 650 | 0 | _aLogic, Symbolic and mathematical. | |
| 650 | 1 | 4 | _aComputer Science. |
| 650 | 2 | 4 | _aArtificial Intelligence (incl. Robotics). |
| 650 | 2 | 4 | _aMathematical Logic and Formal Languages. |
| 650 | 2 | 4 | _aMathematical Logic and Foundations. |
| 700 | 1 |
_aKapur, Deepak. _eeditor. |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer eBooks | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540556022 |
| 786 | _dSpringer | ||
| 830 | 0 |
_aLecture Notes in Computer Science, Lecture Notes in Artificial Intelligence, _x0302-9743 ; _v607 |
|
| 856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/3-540-55602-8 |
| 942 |
_2EBK6017 _cEBK |
||
| 999 |
_c35311 _d35311 |
||