Vor Ort
Merkzettel Warenkorb
  • Produktbild: Automated Reasoning
  • Produktbild: Automated Reasoning
Band 12167 - 11%

Automated Reasoning 10th International Joint Conference, IJCAR 2020, Paris, France, July 1–4, 2020, Proceedings, Part II

Aus der Reihe Lecture Notes in Computer Science
11% sparen

69,99 € UVP 79,17 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

30.06.2020

Herausgeber

Nicolas Peltier + weitere

Verlag

Springer

Seitenzahl

511

Maße (L/B/H)

23,5/15,5/2,9 cm

Gewicht

797 g

Auflage

1st ed. 2020

Sprache

Englisch

ISBN

978-3-030-51053-4

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

30.06.2020

Herausgeber

Verlag

Springer

Seitenzahl

511

Maße (L/B/H)

23,5/15,5/2,9 cm

Gewicht

797 g

Auflage

1st ed. 2020

Sprache

Englisch

ISBN

978-3-030-51053-4

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: GPSR Kontakt

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Automated Reasoning
  • Produktbild: Automated Reasoning

  • Interactive Theorem Proving/ HOL.- Competing inheritance paths in dependent type theory: a case study in functional analysis.- A Lean tactic for normalising ring expressions with exponents (short paper).- Practical proof search for Coq by type inhabitation.- Quotients of Bounded Natural Functors.- Trakhtenbrot’s Theorem in Coq.- Deep Generation of Coq Lemma Names Using Elaborated Terms.- Extensible Extraction of Efficient Imperative Programs with Foreign Functions, Manually Managed Memory, and Proofs.- Validating Mathematical Structures.- Teaching Automated Theorem Proving by Example: PyRes 1.2 (system description).- Beyond Notations: Hygienic Macro Expansion for Theorem Proving Languages.- Formalizations.- Formalizing the Face Lattice of Polyhedra.- Algebraically Closed Fields in Isabelle/HOL.- Formalization of Forcing in Isabelle/ZF.- Reasoning about Algebraic Structures with Implicit Carriers in Isabelle/HOL.- Formal Proof of the Group Law for Edwards Elliptic Curves.- Verifying Farad_zev-Read type Isomorph-Free Exhaustive Generation.- Verification.- Verified Approximation Algorithms.- Efficient Verified Implementation of Introsort and Pdqsort.- A Fast Verified Liveness Analysis in SSA form.- Verification of Closest Pair of Points Algorithms.- Reasoning Systems and Tools.- A Polymorphic Vampire (short paper).- N-PAT: A Nested Model-Checker (system description).- HYPNO: Theorem Proving with Hypersequent Calculi for Non-Normal Modal Logics (system description).- Implementing superposition in iProver (system description).- Moin: A Nested Sequent Theorem Prover for Intuitionistic Modal Logics (system description).- Make E Smart Again.- Automatically Proving and Disproving Feasibility Conditions.- µ-term: Verify Termination Properties Automatically (system description).- ENIGMA Anonymous: Symbol-Independent Inference Guiding Machine (system description).- The Imandra Automated Reasoning System (system description).- A Programmer’s Text Editor for a Logical Theory: The SUMOjEdit Editor (system description).- Sequoia: a playground for logicians (system description).- Prolog Technology Reinforcement Learning Prover (system description).