Automated Deduction in Classical and Non-Classical Logics - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540671909, 9783540465089

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Higher-Order Modal Logic—A Sketch

Automated Deduction in Classical and Non-Classical Logics - Lecture Notes in Computer Science ◽

10.1007/3-540-46508-1_2 ◽

2000 ◽

pp. 23-38 ◽

Cited By ~ 2

Author(s):

Melvin Fitting

Keyword(s):

Modal Logic ◽

Higher Order

Download Full-text

Decision Procedures and Model Building or How to Improve Logical Information in Automated Deduction

Automated Deduction in Classical and Non-Classical Logics - Lecture Notes in Computer Science ◽

10.1007/3-540-46508-1_4 ◽

2000 ◽

pp. 62-79 ◽

Cited By ~ 1

Author(s):

Alexander Leitsch

Keyword(s):

Model Building ◽

Decision Procedures ◽

Automated Deduction ◽

Logical Information

Download Full-text

Full First-Order Sequent and Tableau Calculi With Preservation of Solutions and the Liberalized δ-Rule but Without Skolemization

Automated Deduction in Classical and Non-Classical Logics - Lecture Notes in Computer Science ◽

10.1007/3-540-46508-1_19 ◽

2000 ◽

pp. 282-297

Author(s):

Claus-Peter Wirth

Keyword(s):

First Order ◽

Tableau Calculi

Download Full-text

Hidden Congruent Deduction

Automated Deduction in Classical and Non-Classical Logics - Lecture Notes in Computer Science ◽

10.1007/3-540-46508-1_17 ◽

2000 ◽

pp. 251-266 ◽

Cited By ~ 6

Author(s):

Grigore Roşu ◽

Joseph Goguen

Download Full-text

Effective Properties of Some First Order Intuitionistic Modal Logics

Automated Deduction in Classical and Non-Classical Logics - Lecture Notes in Computer Science ◽

10.1007/3-540-46508-1_16 ◽

2000 ◽

pp. 236-250

Author(s):

Aida Pliuškevičienė

Keyword(s):

Effective Properties ◽

Modal Logics ◽

First Order ◽

Intuitionistic Modal Logics

Download Full-text

Completeness and Redundancy in Constrained Clause Logic

Automated Deduction in Classical and Non-Classical Logics - Lecture Notes in Computer Science ◽

10.1007/3-540-46508-1_15 ◽

2000 ◽

pp. 221-235 ◽

Cited By ~ 2

Author(s):

Reinhard Pichler

Download Full-text

A Further and Effective Liberalization of the δ-Rule in Free Variable Semantic Tableaux

Automated Deduction in Classical and Non-Classical Logics - Lecture Notes in Computer Science ◽

10.1007/3-540-46508-1_7 ◽

2000 ◽

pp. 109-125 ◽

Cited By ~ 1

Author(s):

Domenico Cantone ◽

Marianna Nicolosi Asmundo

Keyword(s):

Free Variable ◽

Semantic Tableaux

Download Full-text

An $$ \mathcal{O} $$ ((n · log n)3)-Time Transformation from Grz into Decidable Fragments of Classical First-Order Logic

Automated Deduction in Classical and Non-Classical Logics - Lecture Notes in Computer Science ◽

10.1007/3-540-46508-1_10 ◽

2000 ◽

pp. 152-166 ◽

Cited By ~ 1

Author(s):

Stéphane Demri ◽

Rajeev Goré

Keyword(s):

Order Logic ◽

First Order Logic ◽

Time Transformation ◽

First Order

Download Full-text

Resolution-Based Theorem Proving for SH n-Logics

Automated Deduction in Classical and Non-Classical Logics - Lecture Notes in Computer Science ◽

10.1007/3-540-46508-1_18 ◽

2000 ◽

pp. 267-281

Author(s):

Viorica Sofronie-Stokkermans

Keyword(s):

Theorem Proving

Download Full-text

Extending Decidable Clause Classes via Constraints

Automated Deduction in Classical and Non-Classical Logics - Lecture Notes in Computer Science ◽

10.1007/3-540-46508-1_14 ◽

2000 ◽

pp. 206-220

Author(s):

Reinhard Pichler

Download Full-text

Automated Deduction in Classical and Non-Classical Logics - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Higher-Order Modal Logic—A Sketch

Decision Procedures and Model Building or How to Improve Logical Information in Automated Deduction

Full First-Order Sequent and Tableau Calculi With Preservation of Solutions and the Liberalized δ-Rule but Without Skolemization

Hidden Congruent Deduction

Effective Properties of Some First Order Intuitionistic Modal Logics

Completeness and Redundancy in Constrained Clause Logic

A Further and Effective Liberalization of the δ-Rule in Free Variable Semantic Tableaux

An $$ \mathcal{O} $$ ((n · log n)3)-Time Transformation from Grz into Decidable Fragments of Classical First-Order Logic

Resolution-Based Theorem Proving for SH n-Logics

Extending Decidable Clause Classes via Constraints

Automated Deduction in Classical and Non-Classical Logics - Lecture Notes in Computer Science
Latest Publications