Complexity results for restricted credulous default reasoning

Authors
Zhao, XS Ding, DC Buning, HK
Citation
Xs. Zhao et al., Complexity results for restricted credulous default reasoning, AI COMMUN, 13(4), 2000, pp. 249-257
Citations number
10
Categorie Soggetti
AI Robotics and Automatic Control
Journal title
AI COMMUNICATIONS
ISSN journal
09217126 → ACNP
Volume
13
Issue
4
Year of publication
2000
Pages
249 - 257
Database
ISI
SICI code
0921-7126(2000)13:4<249:CRFRCD>2.0.ZU;2-K
Abstract
This paper concentrates on the complexity of the decision problem deciding whether a literal belongs to at least one extension of a default theory <D, W > in which D is a set of Horn defaults and W is a definite Horn formula o r a Bi-Horn formula.