INFERENCE SYSTEM TO ACHIEVE SATURATION OF (F, R, N) KNOWLEDGE BASES

Andrei ZAMFIRA, Horia CIOCARLIE

Abstract


This article aims to present a system for making inference (derivation) on any logical knowledge base with the goal to achieve its saturation. Typical knowledge bases from literature are comprised of facts and deduction rules. In our work was considered an extra layer of this ontology: the one of constraints. So, in our case, the KB is a triple: (F,R,N). The concrete implementation of the system for derivation was made in the object-oriented language C#. The KB is represented in OO environment as a collection of objects of classes corresponding to each type of knowledge. The system takes at input the knowledge base (in OO representation), applies the derivation algorithm and produces at output the saturated set of facts. The testing was done on three types of KBs: small, medium and large. Results and comparisons are presented to the reader in tabular form.


Full Text:

PDF

References


A.Abdallah, Formalizing and Studying Dialectical Explanations in Inconsistent Knowledge Bases Phd Thesis, Universite de La Rochelle, October 2016.

J.F.Baget, M.Leclre, M.Mugnier, E.Salvat, On Rules with Existential Variables: Walking the Decidability Line, Artificial Intelligence, vol.175, pp.1620-1654.

A.Cali, G.Gottlob, M.Kifer, Taming the Infinite Chase: Query Answering under Expressive Relational Constraints, Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning (2008), pp.70-80.

S.Ceri, G.Gottlob, L.Tanca, What You Always Wanted to Know about Datalog, IEEE Transactions on Knowledge and Data Engineering (1989)

S.Ceri, G.Gottlob, L.Tanca, Logic Programming and Databases, Science and Business Media, Springer (2012).

M.Croitoru, S.Vesic, What can Argumentation do for Inconsistent Ontology Query Answering?, Proceedings of the International Conference on Scalable Uncertainty Management, pp.15-29, Springer (2013).

A.Deutsch, A.Nash, J.Rammel, The Chase Revisited, Proceedings of the 27th ACM-SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, ACM 2008, pp.149-158.

P.M.Dung, On the Acceptability of Arguments and its Fundamental Role in Non-monotonic Reasoning, Logic Programming and n-Person Games, Artificial Intelligence, vol.77, pp.321-357, (1995).

D.Lembo, M.Lenzerini, R.Rosatti, D.Savo, Inconsistency-Tolerant Semantics for Description Logics, Proceedings of the International Conference on Web Reasoning and Rule Systems, pp.103-117, Springer-Verlag (2010).

B.Marnette, Generalized Schema Mappings: from Termination to Tractability, Proceedings of the 28th ACM-SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, ACM 2009, pp.13-22.

A.Poggi, D.Lembo, D.Calvanese, G. De Giacomo, M.Lenzerini,

Linking Data to Ontologies, Journal on Data Semantics X, pp.133-173, Springer (2008).

DROOLS.NET: https://sourceforge.net/projects/drooldotnet/

SimpleRules.NET: https://www.codeproject.com/Articles/1181151/SimpleRules-Net-Easy-to-use-Rules-Engine

NRules: https://github.com/NRules/NRules/wiki

NxBRE: https://sourceforge.net/projects/nxbre/


Refbacks

  • There are currently no refbacks.


JOURNAL INDEXED IN :