Efficient description logic reasoning in Prolog: The DLog system

DOI10.1017/S1471068409003792zbMath1179.68024MaRDI QIDQ3393230

Gergely Lukácsy, Péter Szeredi

Publication date: 19 August 2009

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

zbMATH Keywords

description logicDL reasonerDLog

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Logic programming (68N17)

Related Items

Tractable approximate deduction for OWL ⋮ Prolog Technology Reinforcement Learning Prover ⋮ Tableau reasoning for description logics and its extension to probabilities ⋮ Probabilistic DL Reasoning with Pinpointing Formulas: A Prolog-based Approach ⋮ The Fusemate logic programming system ⋮ Prolog Based Description Logic Reasoning

Uses Software

• Pellet
• Racer
• KAON2
• DLog

Cites Work

• A structure-preserving clause form translation
• A Prolog technology theorem prover: A new exposition and implementation in Prolog
• Theorem proving with ordering and equality constrained clauses
• Well-founded and stationary models of logic programs
• Linear resolution with selection function
• Translating OWL and semantic web rules into prolog: Moving toward description logic programs
• Compile-time derivation of variable dependency using abstract interpretation
• The execution algorithm of mercury, an efficient purely declarative logic programming language

This page was built for publication: Efficient description logic reasoning in Prolog: The DLog system