Affiliations: [a] DISIM — Università di L’Aquila, via Vetoio Loc. Coppito, I-67010 L’Aquila, Italy. [email protected] | [b] DMIF — Università di Udine, via delle Scienze 206, I-33100 Udine, Italy. [email protected]
Correspondence:
[†]
Address for correspondence: DMIF, Università di Udine, via delle Scienze 206, I-33100 Udine, Italy
Note: [*] Partially supported by INdAM-GNCS-20 project NoRMA and by Action COST CA17124 “DigForASP”. This paper includes revised and extended material from papers [1, 2]. The authors are members of INdAM Research group GNCS.
Abstract: In this paper we present a methodology for introducing customizable metalogic features in logic-based knowledge representation and reasoning languages. The proposed approach is based on concepts of introspection and reflection previously introduced and discussed by various authors in relevant literature. This allows a knowledge engineer to specify enhanced reasoning engines by defining properties and meta-properties of relations as expressible for instance in OWL. We employ meta-level axiom schemata based upon a naming (reification) device. We propose general principles for extending the semantics of “host” formalisms accordingly. Consequently, suitable pre-defined libraries of properties can be made available, while user-defined new schemata are also allowed. We make the specific cases of Answer Set Programming (ASP) and Datalog±, where such features may be part of software engineering toolkits for these programming paradigms. On the one hand, concerning ASP, we extend the programming principles and practice to accommodate the proposed methodology, so as to perform meta-reasoning within the plain ASP semantics. The computational complexity of the resulting framework does not change. On the other hand, we show how metalogic features can significantly enrich Datalog± with minor changes to its operational semantics (provided in terms of “chase”) and, also in this case, no additional complexity burden.
Keywords: Meta-reasoning, Answer Set Programming, Datalog±, Web-ontologies
