Logic, Language, Information and Computation - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642326202, 9783642326219

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Admissible Rules: From Characterizations to Applications

Logic, Language, Information and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-642-32621-9_4 ◽

2012 ◽

pp. 56-69 ◽

Cited By ~ 3

Author(s):

George Metcalfe

Keyword(s):

Admissible Rules

Download Full-text

A Logic of Plausible Justifications

Logic, Language, Information and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-642-32621-9_23 ◽

2012 ◽

pp. 306-320 ◽

Cited By ~ 2

Author(s):

L. Menasché Schechter

Download Full-text

A Tight Upper Bound on the Number of Variables for Average-Case k-Clique on Ordered Graphs

Logic, Language, Information and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-642-32621-9_21 ◽

2012 ◽

pp. 282-290

Author(s):

Benjamin Rossman

Keyword(s):

Upper Bound ◽

Average Case ◽

Ordered Graphs

Download Full-text

Polynomial-Time Solution of Initial Value Problems Using Polynomial Enclosures

Logic, Language, Information and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-642-32621-9_17 ◽

2012 ◽

pp. 232-245

Author(s):

Amin Farjudian

Keyword(s):

Polynomial Time ◽

Initial Value Problems ◽

Initial Value ◽

Time Solution

Download Full-text

Linearizing Bad Sequences: Upper Bounds for the Product and Majoring Well Quasi-orders

Logic, Language, Information and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-642-32621-9_9 ◽

2012 ◽

pp. 110-126 ◽

Cited By ~ 3

Author(s):

Sergio Abriola ◽

Santiago Figueira ◽

Gabriel Senno

Keyword(s):

Upper Bounds

Download Full-text

Moving Arrows and Four Model Checking Results

Logic, Language, Information and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-642-32621-9_11 ◽

2012 ◽

pp. 142-153 ◽

Cited By ~ 16

Author(s):

Carlos Areces ◽

Raul Fervari ◽

Guillaume Hoffmann

Keyword(s):

Model Checking

Download Full-text

Quantifying Notes

Logic, Language, Information and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-642-32621-9_8 ◽

2012 ◽

pp. 89-109 ◽

Cited By ~ 3

Author(s):

Hans van Ditmarsch

Download Full-text

Logical Methods in Quantum Information Theory

Logic, Language, Information and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-642-32621-9_7 ◽

2012 ◽

pp. 88-88

Author(s):

Peter Selinger

Keyword(s):

Information Theory ◽

Quantum Information ◽

Quantum Information Theory

Download Full-text

Classic-Like Cut-Based Tableau Systems for Finite-Valued Logics

Logic, Language, Information and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-642-32621-9_24 ◽

2012 ◽

pp. 321-335 ◽

Cited By ~ 1

Author(s):

Marco Volpe ◽

João Marcos ◽

Carlos Caleiro

Keyword(s):

Tableau Systems

Download Full-text

Standard Completeness for Extensions of MTL: An Automated Approach

Logic, Language, Information and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-642-32621-9_12 ◽

2012 ◽

pp. 154-167 ◽

Cited By ~ 5

Author(s):

Paolo Baldi ◽

Agata Ciabattoni ◽

Lara Spendier

Keyword(s):

Standard Completeness

Download Full-text

Logic, Language, Information and Computation - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Admissible Rules: From Characterizations to Applications

A Logic of Plausible Justifications

A Tight Upper Bound on the Number of Variables for Average-Case k-Clique on Ordered Graphs

Polynomial-Time Solution of Initial Value Problems Using Polynomial Enclosures

Linearizing Bad Sequences: Upper Bounds for the Product and Majoring Well Quasi-orders

Moving Arrows and Four Model Checking Results

Quantifying Notes

Logical Methods in Quantum Information Theory

Classic-Like Cut-Based Tableau Systems for Finite-Valued Logics

Standard Completeness for Extensions of MTL: An Automated Approach

Logic, Language, Information and Computation - Lecture Notes in Computer Science
Latest Publications