Abstract
In this paper, the problem of purifying an assumption-based theory KB, i.e., identifying the right extension of KB using knowledge-gathering actions (tests), is addressed. Assumptions are just normal defaults without prerequisite. Each assumption represents all the information conveyed by an agent, and every agent is associated with a (possibly empty) set of tests. Through the execution of tests, the epistemic status of assumptions can change from "plausible" to "certainly true", "certainly false" or "irrelevant", and the KB must be revised so as to incorporate such a change. Because removing all the extensions of an assumption-based theory except one enables both identifying a larger set of plausible pieces of information and renders inference computationally easier, we are specifically interested in finding out sets of tests allowing to purify a KB (whatever their outcomes). We address this problem especially from the point of view of computational complexity.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Antoniou, G., ‘On the dynamics of default reasoning’, Proc. of ECSQARU'99, 1–10.
Brewka, G. ‘Preferred subtheories: an extended logical framework for default reasoning’, Proc. of IJCAI'89, 1043–1048.
Benferhat, S., C. Cayrol, D. Dubois, J. Lang and H. Prade, ‘Inconsistency management and prioritized syntax-based entailment’, Proc. of IJCAI'93, 640–645.
de Kleer, J., and B. Williams, ‘Diagnosing multiple faults’, Artificial Intelligence 32 (1987), 97–130.
de Kleer, J., A. Mackworth and R. Reiter, ‘Characterizing diagnoses and systems’, Artificial Intelligence 56 (1992), 197–222.
Eiter, Th., and G. Gottlob, ‘The complexity of logic-based abduction’, JACM 42(1) (1995), 3–42.
Gottlob, G., ‘Complexity results for nonmonotonic logics’, Journal of Logic and Computation 2 (1992), 397–425.
Karp, R., ‘Complexity of computer computations’, in Reducibility among combinatorial problems, Plenum Press, New York, pp. 85–103, 1977.
Kean, A., ‘A formal characterization of a domain independent abductive reasoning system’, Ph.D. thesis, University of British Columbia, 1992.
Lang, L., and P. Marquis, ‘Complexity results for independence and definability in propositional logic’, Proc. of KR'98, 356–367.
Marquis, P., ‘Consequence finding algorithms’, in vol. 5, Handbook of Defeasible Reasoning and Uncertainty Management Systems, Kluwer Academic, 2000, 41–145.
Mcilraith, S., ‘Generating tests using abduction’, Proc. of KR'94, 449–460.
Mcilraith, S., and R. Reiter, ‘On tests for hypothetical reasoning’, Readings in model-based diagnosis, Morgan Kaufman, 89–96, 1992.
Moore, R. C., ‘A formal theory of knowledge and action’, Readings in Planning, Morgan Kaufmann, 480–519, 1990.
Nebel, B., ‘Belief revision and default reasoning: syntax-based approaches’, Proc. of KR'91, 417–428.
Papadimitriou, Ch., Computational Complexity, Addison-Wesley, 1994.
Poole, D., ‘A logical framework for default reasoning’, Artificial Intelligence 36 (1987), 27–47.
Poole, D., ‘Normality and faults in logic-based diagnosis’, Readings in model-based diagnosis, Morgan Kaufman, pp. 71–77, 1992.
Reiter, R., ‘A theory of diagnosis from first principles’, Artificial Intelligence 32(1) (1987), 57–96.
Rymon, R., ‘Search through systematic set enumeration’, Proc. of KR'92, 539–550.
Scherl R. B., and H. J. Levesque, ‘The frame problem and knowledge-producing actions’, Proc. of AAAI'93, 689–695.
Stillman, J., ‘The complexity of propositional default logics’, Proc. of AAAI'92, 794–799.
Stockmeyer, L. J., ‘The polynomial hierarchy’, TCS 3 (1977), 1–22.
van Linder, B., W. van der Hoek and J.-J. Meyer, ‘Tests as epistemic updates’, Proc. of ECAI'94, 331–335.
Williams M. A., and G. Antoniou, ‘A strategy for revising default theory extensions’, Proc. of KR'98, 24–33.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Lang, J., Marquis, P. Removing Inconsistencies in Assumption-based Theories Through Knowledge-Gathering Actions. Studia Logica 67, 179–214 (2001). https://doi.org/10.1023/A:1010595019595
Issue Date:
DOI: https://doi.org/10.1023/A:1010595019595