Proving quantified literals in defeasible logic. (English) Zbl 0936.03029
Summary: Defeasible logic is a nonmonotonic reasoning approach which has an efficient implementation. Currently defeasible logic can only prove ground literals. We describe a version of defeasible logic which is capable of proving existentially and universally closed literals, as well as ground literals. The intuition motivating the formalism is presented, and some of its properties are proved. We also discuss and justify the claim that existentially and universally closed literals can be proved.
MSC:
| 03B60 | Other nonclassical logic |
| 68T27 | Logic in artificial intelligence |
| 03B70 | Logic in computer science |
Keywords:
existentially closed literals; nonmonotonic reasoning; defeasible logic; universally closed literalsReferences:
| [1] | Antoniou, G., Nonmonotonic Reasoning (1997), MIT Press: MIT Press Cambridge, MA · Zbl 0948.68169 |
| [2] | Billington, D.; De Coster, K.; Nute, D., A modular translation from defeasible nets to defeasible logics, Journal of Experimental and Theoretical Artificial Intelligence, 2, 151-177 (1990) |
| [3] | Billington, D., Defeasible Logic is Stable, Journal of Logic and Computation, 3, 379-400 (1993) · Zbl 0808.03011 |
| [4] | Billington, D., Adding Disjunction to Defeasible Logic, (Proceedings of the Seventh Australian Joint Conference on Artificial Intelligence (1994)), 259-266 |
| [5] | Brewka, G., Nonmonotonic Reasoning: Logical Foundations of Commonsense (1991), Cambridge University Press: Cambridge University Press Cambridge, MA · Zbl 0723.68099 |
| [6] | Covington, M.; Nute, D.; Vellino, A., Prolog Programming in Depth (1997), Prentice-Hall: Prentice-Hall Cambridge · Zbl 0864.68010 |
| [7] | Fordyce, R.; Billington, D., DLog(e): An implementation of Defeasible Logic, (Proceedings of the Fifth Australian Joint Conference on Artificial Intelligence (1992)), 284-289 |
| [8] | Lassez, J-L.; Maher, M. J.; Marriott, K., Unification Revisited, (Minker, J., Foundations of Deductive Databases and Logic Programming (1988), Morgan Kaufmann: Morgan Kaufmann Englewood Cliffs, NJ), 587-625, ch 15 · Zbl 0645.68046 |
| [9] | Lukaszewicz, W., Non-monotonic Reasoning Formalization of Commonsense Reasoning (1990), Ellis Horwood: Ellis Horwood Los Altos, CA |
| [10] | Nute, D., Defeasible reasoning: A philosophical analysis in Prolog, (Fetzer, J. H., Aspects of Artificial Intelligence (1988), Kluwer Academic Publishers: Kluwer Academic Publishers Chichester, UK), 251-288 |
| [11] | Nute, D., Defeasible reasoning and decision support systems, Decision Support Systems, 4, 97-110 (1988) |
| [12] | Nute, D.; Mann, R. I.; Brewer, B. F., Controlling expert system recommendations with Defeasible Logic, Decision Support Systems, 6, 153-164 (1990) |
| [13] | Nute, D., Basic Defeasible Logic, (Cerro, L. F.D.; Penttonen, M., Intentional Logics for Programming (1992), Clarendon Press: Clarendon Press Dordrecht), 125-154 |
| [14] | Nute, D., Defeasible Logic, (Gabbay, D. M.; Hogger, C. J.; Robinson, J. A., Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 3 (1994), Oxford University Press: Oxford University Press Oxford) · Zbl 1033.68656 |
| [15] | Nute, D., A decidable quantified defeasible logic, (Prawitz, D.; Skyrms, B.; Westerståhl, D., Logic, Methodology and Philosophy of Science IX (1994), Elsevier: Elsevier Oxford), 263-284 · Zbl 0820.03014 |
| [16] | Nute, D.; Lewis, M., (A users’ Manual ford-Prolog. Technical Report 01-0016 (1986), The University of Georgia: The University of Georgia Amsterdam) |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
