Abstract
This talk reports on a project to build a Knowledge Base System (KBS) equipped with several forms of inference able to solve different sorts of tasks using the KB. The logic FO(.) used in the KBS is an extension of classical logic (FO) with various language primitives such as inductive definitions, aggregates, arithmetic, etc. The logic is a natural integration (and further extension) of classical logic and logic programming, and is based on the view of a logic program as a definition. We discuss informal and formal semantics of definitions in FO(.) and consider the relationship with other knowledge principles such as coinduction, the closed world assumption and causality and with the LP formalisms ASP, ALP and deductive databases. On the computational level, we will report on current attempts to build finite domain inference systems for model expansion, approximate reasoning, theory debugging and model revision, with special focus on the IDP-system, a model expansion system for FO(.).
Chapter PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Denecker, M. (2009). A Knowledge Base System Project for FO(.). In: Hill, P.M., Warren, D.S. (eds) Logic Programming. ICLP 2009. Lecture Notes in Computer Science, vol 5649. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02846-5_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-02846-5_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02845-8
Online ISBN: 978-3-642-02846-5
eBook Packages: Computer ScienceComputer Science (R0)