Skip to Navigation
Skip to Content
 
Home> Theory and Practice of Logic Programming> Top 10 Most Read Articles

 

Log In

CJO Now Includes:

567,269 articles from 321 leading journals.

Top 10 Most-Read Articles


These are the top 10 most-read articles for this title for the previous month. Most-read rankings are updated on a monthly basis.

  • Subscription Access
  • Free Access
  • Trial Access
  • Full Text HTML as well as PDF Articles Available
  • Note: Abstract, PDF and HTML open in a new window
  Article Description Save / Export / View citation Add to Basket
  Select all
 

Efficient description logic reasoning in Prolog: The DLog system

GERGELY LUKÁCSY and PÉTER SZEREDI

Theory and Practice of Logic Programming, Volume 9, Issue 03, May 2009, pp 343-414
doi: 10.1017/S1471068409003792 (About doi), Published online by Cambridge University Press 02 Jul 2009
 

Introduction to the Special Issue on Logic Programming and the Web

MASSIMO MARCHIORI

Theory and Practice of Logic Programming, Volume 8, Issue 03, May 2008, pp 247-248
doi: 10.1017/S1471068407003341 (About doi), Published online by Cambridge University Press 28 Apr 2008
Subscription Access   

TLP volume 9 issue 1 Cover and Front matter

Theory and Practice of Logic Programming, Volume 9, Issue 01, Jan 2009, pp f1-f2
doi: 10.1017/S1471068409003676 (About doi), Published online by Cambridge University Press 30 Jan 2009
 
Subscription Access   

Justifications for logic programs under answer set semantics

ENRICO PONTELLI, TRAN CAO SON and OMAR ELKHATIB

Theory and Practice of Logic Programming, Volume 9, Issue 01, Jan 2009, pp 1-56
doi: 10.1017/S1471068408003633 (About doi), Published online by Cambridge University Press 30 Jan 2009
 
 

Logic in Computer Science: Modelling and Reasoning about Systems by Michael R. A. Huth and Mark D. Ryan, Cambridge University Press, 2000. ISBN 0521652006, £52.50, $80.00 (hardback), ISBN 0521656028, £9.95, $34.95 (paperback), xviii + 387 pages. http://www.cs.bham.ac.uk/research/lics/

Femke van Raamsdonk

Theory and Practice of Logic Programming, Volume 1, Issue 01, Jan 2001, pp 123-125
doi: 10.1017/S1471068400001083 (About doi), Published online by Cambridge University Press 03 Apr 2001
Subscription Access   

Probabilistic reasoning with answer sets

CHITTA BARAL, MICHAEL GELFOND and NELSON RUSHTON

Theory and Practice of Logic Programming, Volume 9, Issue 01, Jan 2009, pp 57-144
doi: 10.1017/S1471068408003645 (About doi), Published online by Cambridge University Press 30 Jan 2009
 
 

Termination prediction for general logic programs

YI-DONG SHEN, DANNY DE SCHREYE and DEAN VOETS

Theory and Practice of Logic Programming, Volume 9, Issue 06, Nov 2009, pp 751-780
doi: 10.1017/S1471068409990068 (About doi),
Full Text HTML as well as PDF Articles Available

Optimal union-find in Constraint Handling Rules

TOM SCHRIJVERS and THOM FRÜHWIRTH

Theory and Practice of Logic Programming, Volume 6, Issue 1-2, Jan 2006, pp 213-224
doi: 10.1017/S1471068405002541 (About doi), Published online by Cambridge University Press 27 Jan 2006
 

On the cooperation of the constraint domains xs210B, ℛ, and ℱ S1471068409003780_char4 in CFLP

S. ESTÉVEZ-MARTÍN, T. HORTALÁ-GONZÁLEZ, M. RODRÍGUEZ-ARTALEJO, R. DEL VADO-VÍRSEDA, F. SÁENZ-PÉREZ and A. J. FERNÁNDEZ

Theory and Practice of Logic Programming, Volume 9, Issue 04, Jul 2009, pp 415-527
doi: 10.1017/S1471068409003780 (About doi), Published online by Cambridge University Press 21 Jul 2009
 

O(1) reversible tree navigation without cycles

RICHARD A. O'KEEFE

Theory and Practice of Logic Programming, Volume 1, Issue 05, Sep 2001, pp 617-630
doi: 10.1017/S1471068401001065 (About doi), Published online by Cambridge University Press 18 Oct 2001
  Select all
  Article Description Save / Export / View citation Add to Basket

Back to Journal Homepage

Cambridge University Press