Pairs Of Predicates Research Articles

Contract lenses: Reasoning about bidirectional programs via calculation

Abstract Bidirectional transformations (BXs) are a mechanism for maintaining consistency between multiple representations of related data. The lens framework, which usually constructs BXs from lens combinators, has become the mainstream approach to BX programming because of its modularity and correctness by construction. However, the involved bidirectional behaviors of lenses make the equational reasoning and optimization of them much harder than unidirectional programs. We propose a novel approach to deriving efficient lenses from clear specifications via program calculation, a correct-by-construction approach to reasoning about functional programs by algebraic laws. To support bidirectional program calculation, we propose contract lenses, which extend conventional lenses with a pair of predicates to enable safe and modular composition of partial lenses. We define several contract-lens combinators capturing common computation patterns including $\textit{fold}, \textit{filter},\textit{map}$ , and $\textit{scan}$ , and develop several bidirectional calculation laws to reason about and optimize contract lenses. We demonstrate the effectiveness of our new calculation framework based on contract lenses with nontrivial examples.

Predicate Correlation Learning for Scene Graph Generation.

For a typical Scene Graph Generation (SGG) method in image understanding, there usually exists a large gap in the performance of the predicates' head classes and tail classes. This phenomenon is mainly caused by the semantic overlap between different predicates as well as the long-tailed data distribution. In this paper, a Predicate Correlation Learning (PCL) method for SGG is proposed to address the above problems by taking the correlation between predicates into consideration. To measure the semantic overlap between highly correlated predicate classes, a Predicate Correlation Matrix (PCM) is defined to quantify the relationship between predicate pairs, which is dynamically updated to remove the matrix's long-tailed bias. In addition, PCM is integrated into a predicate correlation loss function ( LPC ) to reduce discouraging gradients of unannotated classes. The proposed method is evaluated on several benchmarks, where the performance of the tail classes is significantly improved when built on existing methods.

Предикати за реч и перцепция на реч в датски, шведски и български език – с-селекцията като тест за конверсивна антонимия

The article presents several parallels between the s-selection and argument selection of, on the one hand, speech predicates and speech-perception predicates, and, on the other hand, dative predicates and their converse antonyms. The focus lies on the differences and similarities between Bulgarian, Swedish and Danish as regards the deriving prototypical basic sentences containing such predicates, and analogies are made with predicate pairs such as give ~ receive. The main theoretical framework is a minimalist version of X-bar theory.

Transfer learning by mapping and revising boosted relational dependency networks

Statistical machine learning algorithms usually assume the availability of data of considerable size to train the models. However, they would fail in addressing domains where data is difficult or expensive to obtain. Transfer learning has emerged to address this problem of learning from scarce data by relying on a model learned in a source domain where data is easy to obtain to be a starting point for the target domain. On the other hand, real-world data contains objects and their relations, usually gathered from noisy environments. Finding patterns through such uncertain relational data has been the focus of the Statistical Relational Learning (SRL) area. Thus, to address domains with scarce, relational, and uncertain data, in this paper, we propose TreeBoostler, an algorithm that transfers the SRL state-of-the-art Boosted Relational Dependency Networks learned in a source domain to the target domain. TreeBoostler first finds a mapping between pairs of predicates to accommodate the additive trees into the target vocabulary. After, it employs two theory revision operators devised to handle incorrect relational regression trees aiming at improving the performance of the mapped trees. In the experiments presented in this paper, TreeBoostler has successfully transferred knowledge between several distinct domains. Moreover, it performs comparably or better than learning from scratch methods in terms of accuracy and outperforms a transfer learning approach in terms of accuracy and runtime.

In Defense of Conciliar Christology by Timothy Pawl

