Optimal models of disjunctive logic programs: semantics, complexity, and computation

Almost all semantics for logic programs with negation identify a set, SEM(P), of models of program P, as the intended semantics of P, and any model M in this class is considered a possible meaning of P with regard to the semantics the user has in mind. Thus, for example, in the case of stable models...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on knowledge and data engineering Vol. 16; no. 4; pp. 487 - 503
Main Authors:	Leone, N., Scarcello, F., Subrahmanian, V.S.
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.04.2004 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithm design and analysis Complexity Computational complexity End users Flexibility Knowledge representation Logic programming Mathematical analysis Mathematical models Optimization Programming profession Semantics Studies
ISSN:	1041-4347, 1558-2191
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!