Abstract
To generalize the 2-valued stable model semantics for truth maintenance, we introduce a 3-valued stable model semantics. Unlike the 2-valued semantics, this semantics can be given compositional properties. In particular we show that a canonical model (the skeptical model) can be derived as a composition of 3-valued interpretations. The skeptical model can also be characterized by a fixpoint construction. We show that using this construction, the skeptical model can be computed in O(n 2).
Finally, since the skeptical model turns out to be not a straightforward generalization of the 2-valued stable model semantics, we investigate a possible alternative. Although we can find another canonical model, this alternative model seems to be difficult to compute.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Brewka, G., Nonmonotonic Reasoning — From Theoretical Foundations Towards Efficient Computation, thesis University of Hamburg, 1989
Charniak, E., Riesbeck C., and McDermott, D., Artificial Intelligence Programming, L.E. Erlbaum, Baltimore, 1979.
Dowling, W. and Gallier, J., Linear Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae, Journal of Logic Programming 3 (1984), 267–284.
Doyle, J., A Truth Maintenance System, Artificial Intelligence 12, 1979
Elkan, Ch., Logical Characterizations of Nonmonotonic TMSs, in: Kreczmar, A. and G. Mirkowska, (eds) Mathematical Foundations of Computer Science 1989, Springer Heidelberg, 1989, pp. 218–224.
Gelfond, M., and Lifschitz, V., The Stable Model Semantics for Logic Programming. In: Fifth International Conference Symposium on Logic Programming, pp. 1070–1080, 1988.
Goodwin, J., An Improved Algorithm for Non-Monotonic Dependency Net Update. LITH-MAT-R-82-23, Linkoeping University 1982.
Kleene, S., Introduction of metamathematics, Van Nostrand, 1952.
Lloyd, J.W., Foundations of Logic Programming, Springer Verlag, Heidelberg, 1987
Petrie, C.J., Revised Dependency-Directed Backtracking for Default Reasoning, Proc. AAAI, 1987.
Przymusinska, H., and Przymusinski, T., Semantic Issues in Deductive Databases and Logic Programs, in: Formal Techniques in Artificial Intelligence, A Sourcebook R.B. Banerji (ed.), Elsevier, Amsterdam, 1990, pp 321–367.
Reinfrank, M., Fundamentals and Logical Foundations of Truth Maintenance, Linköping Studies in Science and Technology. Dissertations no. 221, Linköping University, 1989.
Turner, R., Logics for Artificial Intelligence, Ellis Horwood Ltd, Chichester, 1987.
Valiant, L.G., Vazirani, V.V., NP is as easy as detecting unique solutions, Theoretical Computer Science 47 (1986) 85–93.
Witteveen, C., Fixpoint Semantics for Truth Maintenance, TWI-report 90-85, Faculty of Technical Mathematics and Computer Science, Delft University of Technology, Delft, 1990
Witteveen, C., Partial Semantics for Truth Maintenance, to appear as TWI-Report, Department of Mathematics and Computer Science, Delft University of Technology, 1990.
Witteveen, C., Partial Semantics for Truth Maintenance, in: J.W. van Eyk(ed.), Proceedings of JELIA90, LNCAI, Springer Heidelberg, 1990, (to appear).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Witteveen, C. (1991). A skeptical semantics for truth maintenance. In: Martins, J.P., Reinfrank, M. (eds) Truth Maintenance Systems. TMW 1990. Lecture Notes in Computer Science, vol 515. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0037034
Download citation
DOI: https://doi.org/10.1007/BFb0037034
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54305-3
Online ISBN: 978-3-540-47550-7
eBook Packages: Springer Book Archive