Automated Reasoning - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540422549, 9783540457442

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

The Hybrid μ-Calculus

Automated Reasoning - Lecture Notes in Computer Science ◽

10.1007/3-540-45744-5_7 ◽

2001 ◽

pp. 76-91 ◽

Cited By ~ 33

Author(s):

Ulrike Sattler ◽

Moshe Y. Vardi

Download Full-text

JProver: Integrating Connection-Based Theorem Proving into Interactive Proof Assistants

Automated Reasoning - Lecture Notes in Computer Science ◽

10.1007/3-540-45744-5_34 ◽

2001 ◽

pp. 421-426 ◽

Cited By ~ 19

Author(s):

Stephan Schmitt ◽

Lori Lorigo ◽

Christoph Kreitz ◽

Aleksey Nogin

Keyword(s):

Theorem Proving ◽

Proof Assistants ◽

Interactive Proof

Download Full-text

Combination of Distributed Search and Multi-Search in Peers-mcd.d

Automated Reasoning - Lecture Notes in Computer Science ◽

10.1007/3-540-45744-5_37 ◽

2001 ◽

pp. 448-452 ◽

Cited By ~ 3

Author(s):

Maria Paola Bonacina

Keyword(s):

Distributed Search

Download Full-text

System Description: RDL Rewrite and Decision Procedure Laboratory

Automated Reasoning - Lecture Notes in Computer Science ◽

10.1007/3-540-45744-5_54 ◽

2001 ◽

pp. 663-669 ◽

Cited By ~ 4

Author(s):

Alessandro Armando ◽

Luca Compagna ◽

Silvio Ranise

Keyword(s):

Decision Procedure ◽

System Description

Download Full-text

System Abstract: E 0.61

Automated Reasoning - Lecture Notes in Computer Science ◽

10.1007/3-540-45744-5_28 ◽

2001 ◽

pp. 370-375 ◽

Cited By ~ 4

Author(s):

Stephan Schulz

Download Full-text

The modprof Theorem Prover

Automated Reasoning - Lecture Notes in Computer Science ◽

10.1007/3-540-45744-5_39 ◽

2001 ◽

pp. 459-463 ◽

Cited By ~ 1

Author(s):

Jens Happe

Keyword(s):

Theorem Prover

Download Full-text

Instructing Equational Set-Reasoning with Otter

Automated Reasoning - Lecture Notes in Computer Science ◽

10.1007/3-540-45744-5_12 ◽

2001 ◽

pp. 152-167 ◽

Cited By ~ 8

Author(s):

Andrea Formisano ◽

Eugenio G. Omodeo ◽

Marco Temperini

Download Full-text

lolliCoP — A Linear Logic Implementation of a Lean Connection-Method Theorem Prover for First-Order Classical Logic

Automated Reasoning - Lecture Notes in Computer Science ◽

10.1007/3-540-45744-5_55 ◽

2001 ◽

pp. 670-684 ◽

Cited By ~ 2

Author(s):

Joshua S. ◽

Naoyuki Tamura

Keyword(s):

Classical Logic ◽

Linear Logic ◽

Theorem Prover ◽

First Order ◽

Connection Method

Download Full-text

Bunched Logic Programming

Automated Reasoning - Lecture Notes in Computer Science ◽

10.1007/3-540-45744-5_21 ◽

2001 ◽

pp. 289-304 ◽

Cited By ~ 4

Author(s):

Pablo A. Armelín ◽

David J. Pym

Keyword(s):

Logic Programming

Download Full-text

Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems

Automated Reasoning - Lecture Notes in Computer Science ◽

10.1007/3-540-45744-5_42 ◽

2001 ◽

pp. 485-498 ◽

Cited By ~ 7

Author(s):

Xavier Urbain

Keyword(s):

Term Rewriting ◽

Term Rewriting Systems ◽

Rewriting Systems ◽

Termination Proofs

Download Full-text

Automated Reasoning - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

The Hybrid μ-Calculus

JProver: Integrating Connection-Based Theorem Proving into Interactive Proof Assistants

Combination of Distributed Search and Multi-Search in Peers-mcd.d

System Description: RDL Rewrite and Decision Procedure Laboratory

System Abstract: E 0.61

The modprof Theorem Prover

Instructing Equational Set-Reasoning with Otter

lolliCoP — A Linear Logic Implementation of a Lean Connection-Method Theorem Prover for First-Order Classical Logic

Bunched Logic Programming

Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems

Automated Reasoning - Lecture Notes in Computer Science
Latest Publications