Skip to main navigation Skip to search Skip to main content

Safe inductions and their applications in knowledge representation

Research output: Contribution to journal › Article › peer-review

10 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)167-185
Number of pages19
JournalArtificial Intelligence
Volume259
DOIs
Publication statusPublished - 1 Jun 2018
Externally publishedYes

Keywords

  • Abstract argumentation
  • Approximation fixpoint theory
  • Autoepistemic logic
  • Construction
  • Groundedness
  • Induction process
  • Inductive definitions
  • Lattice operator
  • Logic programming
  • Well-founded semantics

Fingerprint

Dive into the research topics of 'Safe inductions and their applications in knowledge representation'. Together they form a unique fingerprint.

Cite this