Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Issue title: Special Issue on the 34th Italian Conference on Computational Logic: CILC 2019
Guest editors: Alberto Casagrande, Eugenio G. Omodeo and Maurizio Proietti
Article type: Research Article
Authors: Costantini, Stefaniaa | Formisano, Andreab; †
Affiliations: [a] DISIM — Università di L’Aquila, via Vetoio Loc. Coppito, I-67010 L’Aquila, Italy. stefania.costantini@univaq.it | [b] DMIF — Università di Udine, via delle Scienze 206, I-33100 Udine, Italy. andrea.formisano@uniud.it
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
DOI: 10.3233/FI-2021-2051
Journal: Fundamenta Informaticae, vol. 181, no. 1, pp. 71-98, 2021
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl