Safe inductions and their applications in knowledge representation

Bart Bogaerts, Joost Vennekens, Marc Denecker

Onderzoeksoutput: Article

2 Citaten (Scopus)


In many knowledge representation formalisms, a constructive semantics is defined based on sequential applications of rules or of a semantic operator. These constructions often share the property that rule applications must be delayed until it is safe to do so: until it is known that the condition that triggers the rule will continue to hold. This intuition occurs for instance in the well-founded semantics of logic programs and in autoepistemic logic. In this paper, we formally define the safety criterion algebraically. We study properties of so-called safe inductions and apply our theory to logic programming and autoepistemic logic. For the latter, we show that safe inductions manage to capture the intended meaning of a class of theories on which all classical constructive semantics fail.

Originele taal-2English
Pagina's (van-tot)167-185
Aantal pagina's19
TijdschriftArtificial Intelligence
StatusPublished - 1 jun 2018
Extern gepubliceerdJa


Duik in de onderzoeksthema's van 'Safe inductions and their applications in knowledge representation'. Samen vormen ze een unieke vingerafdruk.

Citeer dit