Parametrized logic programming

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

17 Citations (Scopus)


Traditionally, a logic program is built up to reason about atomic first-order formulas. The key idea of parametrized logic programming is that, instead of atomic first-order formulas, a parametrized logic program reasons about formulas of a given parameter logic. Of course, the main challenge is to define the semantics of such general programs. In this work we introduce the novel definitions along with some motivating examples. This approach allows us to prove general results that can be instantiated for every particular choice of the parameter logic. Important general results we can prove include the existence of semantics and the alternating fix-point theorem of well-founded semantics. To reenforce the soundness of our general framework we show that some known approaches in the literature of logic programming, such as paraconsistent answer-sets and the MKNF semantics for hybrid knowledge bases, are obtained as particular choices of the parameter logic.

Original languageEnglish
Title of host publicationLogics in Artificial Intelligence - 12th European Conference, JELIA 2010, Proceedings
EditorsT. Janhunen, I. Niemelä
Place of PublicationBerlin, Heidelberg
Number of pages13
ISBN (Electronic)978-3-642-15675-5
ISBN (Print)3642156746, 978-3-642-15674-8
Publication statusPublished - 2010
Event12th European Conference on Logics in Artificial Intelligence, JELIA 2010 - Helsinki, Finland
Duration: 13 Sep 201015 Sep 2010

Publication series

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


Conference12th European Conference on Logics in Artificial Intelligence, JELIA 2010


Dive into the research topics of 'Parametrized logic programming'. Together they form a unique fingerprint.

Cite this