Abstract
Some operations to decompose a knowledge base (considered as a first order logic formula) in ways so that only its semantics determines the results are investigated. Intended uses include the extraction of “parts” relevant to an application, the exploration and utilizing of implicit possibilities of structuring a knowledge base and the formulation of query answers in terms of a signature demanded by an application. A semantic framework based on Herbrand interpretations is outlined. The notion of “model relative to a scope” is introduced. It underlies the partitioning operations “projection” and “forgetting” and also provides a semantic account for certain formula simplification operations. An algorithmic approach which is based on resolution and may be regarded as a variation of the SCAN algorithm is discussed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ackermann, W.: Untersuchungen über das Eliminationsproblem der mathematischen Logik. Mathematische Annalen 110, 390–413 (1935)
Amir, E., McIlraith, S.A.: Partition-based logical reasoning. In: Princ. of Knowl. Repr. and Reasoning, pp. 389–400 (2000)
Bibel, W.: Deduktion — Automatisierung der Logik. Oldenbourg, München (1992)
Bibel, W., Eder, E.: Methods and calculi for deduction. In: Gabbay, D.M., Hogger, C.J., Robinson, J.A. (eds.) Handbook of Logic in Artif. Int. and Logic Programming, ch. 3, vol. 1, pp. 67–182. Oxford University Press, Oxford (1993)
Chang, C.-L., Lee, R.C.-T.: Symbolic Logic and Mechanical Theorem Proving. Academic Press, Boston (1973)
Darwiche, A.: Decomposable negation normal form. JACM 48(4), 608–647 (2001)
Davis, M., Putnam, H.: A computing procedure for quantification theory. JACM 7(3), 201–215 (1960)
Gabbay, D., Ohlbach, H.J.: Quantifier elimination in second-order predicate logic. In: KR 1992. Princ. of Knowl. Repr. and Reasoning, pp. 425–435 (1992)
Goranko, V., Hustadt, U., Schmidt, R.A., Vakarelov, D.: SCAN is complete for all Sahlqvist formulae. In: Relational and Kleene-Algebraic Methods in Computer Science (RelMiCS 7), pp. 149–162 (2004)
Kohlas, J., Haenni, R., Moral, S.: Propositional information systems. Journal of Logic and Computation 9(5), 651–681 (1999)
Lin, F., Reiter, R.: Forget It! In: Greiner, R., Subramanian, D. (eds.) Working Notes, AAAI Fall Symposium on Relevance, Menlo Park, California, pp. 154–159. American Association for Artificial Intelligence (1994)
Nonnengart, A., Ohlbach, H.J., Szałas, A.: Quantifier elimination for secondorder predicate logic. In: Ohlbach, H., Reyle, U. (eds.) Logic, Language and Reasoning. Essays in Honor of Dov Gabbay, Part I, pp. 159–181. Kluwer, Dordrecht (1999)
Szałas, A.: On the correspondence between modal and classical logic: An automated approach. Journal of Logic and Computation 3(6), 605–620 (1993)
Wilson, N., Mengin, J.: Logical deduction using the local computation framework. In: Int. Workshop on First-Order Theorem Proving, FTP 1997, RISC-Linz Report Series No. 97–50, pages 135–139. Johannes Kepler Universität, Linz (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wernhard, C. (2004). Semantic Knowledge Partitioning. In: Alferes, J.J., Leite, J. (eds) Logics in Artificial Intelligence. JELIA 2004. Lecture Notes in Computer Science(), vol 3229. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30227-8_46
Download citation
DOI: https://doi.org/10.1007/978-3-540-30227-8_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23242-1
Online ISBN: 978-3-540-30227-8
eBook Packages: Springer Book Archive