Implementing prioritized logic programming

Cheng Min Wu, Yan Zhang

Research output: Chapter in Book / Conference PaperConference Paperpeer-review

2 Citations (Scopus)

Abstract

Conflict resolution is an important issue in knowledge representation and reasoning. A common idea of solving conflicts in reasoning is to introduce priorities in the underlying reasoning mechanism. This paper describes an implementation of prioritized logic programs (PLPs) proposed by Zhang and Foo recently [4]. PLPs is a non-trivial extension of Gelfond and Lifschitz’s extended logic programs [3] by associating preferences to the program, where answer sets provide a semantics of PLPs. As a central part of the implementation of PLPs, we present major algorithms of computing answer sets of PLPs. We show how answer sets of a PLP can be computed efficiently based on previous Niemelä and Simons’ method of computing stable models of logic programs [2].

Original languageEnglish
Title of host publicationFoundations of Intelligent Systems - 11th International Symposium, ISMIS 1999, Proceedings
EditorsZbigniew W. Raś, Zbigniew W. Raś, Andrzej Skowron
PublisherSpringer Verlag
Pages85-93
Number of pages9
ISBN (Print)354065965X, 9783540659655
DOIs
Publication statusPublished - 1999
Event11th International Symposium on Methodologies for Intelligent Systems, ISMIS 1999 - Warsaw, Poland
Duration: 8 Jun 199911 Jun 1999

Publication series

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

Conference

Conference11th International Symposium on Methodologies for Intelligent Systems, ISMIS 1999
Country/TerritoryPoland
CityWarsaw
Period8/06/9911/06/99

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1999.

Fingerprint

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

Cite this