Reviewed by: In Defense of Conciliar Christology by Timothy Pawl Christopher Tomaszewski In Defense of Conciliar Christology by Timothy Pawl ( Oxford: Oxford University Press, 2016), xiv + 251 pp. In this delightfully well-researched book, Timothy Pawl aims to defend the logical consistency of "Conciliar Christology" from the allegations of inconsistency which have been made against it, mostly in the context of contemporary analytic philosophy of religion. By "Conciliar Christology," Pawl means the conjunction of all Christological propositions solemnly taught by the first seven Ecumenical Councils of the Christian Church, which Catholics, the Orthodox, and many Protestants accept as authoritative Tradition. Pawl aims not to show that this conciliar Christology is true, or even possibly true (2), but only to defeat arguments which attempt to show some contradiction in conciliar Christology. The organization of the book is straightforward: after examining the content of conciliar Christology (ch. 1), the definitions of key terms used therein (ch. 2), and fleshing out the integrated Christological theory in a broadly hylemorphic fashion (ch. 3), Pawl examines "The Fundamental Problem" for conciliar Christology (ch. 4), and examines three ways of avoiding this allegation of fundamental contradiction (chs. 5–7), before concluding with an examination of additional metaphysical objections which aim to show that conciliar Christology is inconsistent with divine immutability, impassibility, or atemporality (ch. 8), or that conciliar Christology is committed to just one nature, intellect, or will in Christ (ch. 9). Pawl's book has many merits to recommend it, perhaps the most important and praiseworthy of which is his slavish commitment to the conciliar texts which constitute conciliar Christology. As Pawl himself notes, it is an unfortunate and far too common occurrence in contemporary analytic philosophy of religion to "discover articles wherein a view condemned as outside the fold in days of yore is propounded as a novel answer to a theological problem, with apparent ignorance on the author's part that the view has such an ignoble history, or any history at all" (3). This phenomenon has the unhappy consequence that a significant fraction of the work being produced in contemporary analytic philosophy of religion is dead on arrival amongst Christians who are well acquainted with the history of the Church and take seriously the Tradition contained therein. Pawl's book is a refreshing and outstanding exception to this lack of engagement with the doctrinal history of the Church: he has appeals to the conciliar texts and careful interpretation of them sprinkled generously throughout the entire book, and certainly seems to take them to constitute the Christology that must survive scrutiny, thereby setting himself a significantly harder task than those less devoted to these doctrinal authorities, while also positioning [End Page 727] his book to be more useful to Christian philosophers who take these Councils as a definitively authoritative rule of faith. On the other hand, Pawl also demonstrates an excellent facility with the logical analysis which is the hallmark of contemporary analytic philosophy. At places, his book is full of page after page of careful deduction and explanation of the arguments against conciliar Christology which he is attempting to refute. One never wonders exactly which premise Pawl is denying or which inference he thinks is fallacious. For philosophers familiar with the most common forms of argument, this will likely border on the tedious. But it will be very advantageous to the lay reader or the theologian without a background in logic. I am a believer in conciliar Christology, and therefore in its consistency, but I do have some worries about Pawl's solution to "The Fundamental Problem." It would take too long to set up this problem here in the same way or with the same precision as Pawl does in the book, but basically, the claim is that that the predicates which are true of Christ in virtue of his divine nature are inconsistent with the predicates which are true of Christ in virtue of his human nature. But conciliar Christology asserts that many pairs of such predicates (e.g., "passible" and "impassible" or "mutable" and "immutable") are indeed all true of one and the same supposit, the eternal Word. Therefore, conciliar Christology posits contradictions, and is false. This is...

Towards a characterization of apparent contradictions in the biomedical literature using context analysis.

