Logic and Sense

In the paper, original formal-logical conception of syntactic and semantic： intensional and extensional senses of expressions of any language L is outlined. Syntax and bi-level intensional and extensional semantics of language L are characterized categorically： in the spirit of some Husserl＇s ideas of pure grammar, Le^niewski-Ajukiewicz＇s theory syntactic/semantic categories and in accordance with Frege＇s ontological canons, Bochefiski＇s famous motto--syntax mirrors ontology and some ideas of Suszko： language should be a linguistic scheme of ontological reality and simultaneously a tool of its cognition. In the logical conception of language L, its expressions should satisfy some general conditions of language adequacy. The adequacy ensures their unambiguous syntactic and semantic senses and mutual, syntactic, and semantic compatibility, correspondence guaranteed by the acceptance of a postulate of categorial compatibility syntactic and semantic （extensional and intensional） categories of expressions of L. From this postulate, three principles of compositionality follow： one syntactic and two semantic already known to Frege. They are treated as conditions of homomorphism partial algebra of L into algebraic models of L： syntactic, intensional, and extensional. In the paper, they are applied to some expressions with quantifiers. Language adequacy connected with the logical senses described in the logical conception of language L is, of course, an idealization, but only expressions with high degrees of precision of their senses, after due justification, may become theorems of science.

VARIABLE-DRIVEN AND-PARALLELISM

A Variable-driven model of AND-parallelism of logic programs isprcscntcd.It statically analyses the values of variables in clauses and picks out the varia.blcs contributing to the parallel execution and then generates the variable-driving graphsfor clauses.According to the variable-driving graph and the analysis of the instantiationsof variables at run,literals are driven to execute.With binding conflicts of shared variablesprevented,the variable-driven model fully develops the AND-parallelism.Based on thevariable-driving graph,somc models of AND-parallelism already put forward can beavailable if cquipcd with appropriate driving algorithms.

A Structured Temporal Logic Language:XYZ/SE

In order to enhance the readability and to simplify the verification of temporal logic programs in the XYZ system,we propose a structured temporal logic language called XYZ/SE,based on XYZ/BE which is the basis language of the XYZ system.A set of proof rules are given and proved to be sound and adequate for proving the partial correctness of XYZ/SE programs in a compositional way.Moreover,we show that every XYZ/BE program can be transformed into an equivalent XYZ/SE program.So we have developed a general compositional verification method in the XYZ system concerning the sequential case.

On the Expressive Power of F-Logic Language

F-logic language is a logic database language based on frame logic. It is powerful in expressing object-oriented features. However, there was littIe work discussing its capability of manipulating complex objects. In this paper, the authors compare the capability of F-logic with that of logic database languages represented by COL. Through two pairs of semantic-preserving transformations, F-logic programs and their Herbrand interpretations can be transformed into COL programs and their corresponding Herbrand interpretations, and vice versa. Also, the effects of negation are discussed. The results of this paper indicate that, without consideration of the effects of OID generating, F-logic language has the same power in manipulating complex objects as COL, LDL1,and ELPS.

Investigating the Logical Capability of Graph Neural Networks via the Connection to C_(2)

Graph neural networks(GNNs)have garnered substantial application across a spectrum of real-world scenarios due to their remarkable ability to handle data organized in the form of graphs.Nonetheless,the full extent of GNNs'computational properties and logical capability remains a subject of ongoing investigation.This study undertakes an exploration of the logical capabilities intrinsic to GNNs,approaching the matter from a theoretical standpoint.In this pursuit,a pivotal connection is established between GNNs and a specific fragment of first-order logic known as C_(2),which serves as a logical framework for modeling graph data.Recent research further amplifies this discourse,introducing a subcategory of GNNs named ACR-GNN,illustrating that GNNs are capable of emulating the evaluation process of unary C,formulas.Expanding on these insights,we introduce an innovative version of GNN architectures capable of dealing with general C,formulas.To attain this,we employ a mechanism known as message passing for GNN reconstruction.The proposed GNN adaptations allow for simultaneous updating of node and node pair features,thereby enabling the management of both unary and binary C,formulas.We prove that the proposed models exhibit the equivalent expressiveness to C_(2).This underpins the profound alignment between the logical capability of GNNs and the inherent nature of the logical language C,.We conduct several experiments on both of synthetic and real-world datasets to support our claims.Through the experiments,we verify that our suggested models outperform both ACR-GNN and a commonly used model,GIN,when it comes to evaluating C,formulas.

Computational Mechanisms for Metaphor in Languages： A Survey

Metaphor computation has attracted more and more attention because metaphor, to some extent, is the focus of mind and language mechanism. However, it encounters problems not only due to the rich expressive power of natural language but also due to cognitive nature of human being. Therefore machine-understanding of metaphor is now becoming a bottle-neck in natural language processing and machine translation. This paper first suggests how a metaphor is understood and then presents a survey of current computational approaches, in terms of their linguistic historical roots, underlying foundations, methods and techniques currently used, advantages, limitations, and future trends. A comparison between metaphors in English and Chinese languages is also introduced because compared with development in English language Chinese metaphor computation is just at its starting stage. So a separate summarization of current progress made in Chinese metaphor computation is presented. As a conclusion, a few suggestions are proposed for further research on metaphor computation especially on Chinese metaphor computation.