Logic Programming - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540439301, 9783540456193

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Probabilistic Finite Domains: A Brief Overview

Logic Programming - Lecture Notes in Computer Science ◽

10.1007/3-540-45619-8_38 ◽

2002 ◽

pp. 475-475 ◽

Cited By ~ 4

Author(s):

Nicos Angelopoulos

Keyword(s):

Finite Domains

Download Full-text

Efficient Real-Time Model Checking Using Tabled Logic Programming and Constraints

Logic Programming - Lecture Notes in Computer Science ◽

10.1007/3-540-45619-8_8 ◽

2002 ◽

pp. 100-114 ◽

Cited By ~ 8

Author(s):

Giridhar Pemmasani ◽

C. R. Ramakrishnan ◽

I. V. Ramakrishnan

Keyword(s):

Model Checking ◽

Logic Programming ◽

Real Time ◽

Time Model

Download Full-text

A Logic-Based System for Application Integration

Logic Programming - Lecture Notes in Computer Science ◽

10.1007/3-540-45619-8_31 ◽

2002 ◽

pp. 452-466 ◽

Cited By ~ 4

Author(s):

Tamás Benkő ◽

Péter Krauth ◽

Péter Szeredi

Keyword(s):

Application Integration

Download Full-text

Logic Databases on the Semantic Web: Challenges and Opportunities

Logic Programming - Lecture Notes in Computer Science ◽

10.1007/3-540-45619-8_2 ◽

2002 ◽

pp. 20-21 ◽

Cited By ~ 1

Author(s):

Stefan Decker

Keyword(s):

Semantic Web ◽

Challenges And Opportunities

Download Full-text

A Different Look at Garbage Collection for the WAM

Logic Programming - Lecture Notes in Computer Science ◽

10.1007/3-540-45619-8_13 ◽

2002 ◽

pp. 179-193 ◽

Cited By ~ 1

Author(s):

Bart Demoen

Keyword(s):

Garbage Collection

Download Full-text

Representing Arithmetic Constraints with Finite Automata: An Overview

Logic Programming - Lecture Notes in Computer Science ◽

10.1007/3-540-45619-8_1 ◽

2002 ◽

pp. 1-20 ◽

Cited By ~ 21

Author(s):

Bernard Boigelot ◽

Pierre Wolper

Keyword(s):

Finite Automata

Download Full-text

Computing Stable Models: Worst-Case Performance Estimates

Logic Programming - Lecture Notes in Computer Science ◽

10.1007/3-540-45619-8_24 ◽

2002 ◽

pp. 347-362 ◽

Cited By ~ 1

Author(s):

Zbigniew Lonc ◽

Mirosław Truszczyński

Keyword(s):

Worst Case ◽

Performance Estimates ◽

Stable Models

Download Full-text

A Purely Logical Account of Sequentiality in Proof Search

Logic Programming - Lecture Notes in Computer Science ◽

10.1007/3-540-45619-8_21 ◽

2002 ◽

pp. 302-316 ◽

Cited By ~ 14

Author(s):

Paola Bruscoli

Keyword(s):

Proof Search

Download Full-text

Proving the Equivalence of CLP Programs

Logic Programming - Lecture Notes in Computer Science ◽

10.1007/3-540-45619-8_20 ◽

2002 ◽

pp. 287-301 ◽

Cited By ~ 8

Author(s):

Sorin Craciunescu

Download Full-text

Logical Loops

Logic Programming - Lecture Notes in Computer Science ◽

10.1007/3-540-45619-8_16 ◽

2002 ◽

pp. 224-238 ◽

Cited By ~ 13

Author(s):

Joachim Schimpf

Download Full-text

Logic Programming - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Probabilistic Finite Domains: A Brief Overview

Efficient Real-Time Model Checking Using Tabled Logic Programming and Constraints

A Logic-Based System for Application Integration

Logic Databases on the Semantic Web: Challenges and Opportunities

A Different Look at Garbage Collection for the WAM

Representing Arithmetic Constraints with Finite Automata: An Overview

Computing Stable Models: Worst-Case Performance Estimates

A Purely Logical Account of Sequentiality in Proof Search

Proving the Equivalence of CLP Programs

Logical Loops

Logic Programming - Lecture Notes in Computer Science
Latest Publications