With the substantial growth in the biomedical research literature, a larger number of claims are published daily, some of which seemingly disagree with or contradict prior claims on the same topics. Resolving such contradictions is critical to advancing our understanding of human disease and developing effective treatments. Automated text analysis techniques can facilitate such analysis by extracting claims from the literature, flagging those that are potentially contradictory, and identifying any study characteristics that may explain such contradictions. Using SemMedDB, our own PubMed-scale repository of semantic predications (subject-relation-object triples), we identified apparent contradictions in the biomedical research literature and developed a categorization of contextual characteristics that explain such contradictions. Clinically relevant semantic predications relating to 20 diseases and involving opposing predicate pairs (e.g., an intervention treats or causes a disease) were retrieved from SemMedDB. After addressing inference, uncertainty, generic concepts, and NLP errors through automatic and manual filtering steps, a set of apparent contradictions were identified and characterized. We retrieved 117,676 predication instances from 62,360 PubMed abstracts (Jan 1980-Dec 2016). From these instances, automatic filtering steps generated 2236 candidate contradictory pairs. Through manual analysis, we determined that 58 of these pairs (2.6%) were apparent contradictions. We identified five main categories of contextual characteristics that explain these contradictions: (a) internal to the patient, (b) external to the patient, (c) endogenous/exogenous, (d) known controversy, and (e) contradictions in literature. Categories (a) and (b) were subcategorized further (e.g., species, dosage) and accounted for the bulk of the contradictory information. Semantic predications, by accounting for lexical variability, and SemMedDB, owing to its literature scale, can support identification and elucidation of potentially contradictory claims across the biomedical domain. Further filtering and classification steps are needed to distinguish among them the true contradictory claims. The ability to detect contradictions automatically can facilitate important biomedical knowledge management tasks, such as tracking and verifying scientific claims, summarizing research on a given topic, identifying knowledge gaps, and assessing evidence for systematic reviews, with potential benefits to the scientific community. Future work will focus on automating these steps for fully automatic recognition of contradictions from the biomedical research literature.

Christological Consistency and the Reduplicative Qua

A central problem faced by any classical form of Christology runs as follows. Christ is both divine and human, but it seems that there are pairs of predicates that meet the following conditions: the two predicates in the pair cannot both belong to one subject; everything that is divine has one of the predicates; everything that is human has the other of the predicates. So, for example, nothing can be both changeable and unchangeable; everything divine is unchangeable; everything human is changeable. If, as classical Christology asserts, Christ is both divine and

Maximum predicate descriptions of sets of mappings

The work is carried out in the framework of the algebraic approach and is devoted to the problem of describing sets of mappings by pairs of m-place predicates. Maximum descriptions are distinguished in the set of all predicate descriptions, and necessary and sufficient maximality conditions are obtained. Using a partial order and betweenness relations as examples, it is shown that, for a given predicate on the set of values, the necessary maximality conditions imply some properties of this predicate on its domain. Taking this fact into account, a set of axioms for the betweenness relation is proposed, and examples of such relations are considered.

From Predicates to Programs: The Semantics of a Method Language

This paper explains how a declarative method language, based upon the formal notations of Z and B, can be used as a basis for automatic code generation. The language is used to describe the intended effect of operations, or methods, upon the components of an object model; each method is defined by a pair of predicates: a precondition, and a post-condition. Following the automatic incorporation of model invariants, including those arising from class associations, these predicates are extended—again, automatically—to address issues of consistency, definition, and dependency, before being translated into imperative programs. The result is a formal method for transforming object models into complete, working systems.

About the Admissible Predicates on Admissible Sets

We study the admissible predicates, i.e., the predicates having the property that their addition to the signature of an admissible set preserves the property “to be an admissible set.” We show that the family of these predicates is much wider than the family of Δ-predicates. We also construct a family of admissible predicates of cardinality 2ω such that the addition of an arbitrary pair of predicates of this family to the signature of an admissible set violates the admissibility of the latter as well as other examples of families of admissible predicates.

On antonym and negate in fuzzy logic

