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...

Celý popis

Podrobná bibliografie

Vydáno v:	IEEE transactions on knowledge and data engineering Ročník 16; číslo 4; s. 487 - 503
Hlavní autoři:	Leone, N., Scarcello, F., Subrahmanian, V.S.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 01.04.2004 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!