Connecting first-order ASP and the logic FO(ID) through reducts

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

24 Scopus citations

Abstract

Recently, an answer-set programming (ASP) formalism of logic programing with the answer-set semantics has been extended to the full first-order setting. Earlier an extension of first-order logic with inductive definitions, the logic FO(ID), was proposed as a knowledge representation formalism and developed as an alternative ASP language. We present characterizations of these formalisms in terms of concepts of infinitary propositional logic. We use them to find a direct connection between the first-order ASP and the logic FO(ID) under some restrictions on the form of theories (programs) considered.

Original languageEnglish
Title of host publicationCorrect Reasoning
Subtitle of host publicationEssays on Logic-Based AI in Honor of Vladimir Lifschitz
EditorsErdem Esra, Lee Joohyung, Lierler Yuliya, Pearce David
Pages543-559
Number of pages17
DOIs
StatePublished - 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7265
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Connecting first-order ASP and the logic FO(ID) through reducts'. Together they form a unique fingerprint.

Cite this