The Predicate-Minimizing Logic MIN
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)  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.
KeywordsMinimal Model Expressive Power Predicate Symbol Denotational Semantic Nonmonotonic Reasoning
Unable to display preview. Download preview PDF.
- 1.Davis, M.D., Sigal, R., Weyuker, E.J.: Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science, 2nd edn. Morgan Kaufmann, San Diego (1994)Google Scholar
- 7.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)Google Scholar
- 10.McCarthy, J.L.: Applications of circumscription to formalizing common-sense knowledge. Artif. Intell. 28(1) (1986)Google Scholar
- 11.Schmidt, D.A.: Denotational Semantics: a methodology for language development. Allyn and Bacon, INC, Boston (1986)Google Scholar