Results 11 to 20 of about 48,321 (304)
Verbal predicate in the nominal predicate [PDF]
The paper considers the incorporation of the verbal predicate into the nominal predicate. It occurs in subordinate-complex predicate clauses. The nominal predicate is in the main and the verbal in the subordinate clause.
Mirko Peti
doaj +3 more sources
Predicate abstraction with indexed predicates [PDF]
Predicate abstraction provides a powerful tool for verifying properties of infinite-state systems using a combination of a decision procedure for a subset of first-order logic and symbolic methods originally developed for finite-state model checking.
Shuvendu K. Lahiri, Randal E. Bryant
openaire +3 more sources
Predicate-Based Key Exchange [PDF]
We provide the first description of and security model for authenticated key exchange protocols with predicate-based authentication. In addition to the standard goal of session key security, our security model also provides for credential privacy: a ...
James Birkett +3 more
core +4 more sources
Factoring Predicate Argument and Scope Semantics : underspecified Semantics with LTAG [PDF]
In this paper we propose a compositional semantics for lexicalized tree-adjoining grammar (LTAG). Tree-local multicomponent derivations allow separation of the semantic contribution of a lexical item into one component contributing to the predicate ...
Joshi, Aravind K., Kallmeyer, Laura
core +1 more source
AbstractIn Latent Semantic Analysis (LSA) the meaning of a word is represented as a vector in a high‐dimensional semantic space. Different meanings of a word or different senses of a word are not distinguished. Instead, word senses are appropriately modified as the word is used in different contexts.
openaire +1 more source
Predicate Abstraction with Minimum Predicates [PDF]
Predicate abstraction is a popular abstraction technique employed in formal software verification. A crucial requirement to make predicate abstraction effective is to use as few predicates as possible, since the abstraction process is in the worst case exponential (in both time and memory requirements) in the number of predicates involved.
Sagar Chaki +3 more
openaire +1 more source
Predicate-argument based Bi-encoder for paraphrase identification
Paraphrase identification involves identifying whether a pair of sentences express the same or similar meanings. While cross-encoders have achieved high performances across several benchmarks, bi-encoders such as SBERT have been widely applied to ...
Yekun Chai (16040549) +3 more
core +1 more source
On the Usefulness of Predicates
Motivated by the pervasiveness of strong inapproximability results for Max-CSPs, we introduce a relaxed notion of an approximate solution of a Max-CSP. In this relaxed version, loosely speaking, the algorithm is allowed to replace the constraints of an instance by some other (possibly real-valued) constraints, and then only needs to satisfy as many of ...
Håstad, Johan, Austrin, Per
openaire +4 more sources
Plato on Perception According to Parmenides’ System [PDF]
For a long time, Plato's thought has been affected by the interpretations of Aristotelianism or Neo-Platonism. However, some remarks which have been recently made regard the core of Plato's own thought in his dialogues. This becomes critical when we find
ebrahim musavi
doaj +1 more source
Loop Leaping with Closures [PDF]
Loop leaping is the colloquial name given to a form of program analysis in which summaries are derived for nested loops starting from the innermost loop and proceeding in a bottom-up fashion considering one more loop at a time.
Sebastian Biallas +7 more
core +1 more source

