000 06541nam a22006015i 4500
001 978-3-540-45101-3
003 DE-He213
005 20240423132530.0
007 cr nn 008mamaa
008 121227s2000 gw | s |||| 0|eng d
020 _a9783540451013
_9978-3-540-45101-3
024 7 _a10.1007/10721959
_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-17
_h[electronic resource] :
_b17th International Conference on Automated Deduction Pittsburgh, PA, USA, June 17-20, 2000 Proceedings /
_cedited by David McAllester.
250 _a1st ed. 2000.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2000.
300 _aXIV, 526 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 ;
_v1831
505 0 _aInvited Talk: -- High-Level Verification Using Theorem Proving and Formalized Mathematics -- Session 1: -- Machine Instruction Syntax and Semantics in Higher Order Logic -- Proof Generation in the Touchstone Theorem Prover -- Wellfounded Schematic Definitions -- Session 2: -- Abstract Congruence Closure and Specializations -- A Framework for Cooperating Decision Procedures -- Modular Reasoning in Isabelle -- An Infrastructure for Intertheory Reasoning -- Session 3: -- Gödel’s Algorithm for Class Formation -- Automated Proof Construction in Type Theory Using Resolution -- System Description: TPS: A Theorem Proving System for Type Theory -- The Nuprl Open Logical Environment -- System Description: aRa – An Automatic Theorem Prover for Relation Algebras -- Invited Talk: -- Scalable Knowledge Representation and Reasoning Systems -- Session 4: -- Efficient Minimal Model Generation Using Branching Lemmas -- FDPLL — A First-Order Davis-Putnam-Logeman-Loveland Procedure -- Rigid E-Unification Revisited -- Invited Talk: -- Connecting Bits with Floating-Point Numbers: Model Checking and Theorem Proving in Practice -- Session 5: -- Reducing Model Checking of the Many to the Few -- Simulation Based Minimization -- Rewriting for Cryptographic Protocol Verification -- System Description: *sat: A Platform for the Development of Modal Decision Procedures -- System Description: DLP -- Two Techniques to Improve Finite Model Search -- Session 6: -- Eliminating Dummy Elimination -- Extending Decision Procedures with Induction Schemes -- Complete Monotonic Semantic Path Orderings -- Session 7: -- Stratified Resolution -- Support Ordered Resolution -- System Description: IVY -- System Description: SystemOnTPTP -- System Description: PTTP+GLiDeS Semantically Guided PTTP -- Session 8: -- A Formalization of a Concurrent ObjectCalculus up to ?-Conversion -- A Resolution Decision Procedure for Fluted Logic -- ZRes: The Old Davis–Putnam Procedure Meets ZBDD -- System Description: MBase, an Open Mathematical Knowledge Base -- System Description: Tramp: Transformation of Machine-Found Proofs into Natural Deduction Proofs at the Assertion Level -- Session 9: -- On Unification for Bounded Distributive Lattices -- Reasoning with Individuals for the Description Logic -- System Description: Embedding Verification into Microsoft Excel -- System Description: Interactive Proof Critics in XBarnacle -- Tutorials: -- Tutorial: Meta-logical Frameworks -- Tutorial: Automated Deduction and Natural Language Understanding -- Tutorial: Using TPS for Higher-Order Theorem Proving and ETPS for Teaching Logic -- Workshops: -- Workshop: Model Computation – Principles, Algorithms, Applications -- Workshop: Automation of Proof by Mathematical Induction -- Workshop: Type-Theoretic Languages: Proof-Search and Semantics -- Workshop: Automated Deduction in Education -- Workshop: The Role of Automated Deduction in Mathematics.
520 _aFor the past 25 years the CADE conference has been the major forum for the presentation of new results in automated deduction. This volume contains the papers and system descriptions selected for the 17th International Conference on Automated Deduction, CADE-17, held June 17-20, 2000,at Carnegie Mellon University, Pittsburgh, Pennsylvania (USA). Fifty-three research papers and twenty system descriptions were submitted by researchers from ?fteen countries. Each submission was reviewed by at least three reviewers. Twenty-four research papers and ?fteen system descriptions were accepted. The accepted papers cover a variety of topics related to t- orem proving and its applications such as proof carrying code, cryptographic protocol veri?cation, model checking, cooperating decision procedures, program veri?cation, and resolution theorem proving. The program also included three invited lectures: “High-level veri?cation using theorem proving and formalized mathematics” by John Harrison, “Sc- able Knowledge Representation and Reasoning Systems” by Henry Kautz, and “Connecting Bits with Floating-Point Numbers: Model Checking and Theorem Proving in Practice” by Carl Seger. Abstracts or full papers of these talks are included in this volume.In addition to the accepted papers, system descriptions, andinvited talks, this volumecontains one page summaries of four tutorials and ?ve workshops held in conjunction with CADE-17.
650 0 _aArtificial intelligence.
650 0 _aComputer science.
650 0 _aMachine theory.
650 0 _aMathematical logic.
650 1 4 _aArtificial Intelligence.
650 2 4 _aTheory of Computation.
650 2 4 _aFormal Languages and Automata Theory.
650 2 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aMathematical Logic and Foundations.
700 1 _aMcAllester, David.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540676645
776 0 8 _iPrinted edition:
_z9783662176870
830 0 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v1831
856 4 0 _uhttps://doi.org/10.1007/10721959
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c188792
_d188792