Name
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(.). |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-02846-5_2 | ICLP |
Keywords | Field | DocType |
finite domain inference system,classical logic,knowledge base system project,model expansion,logic fo,knowledge base system,model revision,logic programming,lp formalisms asp,model expansion system,logic program,knowledge based system,closed world assumption,formal semantics | Computational logic,Programming language,Autoepistemic logic,Computer science,Description logic,Multimodal logic,Algorithm,Theoretical computer science,Non-monotonic logic,Logic programming,Predicate logic,Higher-order logic | Conference |
Citations | PageRank | References |
1 | 0.37 | 1 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marc Denecker | 1 | 1626 | 106.40 |