Automated Reasoning - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540223450, 9783540259848

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Formalizing O Notation in Isabelle/HOL

Automated Reasoning - Lecture Notes in Computer Science ◽

10.1007/978-3-540-25984-8_27 ◽

2004 ◽

pp. 357-371 ◽

Cited By ~ 17

Author(s):

Jeremy Avigad ◽

Kevin Donnelly

Download Full-text

Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domains

Automated Reasoning - Lecture Notes in Computer Science ◽

10.1007/978-3-540-25984-8_17 ◽

2004 ◽

pp. 244-258 ◽

Cited By ~ 5

Author(s):

Ángel J. Gil ◽

Miki Hermann ◽

Gernot Salzer ◽

Bruno Zanuttini

Keyword(s):

Efficient Algorithms

Download Full-text

A Machine-Checked Formalization of the Generic Model and the Random Oracle Model

Automated Reasoning - Lecture Notes in Computer Science ◽

10.1007/978-3-540-25984-8_29 ◽

2004 ◽

pp. 385-399 ◽

Cited By ~ 14

Author(s):

Gilles Barthe ◽

Jan Cederquist ◽

Sabrina Tarento

Keyword(s):

Random Oracle Model ◽

Random Oracle ◽

Generic Model

Download Full-text

Modular Proof Systems for Partial Functions with Weak Equality

Automated Reasoning - Lecture Notes in Computer Science ◽

10.1007/978-3-540-25984-8_10 ◽

2004 ◽

pp. 168-182 ◽

Cited By ~ 7

Author(s):

Harald Ganzinger ◽

Viorica Sofronie-Stokkermans ◽

Uwe Waldmann

Keyword(s):

Partial Functions ◽

Proof Systems

Download Full-text

TaMeD: A Tableau Method for Deduction Modulo

Automated Reasoning - Lecture Notes in Computer Science ◽

10.1007/978-3-540-25984-8_33 ◽

2004 ◽

pp. 445-459 ◽

Cited By ~ 9

Author(s):

Richard Bonichon

Keyword(s):

Tableau Method ◽

Deduction Modulo

Download Full-text

Using Automated Theorem Provers to Certify Auto-generated Aerospace Software

Automated Reasoning - Lecture Notes in Computer Science ◽

10.1007/978-3-540-25984-8_12 ◽

2004 ◽

pp. 198-212 ◽

Cited By ~ 14

Author(s):

Ewen Denney ◽

Bernd Fischer ◽

Johann Schumann

Keyword(s):

Theorem Provers

Download Full-text

System Description: E 0.81

Automated Reasoning - Lecture Notes in Computer Science ◽

10.1007/978-3-540-25984-8_15 ◽

2004 ◽

pp. 223-228 ◽

Cited By ~ 33

Author(s):

Stephan Schulz

Keyword(s):

System Description

Download Full-text

The ICS Decision Procedures for Embedded Deduction

Automated Reasoning - Lecture Notes in Computer Science ◽

10.1007/978-3-540-25984-8_14 ◽

2004 ◽

pp. 218-222 ◽

Cited By ~ 18

Author(s):

Leonardo de Moura ◽

Sam Owre ◽

Harald Rueß ◽

John Rushby ◽

Natarajan Shankar

Keyword(s):

Decision Procedures

Download Full-text

Chain Resolution for the Semantic Web

Automated Reasoning - Lecture Notes in Computer Science ◽

10.1007/978-3-540-25984-8_21 ◽

2004 ◽

pp. 307-320 ◽

Cited By ~ 2

Author(s):

Tanel Tammet

Keyword(s):

Semantic Web

Download Full-text

A Redundancy Criterion Based on Ground Reducibility by Ordered Rewriting

Automated Reasoning - Lecture Notes in Computer Science ◽

10.1007/978-3-540-25984-8_2 ◽

2004 ◽

pp. 45-59

Author(s):

Bernd Löchner

Download Full-text

Automated Reasoning - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Formalizing O Notation in Isabelle/HOL

Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domains

A Machine-Checked Formalization of the Generic Model and the Random Oracle Model

Modular Proof Systems for Partial Functions with Weak Equality

TaMeD: A Tableau Method for Deduction Modulo

Using Automated Theorem Provers to Certify Auto-generated Aerospace Software

System Description: E 0.81

The ICS Decision Procedures for Embedded Deduction

Chain Resolution for the Semantic Web

A Redundancy Criterion Based on Ground Reducibility by Ordered Rewriting

Automated Reasoning - Lecture Notes in Computer Science
Latest Publications