Enhancing disjunctive logic programming systems by SAT checkers

Abstract

Disjunctive logic programming (DLP) with stable model semantics is a powerful nonmonotonic formalism for knowledge representation and reasoning. Reasoning with DLP is harder than with normal (∨-free) logic programs, because stable model checking—deciding whether a given model is a stable model of a propositional DLP program—is co-NP-complete, while it is… (More)
DOI: 10.1016/S0004-3702(03)00078-X

Topics

8 Figures and Tables

Statistics

051015'05'07'09'11'13'15'17
Citations per Year

52 Citations

Semantic Scholar estimates that this publication has 52 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics