Vor Ort
Merkzettel Warenkorb
  • Produktbild: Automated Deduction - CADE-15
  • Produktbild: Automated Deduction - CADE-15

Automated Deduction - CADE-15 15th International Conference on Automated Deduction, Lindau, Germany, July 5-10, 1998. Proceedings

Aus der Reihe Lecture Notes in Computer Science

49,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

24.06.1998

Herausgeber

Claude Kirchner + weitere

Verlag

Springer Berlin

Seitenzahl

450

Maße (L/B/H)

23,5/15,5/2,4 cm

Gewicht

698 g

Auflage

1998

Sprache

Englisch

ISBN

978-3-540-64675-4

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

24.06.1998

Herausgeber

Verlag

Springer Berlin

Seitenzahl

450

Maße (L/B/H)

23,5/15,5/2,4 cm

Gewicht

698 g

Auflage

1998

Sprache

Englisch

ISBN

978-3-540-64675-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 Deduction - CADE-15
  • Produktbild: Automated Deduction - CADE-15
  • Reasoning about deductions in linear logic.- A combination of nonstandard analysis and geometry theorem proving, with application to Newton's Principia.- Proving geometric theorems using clifford algebra and rewrite rules.- System description: similarity-based lemma generation for model elimination.- System description: Verification of distributed Erlang programs.- System description: Cooperation in model elimination: CPTHEO.- System description: CardTAP: The first theorem prover on a smart card.- System description: leanK 2.0.- Extensional higher-order resolution.- X.R.S: Explicit reduction systems — A first-order calculus for higher-order calculi.- About the confluence of equational pattern rewrite systems.- Unification in lambda-calculi with if-then-else.- System description: An equational constraints solver.- System description: CRIL platform for SAT.- System description: Proof planning in higher-order logic with ?Clam.- System description: An interface between CLAM and HOL.- System description: Leo — A higher-order theorem prover.- Superposition for divisible torsion-free abelian groups.- Strict basic superposition.- Elimination of equality via transformation with ordering constraints.- A resolution decision procedure for the guarded fragment.- Combining Hilbert style and semantic reasoning in a resolution framework.- ACL2 support for verification projects.- A fast algorithm for uniform semi-unification.- Termination analysis by inductive evaluation.- Admissibility of fixpoint induction over partial types.- Automated theorem proving in a simple meta-logic for LF.- Deductive vs. model-theoretic approaches to formal verification.- Automated deduction of finite-state control programs for reactive systems.- A proof environment for the development of group communication systems.- On the relationship between non-horn magic sets and relevancy testing.- Certified version of Buchberger's algorithm.- Selectively instantiating definitions.- Using matings for pruning connection tableaux.- On generating small clause normal forms.- Rank/activity: A canonical form for binary resolution.- Towards efficient subsumption.