Decidability and implementation of parametrized logic programs

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

2 Citations (Scopus)

Abstract

Parametrized logic programs are very expressive logic programs that generalize normal logic programs under the stable model semantics, by allowing complex formulas of a parameter logic to appear in the body and head of rules. In this paper we study the decidability of these rich programs and propose an implementation that combines, in a modular way, a reasoner for the parameter logic with an answer set solver.

Original languageEnglish
Title of host publicationLogic Programming and Nonmonotonic Reasoning - 12th International Conference, LPNMR 2013, Proceedings
EditorsP. Cabalar, T. C. Son
Place of PublicationBerlin, Heidelberg
PublisherSpringer Verlag
Pages361-373
Number of pages13
ISBN (Electronic)978-3-642-40564-8
ISBN (Print)978-3-642-40563-1
DOIs
Publication statusPublished - 22 Oct 2013
Event12th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2013 - Corunna, Spain
Duration: 15 Sep 201319 Sep 2013

Publication series

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

Conference

Conference12th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2013
CountrySpain
CityCorunna
Period15/09/1319/09/13

Fingerprint Dive into the research topics of 'Decidability and implementation of parametrized logic programs'. Together they form a unique fingerprint.

Cite this