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

9783540305538, 9783540316503

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

The nomore + + Approach to Answer Set Solving

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

10.1007/11591191_8 ◽

2005 ◽

pp. 95-109 ◽

Cited By ~ 16

Author(s):

Christian Anger ◽

Martin Gebser ◽

Thomas Linke ◽

André Neumann ◽

Torsten Schaub

Keyword(s):

Answer Set

Download Full-text

Computational Issues in Exploiting Dependent And-Parallelism in Logic Programming: Leftness Detection in Dynamic Search Trees

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

10.1007/11591191_7 ◽

2005 ◽

pp. 79-94

Author(s):

Yao Wu ◽

Enrico Pontelli ◽

Desh Ranjan

Keyword(s):

Logic Programming ◽

Search Trees ◽

Dynamic Search

Download Full-text

Incremental Integrity Checking: Limitations and Possibilities

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

10.1007/11591191_49 ◽

2005 ◽

pp. 712-727 ◽

Cited By ~ 4

Author(s):

Henning Christiansen ◽

Davide Martinenghi

Keyword(s):

Integrity Checking

Download Full-text

Zap: Automated Theorem Proving for Software Analysis

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

10.1007/11591191_2 ◽

2005 ◽

pp. 2-22 ◽

Cited By ~ 12

Author(s):

Thomas Ball ◽

Shuvendu K. Lahiri ◽

Madanlal Musuvathi

Keyword(s):

Theorem Proving ◽

Automated Theorem Proving ◽

Software Analysis

Download Full-text

Recursive Path Orderings Can Also Be Incremental

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

10.1007/11591191_17 ◽

2005 ◽

pp. 230-245 ◽

Cited By ~ 1

Author(s):

Mirtha-Lina Fernández ◽

Guillem Godoy ◽

Albert Rubio

Keyword(s):

Recursive Path

Download Full-text

Concepts of Automata Construction from LTL

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

10.1007/11591191_50 ◽

2005 ◽

pp. 728-742 ◽

Cited By ~ 8

Author(s):

Carsten Fritz

Download Full-text

Algebraic Intruder Deductions

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

10.1007/11591191_38 ◽

2005 ◽

pp. 549-564 ◽

Cited By ~ 10

Author(s):

David Basin ◽

Sebastian Mödersheim ◽

Luca Viganò

Download Full-text

Comparative Similarity, Tree Automata, and Diophantine Equations

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

10.1007/11591191_45 ◽

2005 ◽

pp. 651-665 ◽

Cited By ~ 7

Author(s):

Mikhail Sheremet ◽

Dmitry Tishkovsky ◽

Frank Wolter ◽

Michael Zakharyaschev

Keyword(s):

Diophantine Equations ◽

Tree Automata ◽

Comparative Similarity

Download Full-text

Towards Automated Proof Support for Probabilistic Distributed Systems

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

10.1007/11591191_37 ◽

2005 ◽

pp. 534-548 ◽

Cited By ~ 10

Author(s):

Annabelle K. McIver ◽

Tjark Weber

Keyword(s):

Distributed Systems ◽

Automated Proof

Download Full-text

On Confluence of Infinitary Combinatory Reduction Systems

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

10.1007/11591191_15 ◽

2005 ◽

pp. 199-214 ◽

Cited By ~ 5

Author(s):

Jeroen Ketema ◽

Jakob Grue Simonsen

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

The nomore + + Approach to Answer Set Solving

Computational Issues in Exploiting Dependent And-Parallelism in Logic Programming: Leftness Detection in Dynamic Search Trees

Incremental Integrity Checking: Limitations and Possibilities

Zap: Automated Theorem Proving for Software Analysis

Recursive Path Orderings Can Also Be Incremental

Concepts of Automata Construction from LTL

Algebraic Intruder Deductions

Comparative Similarity, Tree Automata, and Diophantine Equations

Towards Automated Proof Support for Probabilistic Distributed Systems

On Confluence of Infinitary Combinatory Reduction Systems

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