Proofs of partial knowledge allow a prover to prove knowledge of witnesses for k out of n instances of NP languages. Cramer, Schoenmakers and Damg̊ard [CDS94] provided an efficient construction of a 3-round public-coin witness-indistinguishable (k, n)-proof of partial knowledge for any NP language, by cleverly combining n executions of Σ-protocols for that language. This transform assumes that a...

In an ITS, students typically have two types of performance to a problem: correct and incorrect, and all the other information such as how many hints the student sees in this question and how many attempts he/she does to get the correct answer is ignored. Feng and Heffernen (2010) showed that we can predict better by accounting for problem solving behavior as well as correctness. By introduce c...

In many real-life applications, we have an ordered set: a set of all space-time events, a set of all alternatives, a set of all degrees of confidence. In practice, we usually only have a partial information about an element x of this set. This partial information includes positive knowledge: that a ≤ x or x ≤ a for some known a, and negative knowledge: that a ̸≤ a or x ̸≤ a for the known a. In th...

REPORTRAPPORT Partial logics with two kinds of negation as a foundation for knowledge-based reasoning Abstract We show how to use model classes of partial logic to deene semantics of general knowledge-based reasoning. Its essential beneet is that partial logics allow us to distinguish two sorts of negative information: the absence of information and the explicit rejection or falsiication of inf...

Knowledge is a key factor and strategic resource for gaining assets and non-functional organizational capabilities. Knowledge Management is the knowledgeable process of creating, validating, presenting, distributing and using the knowledge in an organization. Successful organizations consider human resource development as a fundamental principle. This study aims to investigate the Knowledge Man...

Laplacian Eigenmaps (LE) and Schroedinger Eigenmaps (SE) are effective dimensionality reduction algorithms that are capable of integrating both the spatial and spectral information inherent in a hyperspectral image. In this paper, we consider how to extend LEand SE-based spatial-spectral dimensionality reduction algorithms to situations where partial knowledge of class labels exists, for exampl...

The aim of the paper is to study efficeient of inference process using clustered partial decision rules. Partial decision rules are constructed by greedy algorithm. They are clustered with Agglomerative Hierarchical Clustering (AHC) algorithm. We study how exact and partial decision rules clustered by AHC algorithm influence on inference process in knowledge base. Clusters of rules are a way of...

In legal reasoning systems, a typical application of normative reasoning, partial information plays an important role in the representation and reasoning of legal knowledge. To construct a legal knowledge-base with partial information, many features are required of knowledge representation languages. In this paper, we discuss the representation of knowledge-bases and their re nement through our...