AI Chat AI Image Generator AI Video Text to Speech

A lemma on closures and its application to modularity in logic programming semantics

08/03/2020

∙

by Michael J. Maher, et al.

∙

∙

This note points out a lemma on closures of monotonic increasing functions and shows how it is applicable to decomposition and modularity for semantics defined as the least fixedpoint of some monotonic function. In particular it applies to numerous semantics of logic programs. An appendix addresses the fixedpoints of (possibly non-monotonic) functions that are sandwiched between functions with the same fixedpoints.

page 1

page 2

page 3

page 4

research

∙ 03/20/2013

Non-monotonic Negation in Probabilistic Deductive Databases

In this paper we study the uses and the semantics of non-monotonic negat...

0 Raymond T. Ng, et al. ∙

research

∙ 03/31/2016

A New Approach for Revising Logic Programs

Belief revision has been studied mainly with respect to background logic...

0 Zhiqiang Zhuang, et al. ∙

research

∙ 11/04/2012

Generation of Two-Layer Monotonic Functions

The problem of implementing a class of functions with particular conditi...

0 Yukihiro Kamada, et al. ∙

research

∙ 04/26/2013

Non Deterministic Logic Programs

Non deterministic applications arise in many domains, including, stochas...

0 Emad Saad, et al. ∙

research

∙ 08/30/2011

Confidentiality-Preserving Data Publishing for Credulous Users by Extended Abduction

Publishing private data on external servers incurs the problem of how to...

0 Katsumi Inoue, et al. ∙

research

∙ 07/13/2021

Monotonic Filtering for Distributed Collection

Distributed data collection is a fundamental task in open systems. In su...

0 Hunza Zainab, et al. ∙

research

∙ 09/04/2020

Approximation, characterization, and continuity of multivariate monotonic regression functions

We deal with monotonic regression of multivariate functions f: Q →ℝ on a...

0 Jochen Schmid, et al. ∙