Results 281 to 290 of about 1,988,584 (327)

Consistency, Soundness, Completeness

2021
This chapter shows that Q is consistent, sound, and complete. The proof methods that will be employed to establish these results are the same that have been employed in Chapter 10 to prove the consistency, soundness, and completeness of L.
openaire   +1 more source

Fast complete memory consistency verification

2009 IEEE 15th International Symposium on High Performance Computer Architecture, 2009
The verification of an execution against memory consistency is known to be NP-hard. This paper proposes a novel fast memory consistency verification method by identifying a new natural partial order: time order. In multiprocessor systems with store atomicity, a time order restriction exists between two operations whose pending periods are disjoint: the
Yunji Chen, null Yi Lv, Weiwu Hu, Tianshi Chen, null Haihua Shen, null Pengyu Wang, null Hong Pan   +6 more
openaire   +1 more source

Convolution-Consistent Collective Matrix Completion

Proceedings of the 28th ACM International Conference on Information and Knowledge Management, 2019
Collective matrix completion refers to the problem of simultaneously predicting the missing entries in multiple matrices by leveraging the cross-matrix information. It finds abundant applications in various domains such as recommender system, dimensionality reduction, and image recovery. Most of the existing work represents the cross-matrix information
Xu Liu, Jingrui He, Sam Duddy, Liz O'Sullivan   +3 more
openaire   +1 more source

Consistency and Completeness--A Resume

The American Mathematical Monthly, 1956
(1956). Consistency and Completeness—A Resume. The American Mathematical Monthly: Vol. 63, No. 5, pp. 295-305.
openaire   +1 more source

On Consistency and Completeness of Autoepistemic Theories

Fundamenta Informaticae, 1992
In this paper we expand the results on existence and uniqueness of stable autoepistemic expansions for finite stratified autoepistemic theories to the infinite case. We also introduce a notion of the closed world completion of autoepistemic theory T, which can be viewed as an autoepistemic version of Closed World Assumption.
Gelfond, Michael, Przymusinska, Halina
openaire   +2 more sources

Consistency and Completeness in Model Systems

Cybernetics and Systems, 2020
In this research, we have shown that the goal of reducing the ecological system to a mathematical model cannot be achieved.
Villacampa, Yolanda, Sastre Vázquez, Patricia, Reyes, José Antonio, García-Alonso, Fernando   +3 more
openaire   +2 more sources

Scale Consistent Image Completion

2006
Most patch based image completion algorithms fill in missing parts of images by copying patches from the known part of the image into the unknown part. The criterion for preferring one patch over another is the compatibility or consistency of the proposed patch with the nearby region that is known or already completed.
Michal Holtzman-Gazit, Irad Yavneh
openaire   +1 more source

Consistency and Completeness in Rough Sets

Journal of Intelligent Information Systems, 2000
Consistency and completeness are defined in the context of rough set theory and shown to be related to the lower approximation and upper approximation, respectively. A member of a composed set (union of elementary sets) that is consistent with respect to a concept, surely belongs to the concept. An element that is not a member of a composed set that is
Arul Siromoney, K. Inoue
openaire   +1 more source

Ethical Theory, Completeness & Consistency

Ethical Theory and Moral Practice, 2007
This paper argues that many leading ethical theories are incomplete, in that they fail to account for both right and wrong. It also argues that some leading ethical theories are inconsistent, in that they allow that an act can be both right and wrong. The paper also considers responses on behalf of the target theories.
openaire   +1 more source

Consistent and Complete Sets

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