2014/04/25 by Bart Bogaerts, Bogaerts, Bart, Joost Vennekens +5
Computer Science · #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #Semantic Web and Ontologies #cs.LO
paper · pdf · doi:10.48550/arxiv.1404.6368
The paper appears in the Proceedings of the 15th International Workshop on Non-Monotonic Reasoning (NMR 2014)
arxiv created 2014/04/25 · openalex publication_date 2014/04/25 · arxiv updated 2014/04/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 a prototype of this transformation, and thus present the first system to perform inference in FO(C). We also provide results about the complexity of reasoning in FO(C).