The abilities to speak well and to conceptualize seem to be closely linked. It has been maintained that the human brain has a preference for binary oppositions or polarities. The notions of antonym and negate are examples of polarity between the pairs of predicates P−no P, P−ant P. Other characteristics as mutual exclusivity, complementation, or reciprocity are applied, in some cases, to them. However, if negation is a general phenomenon in natural languages, the use of antonyms is more usual for graduate predicates. For this reason, antonyms were considered very early in fuzzy set theory.1–4 In this work, some relations between antonyms and negates are analyzed in the frame of fuzzy set theory, showing both similarities and dissimilarities between these two concepts. The last goal is to get automatic methods to build concepts with an adequate and easy interpretation. This paper is an experimental-theoretic intent on the way of establishing a mathematical model of antonymy in agreement both with some linguistic facts and with some uses in fuzzy control. ©1999 John Wiley & Sons, Inc.

Defining ``good'' and ``bad'' in terms of ``better''.

Monadic predicates for «good» and «bad» are inserted into structures already containing the dyadic predicate «better». A set of logical properties for «good» and «bad» is proposed, and a complete characterization is given for the pairs of monadic predicates that have these properties. It is argued that «good» and «bad» can indeed be defined in terms of «better», and a definition is given that is more generally applicable than those previously proposed

Effects of relation strength and semantic overlap on retrieval and comparison processes during sentence verification

Three experiments were performed to distinguish two theoretical accounts of relatedness effects in the sentence verification task. There were three important results: First, subjects were generally faster to make both positive and negative responses when the subject and predicate words of the “sentences” were strongly related than when they were weakly related. This was the case as long as the words in the subject—predicate pairs were meaningfully related and presented in a meaningful context. Second, subjects were faster to respond to unrelated false items than to related false items. Finally, relatedness effects for meaningfully related items were reduced when the items were presented in a context of unrelated items; the relatedness effect on negative RT in one condition was actually reversed when unrelated items were added to the stimuli. The results suggest an integration of the findings of many previous investigations: Two kinds of relatedness manipulations must be distinguished in previous studies employing the sentence verification task. Studies involving a comparison of unrelated items with meaningfully related false items have found results consistent with a feature comparison processing strategy (e.g., E. E. Smith, E. J. Shoben, & L. J. Rips, Psychological Review , 1974, 81 , 214–241 ); studies comparing only meaningfully related items differing in relatedness have produced results consistent with retrieval models ( A. M. Collins & M. R. Quillian, Journal of Verbal Learning and Verbal Behavior , 1969, 8 , 240–247 ). It is proposed that subjects base their responses on the retrieval of different types of information in these two situations.

A Multi-paradigm Approach To Formal Program Derivation

Overview: we outline and illustrate a logically defensible framework for the construction of correct procedural programs from unbiased specifications. These (so-called model-based) specifications consist of pairs of predicates that describe the acceptability of input values, and the relationship between such an input and associated output values. As intermediate results of the construction process, we obtain skeletal designs for programs in various paradigms other than sequential procedural programs. The basic strategy is shown in the following diagram:

On Dying

The first solid bit of argumentation you get in Plato's Phaedo goes something like this: Whatever comes to be, comes to be from its opposite (cf. 70e, sqq.). If at a certain time t a given thing a begins to be F, before that time t it must have been non-F. Wherever a pair of predicates, F and G, are genuine contradictories; where, that is, they stand to each other in the same relation as F stands in to non-F; it is necessarily true that if a began to be F at t before then a was G. The only trouble comes from the difficulty of finding substitutes for F and G that people will allow to be genuine contradictories. It the butter began to be soft at four o'clock, we may suggest, before four it was hard. A tiresome opponent will retort that there is a state in which butter cannot properly be called either hard or soft. We try again: If Ann began to be asleep at eight, before eight she was awake; if my shirt became dirty on Tuesday, before Tuesday it was clean; if Bonzo died last week, before last week he was alive. And when the advocate of the borderline state reminds us of the various twilight areas of consciousness or cleanliness, we are reduced to legislation: “asleep” shall henceforth apply to every mental state short of complete wakefulness, “alive” to every condition of the body before the onset of putrefaction, “clean” to every shirt incapable of producing a certain measurable discoloration in the water in which it is washed. “Let F and G be contradictories”, we still guardedly maintain: “then if a comes to be F at time t, before time t a was G”.