We present a Logic Programming prototype implementation working as proof-of-concept for a unified strategy proposed in our past research to solve several non-standard reasoning problems in Description Logics (DLs), denoted by Constructive Reasoning. In order to proof both the problem-independence and the logic-independence of the adopted approach, the prototype is focused on the solution of three different problems - namely Least Common Subsumer, Concept Abduction and Concept Difference - and two different, though simple, DLs, i.e., εL and ALN. Accordingly to the implemented strategy, problems are formalized as conjunction of both subsumption and non-subsumption statements, causing the whole prototype to rely on a Prolog program solving subsumption. The program is built around a predicate, which on the one hand checks for the existence of subsumption relations between ground elements, providing boolean answers, and on the other hand, if inverted, exploits Prolog built-in unification to enumerate variable values making subsumption true between concept terms containing concept variables.

Using prolog unification to solve non-standard reasoning problems in description logics / Colucci, Simona; Donini, Francesco M.. - ELETTRONICO. - 857:(2012), pp. 32-46. (Intervento presentato al convegno 9th Italian Convention on Computational Logic, CILC 2012 tenutosi a Roma, Italy nel June 6-7, 2012).

Using prolog unification to solve non-standard reasoning problems in description logics

COLUCCI, Simona;
2012-01-01

Abstract

We present a Logic Programming prototype implementation working as proof-of-concept for a unified strategy proposed in our past research to solve several non-standard reasoning problems in Description Logics (DLs), denoted by Constructive Reasoning. In order to proof both the problem-independence and the logic-independence of the adopted approach, the prototype is focused on the solution of three different problems - namely Least Common Subsumer, Concept Abduction and Concept Difference - and two different, though simple, DLs, i.e., εL and ALN. Accordingly to the implemented strategy, problems are formalized as conjunction of both subsumption and non-subsumption statements, causing the whole prototype to rely on a Prolog program solving subsumption. The program is built around a predicate, which on the one hand checks for the existence of subsumption relations between ground elements, providing boolean answers, and on the other hand, if inverted, exploits Prolog built-in unification to enumerate variable values making subsumption true between concept terms containing concept variables.
2012
9th Italian Convention on Computational Logic, CILC 2012
Using prolog unification to solve non-standard reasoning problems in description logics / Colucci, Simona; Donini, Francesco M.. - ELETTRONICO. - 857:(2012), pp. 32-46. (Intervento presentato al convegno 9th Italian Convention on Computational Logic, CILC 2012 tenutosi a Roma, Italy nel June 6-7, 2012).
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11589/103858
Citazioni
  • Scopus 0
  • ???jsp.display-item.citation.isi??? ND
social impact