English
Related papers

Related papers: Comparative concept similarity over Minspaces: Axi…

200 papers

This paper addresses fundamental issues on the nature of the concepts and structures of fuzzy logic, focusing, in particular, on the conceptual and functional differences that exist between probabilistic and possibilistic approaches. A…

Artificial Intelligence · Computer Science 2013-04-05 Enrique H. Ruspini

The preferential conditional logic PCL, introduced by Burgess, and its extensions are studied. First, a natural semantics based on neighbourhood models, which generalise Lewis' sphere models for counterfactual logics, is proposed. Soundness…

Logic in Computer Science · Computer Science 2020-02-17 Marianna Girlando , Sara Negri , Nicola Olivetti

Substructural logics naturally support a quantitative interpretation of formulas, as they are seen as consumable resources. Distances are the quantitative counterpart of equivalence relations: they measure how much two objects are similar,…

Logic in Computer Science · Computer Science 2025-02-05 Francesco Dagnino , Fabio Pasquali

Concurrent separation logic (CSL) is a specification logic for concurrent imperative programs with shared memory and locks. In this paper, we develop a concurrent and interactive account of the logic inspired by asynchronous game semantics.…

Programming Languages · Computer Science 2018-07-24 Paul-André Melliès , Léo Stefanesco

Word similarity has many applications to social science and cultural analytics tasks like measuring meaning change over time and making sense of contested terms. Yet traditional similarity methods based on cosine similarity between word…

Computation and Language · Computer Science 2025-02-11 Kaitlyn Zhou , Haishan Gao , Sarah Chen , Dan Edelstein , Dan Jurafsky , Chen Shani

Both algebraic and computational approaches for dealing with similarity spaces are well known in generalized rough set theory. However, these studies may be said to have been confined to particular perspectives of distinguishability in the…

Logic · Mathematics 2009-05-14 A. Mani

Gopal Prasad and A. S. Rapinchuk defined a notion of weakly commensurable lattices in a semisimple group, and gave a classification of weakly commensurable Zariski dense subgroups. A motivation was to classify pairs of locally symmetric…

Number Theory · Mathematics 2012-12-07 Chandrasheel Bhagwat , Supriya Pisolkar , C. S. Rajan

A totally semantic measure is presented which is able to calculate a similarity value between concept descriptions and also between concept description and individual or between individuals expressed in an expressive description logic. It…

Artificial Intelligence · Computer Science 2009-11-30 Claudia d'Amato , Nicola Fanizzi , Floriana Esposito

Comparative reasoning plays a crucial role in text preference prediction; however, large language models (LLMs) often demonstrate inconsistencies in their reasoning. While approaches like Chain-of-Thought improve accuracy in many other…

Qualitative Choice Logic (QCL) and Conjunctive Choice Logic (CCL) are formalisms for preference handling, with especially QCL being well established in the field of AI. So far, analyses of these logics need to be done on a case-by-case…

Logic in Computer Science · Computer Science 2021-06-10 Michael Bernreiter , Jan Maly , Stefan Woltran

Abstract. Matching logic cannot handle concurrency. We introduce concurrent matching logic (CML) to reason about fault-free partial correctness of shared-memory concurrent programs. We also present a soundness proof for concurrent matching…

Logic in Computer Science · Computer Science 2021-09-02 Shangbei Wang

We study comparisons between interpretations in description logics with respect to "logical consequences" of the form of semi-positive concepts (like semi-positive concept assertions). Such comparisons are characterized by conditions…

Logic in Computer Science · Computer Science 2013-04-23 Ali Rezaei Divroodi , Linh Anh Nguyen

We show that the proof-theoretic notion of logical preorder coincides with the process-theoretic notion of contextual preorder for a CCS-like calculus obtained from the formula-as-process interpretation of a fragment of linear logic. The…

Logic in Computer Science · Computer Science 2019-02-20 Yuxin Deng , Iliano Cervesato , Robert J. Simmons

Similarity is a comparative-subjective measure that varies with the domain within which it is considered. In several NLP applications such as document classification, pattern recognition, chatbot question-answering, sentiment analysis,…

Machine Learning · Computer Science 2021-11-11 Manuela Nayantara Jeyaraj , Dharshana Kasthurirathna

An interesting line of research in natural language processing (NLP) aims to incorporate linguistic typology to bridge linguistic diversity and assist the research of low-resource languages. While most works construct linguistic similarity…

Computation and Language · Computer Science 2023-05-24 Haotian Ye , Yihong Liu , Hinrich Schütze

The topological interpretation of modal logics provides descriptive languages and proof systems for reasoning about points of topological spaces. Recent work has been devoted to model checking of spatial logics on discrete spatial…

Logic in Computer Science · Computer Science 2020-05-13 Vincenzo Ciancia , Diego Latella , Mieke Massink , Erik de Vink

Continuous Markovian Logic (CML) is a multimodal logic that expresses quantitative and qualitative properties of continuous-time labelled Markov processes with arbitrary (analytic) state-spaces, henceforth called continuous Markov processes…

Logic in Computer Science · Computer Science 2015-07-01 Radu Mardare , Luca Cardelli , Kim G. Larsen

In this paper we study strong and weak bisimulation equivalences for continuous-time Markov decision processes (CTMDPs) and the logical characterizations of these relations with respect to the continuous-time stochastic logic (CSL). For…

Logic in Computer Science · Computer Science 2013-11-19 Lei Song , Lijun Zhang , Jens Chr. Godskesen

In this paper, we show that theory of processes can be reduced to the theory of spatial logic. Firstly, we propose a spatial logic SL for higher order pi-calculus, and give an inference system of SL. The soundness and incompleteness of SL…

Logic in Computer Science · Computer Science 2012-11-20 Zining Cao

Closure spaces are a generalisation of topological spaces obtained by removing the idempotence requirement on the closure operator. We adapt the standard notion of bisimilarity for topological models, namely Topo-bisimilarity, to closure…

Logic in Computer Science · Computer Science 2021-05-17 Vincenzo Ciancia , Diego Latella , Mieke Massink Erik de Vink
‹ Prev 1 2 3 10 Next ›