000 | 05356nam a22005655i 4500 | ||
---|---|---|---|
001 | 978-3-540-69140-2 | ||
003 | DE-He213 | ||
005 | 20240423132442.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1997 gw | s |||| 0|eng d | ||
020 |
_a9783540691402 _9978-3-540-69140-2 |
||
024 | 7 |
_a10.1007/3-540-63104-6 _2doi |
|
050 | 4 | _aQ334-342 | |
050 | 4 | _aTA347.A78 | |
072 | 7 |
_aUYQ _2bicssc |
|
072 | 7 |
_aCOM004000 _2bisacsh |
|
072 | 7 |
_aUYQ _2thema |
|
082 | 0 | 4 |
_a006.3 _223 |
245 | 1 | 0 |
_aAutomated Deduction - CADE-14 _h[electronic resource] : _b14th International Conference on Automated Deduction, Townsville, North Queensland, Australia, July 13 - 17, 1997, Proceedings / _cedited by William McCune. |
250 | _a1st ed. 1997. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c1997. |
|
300 |
_aXV, 469 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 Artificial Intelligence, _x2945-9141 ; _v1249 |
|
505 | 0 | _aThe char-set method and its applications to automated reasoning -- Decidable call by need computations in term rewriting (extended abstract) -- A New approach for combining decision procedures for the word problem, and its connection to the Nelson-Oppen combination method -- On equality up-to constraints over finite trees, context unification, and one-step rewriting -- Dedam: A kernel of data structures and algorithms for automated deduction with equality clauses -- The Clause-Diffusion theorem prover Peers-mcd (system description) -- Integration of automated and interactive theorem proving in ILF -- ILF-SETHEO -- SETHEO goes software engineering: Application of ATP to software reuse -- Proving System Correctness with KIV 3.0 -- A practical symbolic algorithm for the inverse kinematics of 6R manipulators with simple geometry -- Automatic verification of cryptographic protocols with SETHEO -- A practical integration of first-order reasoning and decision procedures -- Some pitfalls of LK-to-LJ translations and how to avoid them -- Deciding intuitionistic propositional logic via translation into classical logic -- Lemma matching for a PTTP-based top-down theorem prover -- Exact knowledge compilation in predicate calculus: The partial achievement case -- Non-horn magic sets to incorporate top-down inference into bottom-up theorem proving -- Alternating automata: Unifying truth and validity checking for temporal logics -- Connection-based proof construction in linear logic -- Resource-distribution via Boolean constraints -- Constructing a normal form for Property Theory -- ?mega: Towards a mathematical assistant -- Plagiator — A learning prover -- CODE: A powerful prover for problems of condensed detachment -- A new method for testing decision procedures in modal logics -- Minlog: A minimal logictheorem prover -- SATO: An efficient prepositional prover -- Using a generalisation critic to find bisimulations for coinductive proofs -- A colored version of the ?-calculus -- A practical implementation of simple consequence relations using inductive definitions -- Soft typing for ordered resolution -- A classification of non-liftable orders for resolution -- Hybrid interactive theorem proving using nuprl and HOL -- Proof tactics for a theory of state machines in a graphical environment -- RALL: Machine-supported proofs for relation algebra -- Nuprl-Light: An implementation framework for higher-order logics -- XIsabelle: A system description -- XBarnacle: Making theorem provers more accessible -- The tableau browser SNARKS -- Jape: A calculator for animating proof-on-paper -- Evolving combinators -- Partial matching for analogy discovery in proofs and counter-examples -- Dialog. | |
520 | _aThis book constitutes the strictly refereed proceedings of the 14th International Conference on Automated Deduction, CADE-14, held in Townsville, North Queensland, Australia, in July 1997. The volume presents 25 revised full papers selected from a total of 87 submissions; also included are 17 system descriptions and two invited contributions. The papers cover a wide range of current issues in the area including resolution, term rewriting, unification theory, induction, high-order logics, nonstandard logics, AI methods, and applications to software verification, geometry, and social science. | ||
650 | 0 | _aArtificial intelligence. | |
650 | 0 | _aComputer systems. | |
650 | 0 | _aMachine theory. | |
650 | 1 | 4 | _aArtificial Intelligence. |
650 | 2 | 4 | _aComputer System Implementation. |
650 | 2 | 4 | _aFormal Languages and Automata Theory. |
700 | 1 |
_aMcCune, William. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540631040 |
776 | 0 | 8 |
_iPrinted edition: _z9783662179680 |
830 | 0 |
_aLecture Notes in Artificial Intelligence, _x2945-9141 ; _v1249 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/3-540-63104-6 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
912 | _aZDB-2-BAE | ||
942 | _cSPRINGER | ||
999 |
_c187908 _d187908 |