English
Related papers

Related papers: Formal Concept Analysis and Resolution in Algebrai…

200 papers

This extended abstract gives a brief outline of the connections between the descriptions and variable concepts. Thus, the notion of a concept is extended to include both the syntax and semantics features. The evaluation map in use is…

Logic in Computer Science · Computer Science 2007-05-23 Viacheslav Wolfengagen

Reasoning about exceptions in ontologies is nowadays one of the challenges the description logics community is facing. The paper describes a preferential approach for dealing with exceptions in Description Logics, based on the rational…

Artificial Intelligence · Computer Science 2018-07-10 Laura Giordano , Valentina Gliozzi

Fusions are a simple way of combining logics. For normal modal logics, fusions have been investigated in detail. In particular, it is known that, under certain conditions, decidability transfers from the component logics to their fusion.…

Artificial Intelligence · Computer Science 2011-06-10 F. Baader , C. Lutz , H. Sturm , F. Wolter

Many semantical aspects of programming languages, such as their operational semantics and their type assignment calculi, are specified by describing appropriate proof systems. Recent research has identified two proof-theoretic features that…

Logic in Computer Science · Computer Science 2008-04-14 Andrew Gacek , Dale Miller , Gopalan Nadathur

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

Formal Concept Analysis starts from a very basic data structure comprising objects and their attributes. Sometimes, however, it is beneficial to also define attributes of attributes, viz., meta-attributes. In this paper, we use Triadic…

Logic · Mathematics 2024-08-12 Yingjian Wang

This paper unites two problem-solving traditions in computer science: (1) constraint-based reasoning, and (2) formal concept analysis. For basic definitions and properties of networks of constraints, we follow the foundational approach of…

Logic in Computer Science · Computer Science 2018-10-19 Robert E. Kent , John Brady

This paper outlines a general formal framework for reasoning systems, intended to support future analysis of inference architectures across domains. We model reasoning systems as structured tuples comprising phenomena, explanation space,…

Artificial Intelligence · Computer Science 2025-08-05 Saleh Nikooroo , Thomas Engel

We propose a formal treatment of scenarios in the context of a dialectical argumentation formalism for qualitative reasoning about uncertain propositions. Our formalism extends prior work in which arguments for and against uncertain…

Artificial Intelligence · Computer Science 2013-01-07 Peter McBurney , Simon Parsons

We propose a new formalism for specifying and reasoning about problems that involve heterogeneous "pieces of information" -- large collections of data, decision procedures of any kind and complexity and connections between them. The essence…

Logic in Computer Science · Computer Science 2016-12-30 Eugenia Ternovska

Concept discovery is one of the open problems in the interpretability literature that is important for bridging the gap between non-deep learning experts and model end-users. Among current formulations, concepts defines them by as a…

Machine Learning · Computer Science 2022-02-11 Adrianna Janik , Kris Sankaran

Definite descriptions are expressions of the form "the unique $x$ satisfying property $C$," which allow reference to objects through their distinguishing characteristics. They play a crucial role in ontology and query languages, offering an…

Logic in Computer Science · Computer Science 2025-12-09 Michał Sochański , Przemysław Andrzej Wałęga , Michał Zawidzki

We introduce a two-sort weighted modal logic for possibilistic reasoning with fuzzy formal contexts. The syntax of the logic includes two types of weighted modal operators corresponding to classical necessity ($\Box$) and sufficiency…

Logic in Computer Science · Computer Science 2026-01-01 Prosenjit Howlader , Churn-Jung Liau

The idea that discourse relations are construed through explicit content and shared, or implicit, knowledge between producer and interpreter is ubiquitous in discourse research and linguistics. However, the actual contribution of the…

Computation and Language · Computer Science 2022-08-10 A. Reig-Alamillo , D. Torres-Moreno , E. Morales-González , M. Toledo-Acosta , A. Taroni , J. Hermosillo-Valadez

The goal of this paper is to extend classical logic with a generalized notion of inductive definition supporting positive and negative induction, to investigate the properties of this logic, its relationships to other logics in the area of…

Logic in Computer Science · Computer Science 2009-09-25 Marc Denecker

Compact closed categories provide a foundational formalism for a variety of important domains, including quantum computation. These categories have a natural visualisation as a form of graphs. We present a formalism for equational reasoning…

Symbolic Computation · Computer Science 2009-02-04 Lucas Dixon , Ross Duncan

Formal Concept Analysis (FCA) provides a method called attribute exploration which helps a domain expert discover structural dependencies in knowledge domains that can be represented by a formal context (a cross table of objects and…

Artificial Intelligence · Computer Science 2022-06-02 Maximilian Felde , Gerd Stumme

From daily discussions to marketing ads to political statements, information manipulation is rife. It is increasingly more important that we have the right set of tools to defend ourselves from manipulative rhetoric, or fallacies. Suitable…

Artificial Intelligence · Computer Science 2023-10-26 Ryuta Arisaka , Ryoma Nakai , Yusuke Kawamoto , Takayuki Ito

This study intends to systematically disentangle pure logic reasoning and text understanding by investigating the contrast across abstract and contextualized logical problems from a comprehensive set of domains. We explore whether LLMs…

Computation and Language · Computer Science 2024-06-06 Wenyue Hua , Kaijie Zhu , Lingyao Li , Lizhou Fan , Shuhang Lin , Mingyu Jin , Haochen Xue , Zelong Li , JinDong Wang , Yongfeng Zhang

In this paper the problems of deriving a taxonomy from a text and concept-oriented text segmentation are approached. Formal Concept Analysis (FCA) method is applied to solve both of these linguistic problems. The proposed segmentation…

Computation and Language · Computer Science 2010-10-13 Mihaiela Lupea , Doina Tatar , Zsuzsana Marian