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

9783540429579, 9783540456537

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Complexity of Linear Standard Theories

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

10.1007/3-540-45653-8_13 ◽

2007 ◽

pp. 186-200

Author(s):

1Christopher Lynch ◽

Barbara Morawska

Download Full-text

Computational Space Efficiency and Minimal Model Generation for Guarded Formulae

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

10.1007/3-540-45653-8_6 ◽

2001 ◽

pp. 85-99 ◽

Cited By ~ 9

Author(s):

Lilia Georgieva ◽

Ullrich Hustadt ◽

Renate A. Schmidt

Keyword(s):

Minimal Model ◽

Model Generation ◽

Space Efficiency

Download Full-text

Tableaux for Reasoning about Atomic Updates

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

10.1007/3-540-45653-8_44 ◽

2001 ◽

pp. 639-653

Author(s):

Christian G. Fermüller ◽

Georg Moser ◽

Richard Zach

Download Full-text

How to Transform an Analyzer into a Verifier

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

10.1007/3-540-45653-8_41 ◽

2001 ◽

pp. 595-609 ◽

Cited By ~ 1

Author(s):

Marco Comini ◽

Roberta Gori ◽

Giorgio Levi

Download Full-text

Efficient Computation of the Well-Founded Model Using Update Propagation

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

10.1007/3-540-45653-8_29 ◽

2001 ◽

pp. 422-437

Author(s):

Andreas Behrend

Keyword(s):

Efficient Computation ◽

Update Propagation

Download Full-text

Intuitionistic Multiplicative Proof Nets as Models of Directed Acyclic Graph Descriptions

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

10.1007/3-540-45653-8_16 ◽

2001 ◽

pp. 233-248 ◽

Cited By ~ 2

Author(s):

Guy Perrier

Keyword(s):

Directed Acyclic Graph ◽

Acyclic Graph ◽

Proof Nets

Download Full-text

Certifying Synchrony for Free

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

10.1007/3-540-45653-8_34 ◽

2001 ◽

pp. 495-506 ◽

Cited By ~ 3

Author(s):

Sylvain Boulmé ◽

Grégoire Hamon

Download Full-text

Herbrand’s Theorem for Prenex Gödel Logic and Its Consequences for Theorem Proving

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

10.1007/3-540-45653-8_14 ◽

2001 ◽

pp. 201-216 ◽

Cited By ~ 18

Author(s):

Matthias Baaz ◽

Agata Ciabattoni ◽

Christian G. Fermüller

Keyword(s):

Theorem Proving ◽

Gödel Logic ◽

Herbrand’S Theorem ◽

Herbrand's Theorem

Download Full-text

Operational Semantics for Fixed-Point Logics on Constraint Databases

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

10.1007/3-540-45653-8_32 ◽

2001 ◽

pp. 470-484 ◽

Cited By ~ 3

Author(s):

Stephan Kreutzer

Keyword(s):

Fixed Point ◽

Operational Semantics ◽

Constraint Databases

Download Full-text

Coherent Composition of Distributed Knowledge-Bases through Abduction

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

10.1007/3-540-45653-8_43 ◽

2001 ◽

pp. 624-638 ◽

Cited By ~ 3

Author(s):

Ofer Arieli ◽

Bert Van Nuffelen ◽

Marc Denecker ◽

Maurice Bruynooghe

Keyword(s):

Knowledge Bases ◽

Distributed Knowledge

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

Complexity of Linear Standard Theories

Computational Space Efficiency and Minimal Model Generation for Guarded Formulae

Tableaux for Reasoning about Atomic Updates

How to Transform an Analyzer into a Verifier

Efficient Computation of the Well-Founded Model Using Update Propagation

Intuitionistic Multiplicative Proof Nets as Models of Directed Acyclic Graph Descriptions

Certifying Synchrony for Free

Herbrand’s Theorem for Prenex Gödel Logic and Its Consequences for Theorem Proving

Operational Semantics for Fixed-Point Logics on Constraint Databases

Coherent Composition of Distributed Knowledge-Bases through Abduction

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