论文信息 - TANCS-2000 Results for DLP

TANCS-2000 Results for DLP

DLP is an experimental description logic system that can also be used as a satisfiability checker for propositional modal logics. DLP incorporates a number of effective optimizations that, taken together, produce a very fast reasoner. DLP was run on several problem categories in the TANCS-2000 comparison with very gratifying results.

Peter F. Patel-Schneider | P. Patel-Schneider

[1] Peter F. Patel-Schneider,et al. FaCT and DLP , 1998, TABLEAUX.

[2] Fausto Giunchiglia,et al. Building Decision Procedures for Modal Logics from Propositional Decision Procedure - The Case Study of Modal K , 1996, CADE.

[3] Jon W. Freeman. Hard Random 3-SAT Problems and the Davis-Putnam Procedure , 1996, Artif. Intell..

[4] Roy Dyckhoff. Automated Reasoning with Analytic Tableaux and Related Methods , 2000, Lecture Notes in Computer Science.

[5] Peter F. Patel-Schneider,et al. DLP System Description , 1998, Description Logics.

[6] Peter F. Patel-Schneider,et al. Optimising Propositional Modal Satisfiability for Description Logic Subsumption , 1998, AISC.

[7] Matthew L. Ginsberg,et al. Dynamic Backtracking , 1993, J. Artif. Intell. Res..

[8] M. A. McRobbie,et al. Automated Deduction — Cade-13 , 1996, Lecture Notes in Computer Science.

[9] Ian Horrocks,et al. Using an Expressive Description Logic: FaCT or Fiction? , 1998, KR.