Logic for Programming, Artificial Intelligence, and Reasoning - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642162411, 9783642162428

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

On the Complexity of the Bernays-Schönfinkel Class with Datalog

Logic for Programming, Artificial Intelligence, and Reasoning - Lecture Notes in Computer Science ◽

10.1007/978-3-642-16242-8_14 ◽

2010 ◽

pp. 187-201 ◽

Cited By ~ 3

Author(s):

Witold Charatonik ◽

Piotr Witkowski

Download Full-text

Human and Unhuman Commonsense Reasoning

Logic for Programming, Artificial Intelligence, and Reasoning - Lecture Notes in Computer Science ◽

10.1007/978-3-642-16242-8_3 ◽

2010 ◽

pp. 16-29

Author(s):

Michael J. Maher

Keyword(s):

Commonsense Reasoning

Download Full-text

Partitioning SAT Instances for Distributed Solving

Logic for Programming, Artificial Intelligence, and Reasoning - Lecture Notes in Computer Science ◽

10.1007/978-3-642-16242-8_27 ◽

2010 ◽

pp. 372-386 ◽

Cited By ~ 13

Author(s):

Antti E. J. Hyvärinen ◽

Tommi Junttila ◽

Ilkka Niemelä

Download Full-text

Labelled Unit Superposition Calculi for Instantiation-Based Reasoning

Logic for Programming, Artificial Intelligence, and Reasoning - Lecture Notes in Computer Science ◽

10.1007/978-3-642-16242-8_33 ◽

2010 ◽

pp. 459-473 ◽

Cited By ~ 2

Author(s):

Konstantin Korovin ◽

Christoph Sticksel

Download Full-text

Superposition-Based Analysis of First-Order Probabilistic Timed Automata

Logic for Programming, Artificial Intelligence, and Reasoning - Lecture Notes in Computer Science ◽

10.1007/978-3-642-16242-8_22 ◽

2010 ◽

pp. 302-316 ◽

Cited By ~ 4

Author(s):

Arnaud Fietzke ◽

Holger Hermanns ◽

Christoph Weidenbach

Keyword(s):

Timed Automata ◽

First Order ◽

Probabilistic Timed Automata

Download Full-text

Magically Constraining the Inverse Method Using Dynamic Polarity Assignment

Logic for Programming, Artificial Intelligence, and Reasoning - Lecture Notes in Computer Science ◽

10.1007/978-3-642-16242-8_15 ◽

2010 ◽

pp. 202-216 ◽

Cited By ~ 2

Author(s):

Kaustuv Chaudhuri

Keyword(s):

Inverse Method

Download Full-text

Interpolating Quantifier-Free Presburger Arithmetic

Logic for Programming, Artificial Intelligence, and Reasoning - Lecture Notes in Computer Science ◽

10.1007/978-3-642-16242-8_35 ◽

2010 ◽

pp. 489-503 ◽

Cited By ~ 8

Author(s):

Daniel Kroening ◽

Jérôme Leroux ◽

Philipp Rümmer

Keyword(s):

Presburger Arithmetic

Download Full-text

Generic Methods for Formalising Sequent Calculi Applied to Provability Logic

Logic for Programming, Artificial Intelligence, and Reasoning - Lecture Notes in Computer Science ◽

10.1007/978-3-642-16242-8_19 ◽

2010 ◽

pp. 263-277 ◽

Cited By ~ 6

Author(s):

Jeremy E. Dawson ◽

Rajeev Goré

Keyword(s):

Provability Logic ◽

Sequent Calculi

Download Full-text

On Strong Normalization of the Calculus of Constructions with Type-Based Termination

Logic for Programming, Artificial Intelligence, and Reasoning - Lecture Notes in Computer Science ◽

10.1007/978-3-642-16242-8_24 ◽

2010 ◽

pp. 333-347 ◽

Cited By ~ 5

Author(s):

Benjamin Grégoire ◽

Jorge Luis Sacchini

Keyword(s):

Strong Normalization ◽

Calculus Of Constructions

Download Full-text

SAT Encoding of Unification in $\mathcal{EL}$

Logic for Programming, Artificial Intelligence, and Reasoning - Lecture Notes in Computer Science ◽

10.1007/978-3-642-16242-8_8 ◽

2010 ◽

pp. 97-111 ◽

Cited By ~ 6

Author(s):

Franz Baader ◽

Barbara Morawska

Keyword(s):

Sat Encoding

Download Full-text

Logic for Programming, Artificial Intelligence, and Reasoning - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

On the Complexity of the Bernays-Schönfinkel Class with Datalog

Human and Unhuman Commonsense Reasoning

Partitioning SAT Instances for Distributed Solving

Labelled Unit Superposition Calculi for Instantiation-Based Reasoning

Superposition-Based Analysis of First-Order Probabilistic Timed Automata

Magically Constraining the Inverse Method Using Dynamic Polarity Assignment

Interpolating Quantifier-Free Presburger Arithmetic

Generic Methods for Formalising Sequent Calculi Applied to Provability Logic

On Strong Normalization of the Calculus of Constructions with Type-Based Termination

SAT Encoding of Unification in $\mathcal{EL}$

Logic for Programming, Artificial Intelligence, and Reasoning - Lecture Notes in Computer Science
Latest Publications