Abductive logic programs with penalization: semantics, complexity and implementation

DOI10.1017/S1471068404002224zbMath1093.68020MaRDI QIDQ4673542

Nicola Leone, Simona Perri, Francesco Scarcello

Publication date: 29 April 2005

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

zbMATH Keywords

computational complexitypenalizationoptimization problemsknowledge representationnonmonotonic reasoninglogic programsabductionstable models

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30) Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (5)

Solving abduction by computing joint explanations. Logic programming formalization, applications to P2P data integration, and complexity results ⋮ Super-Solutions ⋮ A core language for fuzzy answer set programming ⋮ Local closed world reasoning with description logics under the well-founded semantics ⋮ Using possibilistic logic for modeling qualitative decision: answer set programming algorithms

This page was built for publication: Abductive logic programs with penalization: semantics, complexity and implementation