Results 131 to 140 of about 542,050 (166)
Some of the next articles are maybe not open access.
Globally and locally consistent image completion
ACM Transactions on Graphics, 2017We present a novel approach for image completion that results in images that are both locally and globally consistent. With a fully-convolutional neural network, we can complete images of arbitrary resolutions by filling-in missing regions of any shape.
Satoshi Iizuka +2 more
openaire +1 more source
Checking Classification Constraints for Consistency and Completeness
1987 IEEE Symposium on Security and Privacy, 1987Classification constraints are rules for assigning access classes to data when they are entered into a database. In order that a given set of constraints specify meaningful classes, they should be consistent, that is, not define conflicting classes for the same data; and complete, that is, assign a class to all data.
Selim G. Akl, Dorothy E. Denning
openaire +1 more source
Consistency, Completeness, and Classicality
2019We study the expansion of the four-valued Belnap–Dunn logic by a pair of constants 0 and 1 which express respectively the weakest inconsistent proposition and the strongest complete proposition. We then further expand this logic by the intuitionistic implication and use this expansion to introduce a logic which is a conservative extension of both ...
openaire +1 more source
2001
A Henkin-style completeness proof (of a formal system of non-modal logic) consists of two steps. First, one has to prove that every consistent set is embeddable into a maximal consistent set of sentences. Secondly, one has to show that every maximal consistent set determines (in a natural way) an interpretation satisfying it.
openaire +1 more source
A Henkin-style completeness proof (of a formal system of non-modal logic) consists of two steps. First, one has to prove that every consistent set is embeddable into a maximal consistent set of sentences. Secondly, one has to show that every maximal consistent set determines (in a natural way) an interpretation satisfying it.
openaire +1 more source
On Negation, Completeness and Consistency
2002In this Chapter we try to understand negation from two different points of view: a syntactical one and a semantic one. Accordingly, we identify two different types of negation. The same connective of a given logic might be of both types, but this might not always be the case.
openaire +1 more source
A complete and consistent modal set theory
Journal of Symbolic Logic, 19671.1. The aim of this paper is the construction of a demonstrably consistent system of set theory that (1) contains roughly the same amount of mathematics as the writer's system K′ [3], including a theory of continuous functions of real numbers, and (2) provides a way for expressing in the object language various propositions which, in the case of K ...
openaire +1 more source
Checking Consistency and Completeness of Software Systems
2019The following paper presents the current state of the author’s research on the subject of static software tracing, a research which dates back to the year 2000 when the author was requested to predict the costs of software maintenance projects. The goal of static tracing is to link the software artifacts produced in software development with the ...
openaire +1 more source
Complete and temporally consistent video outpainting
2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW), 2022Loïc Dehan +3 more
openaire +1 more source
The Consistency and Completeness of Formal Systems
1966Of every formal system it is desirable to show that the system is (1) consistent, and (2) complete.2 This is shown for the system PLT’ in this chapter. A decision procedure is first developed for PLT’ and by means of this, the desired results are demonstrated.
openaire +1 more source