Supposition-based logic for automated nonmonotonic reasoning
We present a first-order logical system based on a standard first-order language which is enriched with new predicate symbols — supposition predicates. The logic is standard. The interesting non-standard features of a nonmonotonic logic are captured by considering whether a given consequence depends on the special predicates. A supposition theory contains formulas of the original language and special axioms governing the behaviour of the suppositions. Our system, when applied to suppositions theories, has many of the desired features of a nonmonotonic logic. We also discuss proof procedures issues.
Unable to display preview. Download preview PDF.
- Besnard, Quiniou & Quinton (1983) A theorem-prover for a decidable subset of default logic, Proc. AAAI-83, 27–30.Google Scholar
- Boolos (1979) The unprovability of consistency, Cambridge University Press.Google Scholar
- Bossu & Siegel (1982) Nonmonotonic reasoning and databases, in: Advances in database theory (ed. Gallaire, Minker & Nicolas), Plenum Press, 239–284.Google Scholar
- Etherington, Mercer & Reiter (1985) On the adequacy of predicate circumscription for closed world reasoning, Comp. Int. 1, 11–15.Google Scholar
- Kowalski & Hayes (1969) Semantic trees in automatic theorem-proving, in: Machine Intelligence 4 (ed. Meltzer & Michie), American Elsevier, 87–101.Google Scholar
- Siegel (1987) Représentation de connaissances en calcul propositionnel, thèse, Marseille.Google Scholar