Carlo Zaniolo Key Constraints and Monotonic Aggregates in Deductive Databases. [Citation Graph (0, 0)][DBLP] Computational Logic: Logic Programming and Beyond, 2002, pp:109-134 [Conf]

Krysia Broda A Decidable CLDS for Some Propositional Resource Logics. [Citation Graph (0, 0)][DBLP] Computational Logic: Logic Programming and Beyond, 2002, pp:135-159 [Conf]

Alan Bundy A Critique of Proof Planning. [Citation Graph (0, 0)][DBLP] Computational Logic: Logic Programming and Beyond, 2002, pp:160-177 [Conf]

Jörg H. Siekmann, Graham Wrightson An Open Research Problem: Strong Completeness of R. Kowalski's Connection Graph Proof Procedure. [Citation Graph (0, 0)][DBLP] Computational Logic: Logic Programming and Beyond, 2002, pp:231-252 [Conf]

Henry Prakken, Giovanni Sartor The Role of Logic in Computational Models of Legal Argument: A Critical Survey. [Citation Graph (0, 0)][DBLP] Computational Logic: Logic Programming and Beyond, 2002, pp:342-381 [Conf]

James Cussens Issues in Learning Language in Logic. [Citation Graph (0, 0)][DBLP] Computational Logic: Logic Programming and Beyond, 2002, pp:491-505 [Conf]

Verónica Dahl On Implicit Meanings. [Citation Graph (0, 0)][DBLP] Computational Logic: Logic Programming and Beyond, 2002, pp:506-525 [Conf]

Luc De Raedt Data Mining as Constraint Logic Programming. [Citation Graph (0, 0)][DBLP] Computational Logic: Logic Programming and Beyond, 2002, pp:526-547 [Conf]

Chris Mellish DCGs: Parsing as Deduction? [Citation Graph (0, 0)][DBLP] Computational Logic: Logic Programming and Beyond, 2002, pp:548-566 [Conf]

Donald Gillies Logicism and the Development of Computer Science. [Citation Graph (0, 0)][DBLP] Computational Logic: Logic Programming and Beyond, 2002, pp:588-604 [Conf]

Stathis Psillos Simply the Best: A Case for Abduction. [Citation Graph (0, 0)][DBLP] Computational Logic: Logic Programming and Beyond, 2002, pp:605-626 [Conf]

NOTICE1

System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2

The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP