Abstract
The concept of minimization is widely used in several areas of Computer Science. Although this notion is not properly formalized in first-order logic, it is so with the logic MIN(FO) [13] where a minimal predicate P is defined as satisfying a given first-order description φ(P). We propose the MIN logic as a generalization of MIN(FO) since the extent of a minimal predicate P is not necessarily unique in MIN as it is in MIN(FO). We will explore two different possibilities of extending MIN(FO) by creating a new predicate defined as the union, the U-MIN logic, or intersection, the I-MIN logic, of the extent of all minimal P that satisfies φ(P). We will show that U-MIN and I-MIN are interdefinable. Thereafter, U-MIN will be just MIN. Finally, we will prove that simultaneous minimizations does not increase the expressiveness of MIN, and that MIN and second-order logic are equivalent in expressive power.
This research is partially supported by PADCT/CNPq, PRONEX/FUNCAP-CNPq, CNPq and FUNCAP.
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
Davis, M.D., Sigal, R., Weyuker, E.J.: Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science, 2nd edn. Morgan Kaufmann, San Diego (1994)
de Kleer, J., Konolige, K.: Eliminating the Fixed Predicates from a Circumscription. Artificial Intelligence 39, 391–398 (1989)
Ebbinghaus, H.-D., Flum, J., Thomas, W.: Mathematical Logic. Springer, New York (1994)
Grädel, E.: Guarded fixed point logics and the monadic theory of countable trees. Theoretical Computer Science 288(1), 129–152 (2002)
Hrbacek, K., Jech, T.: Introduction to Set Theory, 2nd edn. Marcel Dekker, INC., New York (1984)
Libkin, L.: Elements of Finite Model Theory. Springer, Berlin (2004)
Lifschitz, V.: Circumscription. In: Gabbay, D.M., Hogger, C.J., Robinson, J.A. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming – Nonmonotonic Reasoning and Uncertain Reasoning, vol. 3, pp. 297–352. Clarendon Press, Oxford (1994)
Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer, New York (1987)
McCarthy, J.L.: Circumscription – a form of non-monotonic reasoning. Artif. Intell. 13(1-2), 27–39 (1980)
McCarthy, J.L.: Applications of circumscription to formalizing common-sense knowledge. Artif. Intell. 28(1) (1986)
Schmidt, D.A.: Denotational Semantics: a methodology for language development. Allyn and Bacon, INC, Boston (1986)
Scott, D.: Domains for Denotational Semantics. In: Nielsen, M., Schmidt, E.M. (eds.) ICALP 1982. LNCS, vol. 140, pp. 577–613. Springer, Berlin (1982)
van Benthem, J.: Minimal Predicates, Fixed-Points, and Definability. J. Symbolic Logic 70(3), 696–712 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ferreira, F.M., Martins, A.T. (2006). The Predicate-Minimizing Logic MIN. In: Sichman, J.S., Coelho, H., Rezende, S.O. (eds) Advances in Artificial Intelligence - IBERAMIA-SBIA 2006. IBERAMIA SBIA 2006 2006. Lecture Notes in Computer Science(), vol 4140. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11874850_62
Download citation
DOI: https://doi.org/10.1007/11874850_62
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-45462-5
Online ISBN: 978-3-540-45464-9
eBook Packages: Computer ScienceComputer Science (R0)