Predicate encodings are information-theoretic primitives that can be transformed generically into predicate encryption schemes for a broad class of predicates (Wee, TCC 2014; Chen, Gay, Wee, EUROCRYPT 2015). Starting from the observation that predicate encodings admit a purely algebraic characterization equivalent to the original notion, we obtain several new results about predicate encodings. ...

The second-order matching problem is the problem of determining, for a finite set {〈ti, si〉 | i ∈ I} of pairs of a second-order term ti and a first-order closed term si, called a matching expression, whether or not there exists a substitution σ such that tiσ = si for each i ∈ I . It is well-known that the second-order matching problem is NP-complete. In this paper, we introduce the following re...

This paper presents a decidable fragment for combining ontologies and rules in order-sorted logic programming. We describe ordersorted logic programming with sort, predicate, and meta-predicate hierarchies for deriving predicate and meta-predicate assertions. Meta-level predicates (predicates of predicates) are useful for representing relationships between predicate formulas, and further, they ...

Global predicate detection is a fundamental problem in distributed systems and nds applications in many domains such as testing and debugging distributed programs. This paper presents two eecient distributed algorithms to detect conjunctive form global predicates in distributed systems. The algorithms detect the rst consistent global state that satisses the predicate even if the predicate is un...

In general, an n-ary predicate (relation) describes the relationship among its arguments, and such that no argument has to be of a special mode. The uniication and the resolution (SLDNF-resolution) do capture this state of aaair. Hence, the aim of logic programming is in some point approximatively achieved if the system is able to automatically determine the descriptive mode of an n-ary predica...

Predicate-argument structure contains rich semantic information of which statistical machine translation hasn’t taken full advantage. In this paper, we propose two discriminative, feature-based models to exploit predicateargument structures for statistical machine translation: 1) a predicate translation model and 2) an argument reordering model. The predicate translation model explores lexical ...

This paper presents the first steps towards building the Predicate Matrix, a new lexical resource resulting from the integration of multiple sources of predicate information including FrameNet (Baker et al., 1997), VerbNet (Kipper, 2005), PropBank (Palmer et al., 2005) and WordNet (Fellbaum, 1998). By using the Predicate Matrix, we expect to provide a more robust interoperable lexicon by discov...

In Positional-Slotted Object-Applicative (PSOA) RuleML, a predicate application (atom) can have an Object IDentifier (OID) and descriptors that may be positional arguments (tuples) or attributevalue pairs (slots). PSOA RuleML 1.0 extends earlier versions by explicitly specifying for each descriptor whether it is to be interpreted under the perspective of the predicate in whose scope it occurs. ...

This study aims to determine the health level of PT Bank NTB Syariah in 2019-2020. research uses quantitative research. The data collection method used this is documentation method. analysis technique analyze financial statements accordance with PJOK Number 8/POJK.03/2014 CHAPTER II Article 6 No. 1 and 2 Indonesia Regulation 13/1/PBI/2011. results show that risk profile or 2019 2020 seen from N...

A new type of optimization, called predicate move-around, ia introduced. It is shown how this optimization ‘considerably improvea the efficiency of evaluating SQL queries that have query graphs with a large number of query blocks (which ie a typical situation when queries are defined in terms of multiple views and subqueries). Predicate move-around works by moving predicates across query blocks...