Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/18572
Title: | Inference in the FO(C) modelling language | Authors: | Bogaerts, Bart Vennekens, Joost Denecker, Marc VAN DEN BUSSCHE, Jan |
Issue Date: | 2014 | Source: | Schaub, T. (Ed.). ECAI 2014 - 21st European Conference on Artificial Intelligence, p. 111-116 | Series/Report: | Frontiers in Artificial Intelligence and Applications | Series/Report no.: | 263 | Abstract: | Recently, FO(C), the integration of C-LOG with classical logic, was introduced as a knowledge representation language. Up to this point, no systems exist that perform inference on FO(C), and very little is known about properties of inference in FO(C). In this paper, we study both of the above problems. We define normal forms for FO(C), one of which corresponds to FO(ID). We define transformations between these normal forms, and show that, using these transformations, several inference tasks for FO(C) can be reduced to inference tasks for FO(ID), for which solvers exist. We implemented this transformation and hence, created the first system that performs inference in FO(C). We also provide results about the complexity of reasoning in FO(C). | Document URI: | http://hdl.handle.net/1942/18572 | Link to publication/dataset: | http://alpha.uhasselt.be/jan.vandenbussche/FAIA263-0111.pdf | ISBN: | 978-1-61499-418-3 | DOI: | 10.3233/978-1-61499-419-0-111 | ISI #: | 000349444700020 | Rights: | © 2014 The Authors and IOS Press. This article is published online with Open Access by IOS Press and distributed under the terms of the Creative Commons Attribution Non-Commercial License. | Category: | C1 | Type: | Proceedings Paper | Validations: | ecoom 2016 |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
FAIA263-0111.pdf | Published version | 242.44 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.