Academic
Publications
Preferred Arguments are Harder to Compute than Stable Extension

Preferred Arguments are Harder to Compute than Stable Extension,Yannis Dimopoulos,Bernhard Nebel,Francesca Toni

Preferred Arguments are Harder to Compute than Stable Extension   (Citations: 19)
BibTex | RIS | RefWorks Download
Based on an abstract framework for nonmonotonicreasoning, Bondarenko et al. have extendedthe logic programming semantics of admissible and preferred arguments to other nonmonotonicformalisms such as circumscription,auto-epistemic logic and default logic. Althoughthe new semantics have been tacitly assumedto mitigate the computational problemsof nonmonotonic reasoning under the standardsemantics of stable extensions, it seems questionablewhether they improve the worst-case...
Cumulative Annual
Sort by: