Results 41 to 50 of about 19,730 (191)

Finding Minimum‐Cost Explanations for Predictions Made by Tree Ensembles

Software: Practice and Experience, EarlyView.
ABSTRACT The ability to reliably explain why a machine learning model arrives at a particular prediction is crucial when used as decision support by human operators of critical systems. The provided explanations must be provably correct, and preferably without redundant information, called minimal explanations.
John Törnblom, Emil Karlsson, Simin Nadjm‐Tehrani   +2 more
wiley   +1 more source

Hennessy-Milner Theorems via Galois Connections

, 2022
We introduce a general and compositional, yet simple, framework that allows us to derive soundness and expressiveness results for modal logics characterizing behavioural equivalences or metrics (also known as Hennessy-Milner theorems). It is based on Galois connections between sets of (real-valued) predicates on the one hand and equivalence relations ...
Beohar, H., Gurke, S., König, B., Messing, K.   +3 more
openaire   +5 more sources

A Vulnerability Lens for Intuitive‐Logic Scenarios

FUTURES &FORESIGHT SCIENCE, Volume 8, Issue 1, April 2026.
ABSTRACT Exploration of possibilities by means of intuitive logic is hampered by a large number of scenarios, which easily exceed the limits imposed by human bounded rationality. While many practitioners constrain their scenarios within a 2 × 2 $2\times 2$ matrix by design, more structured approaches point to rationales such as eliminating ...
Guido Fioretti
wiley   +1 more source

A comprehensive survey on formal concept analysis, its research trends and applications

International Journal of Applied Mathematics and Computer Science, 2016
In recent years, FCA has received significant attention from research communities of various fields. Further, the theory of FCA is being extended into different frontiers and augmented with other knowledge representation frameworks.
Singh Prem Kumar, Aswani Kumar Cherukuri, Gani Abdullah   +2 more
doaj   +1 more source

Traces of Hecke operators on Drinfeld modular forms for GL2(Fq[T])$\operatorname{GL}_2(\mathbb {F}_q[T])$

Mathematika, Volume 72, Issue 2, April 2026.
Abstract In this paper, we study traces of Hecke operators on Drinfeld modular forms of level 1 in the case A=Fq[T]$A = \mathbb {F}_q[T]$. We deduce closed‐form expressions for traces of Hecke operators corresponding to primes of degree at most 2 and provide algorithms for primes of higher degree.
Sjoerd de Vries
wiley   +1 more source

Ordinary primes for GL2$\operatorname{GL}_2$‐type abelian varieties and weight 2 modular forms

Mathematika, Volume 72, Issue 2, April 2026.
Abstract Let A$A$ be a g$g$‐dimensional abelian variety defined over a number field F$F$. It is conjectured that the set of ordinary primes of A$A$ over F$F$ has positive density, and this is known to be true when g=1,2$g=1, 2$, or for certain abelian varieties with extra endomorphisms.
Tian Wang, Pengcheng Zhang
wiley   +1 more source

Attribute Implication Bases From Galois Connection Structures

Mathematical Methods in the Applied Sciences, Volume 49, Issue 4, Page 2729-2753, 15 March 2026.
ABSTRACT Modeling knowledge systems by determining relationships among key variables have been and currently is a fundamental and nontrivial challenge in real‐world scenarios. Many approaches have been developed to reach this goal, but many of them are heuristic and require of alternative procedures to provide robust and tractable rules.
M. Eugenia Cornejo, Jesús Medina, Francisco José Ocaña   +2 more
wiley   +1 more source

Intuitionistic logic with a Galois connection has the finite model property

, 2011
We show that the intuitionistic propositional logic with a Galois connection (IntGC), introduced by the authors, has the finite model property.Comment: 6 ...
Dzik, Wojciech, Järvinen, Jouni, Kondo, Michiro   +2 more
core   +1 more source

Logics from Galois connections

International Journal of Approximate Reasoning, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Järvinen, Jouni, Kondo, Michiro, Kortelainen, Jari   +2 more
openaire   +2 more sources

Network Security Empowered Digital Teaching Data Protection Algorithm for Ceramic Technology

Engineering Reports, Volume 8, Issue 3, March 2026.
In this paper, a complete algorithm system covering sensitivity identification, feature fusion, encrypted transmission and cultural image protection is established based on the ceramic teaching scene enabled by network security. ABSTRACT The digitalization of ceramic technology teaching generates sensitive multi‐modal data, including personal ...
Yuting Zhu, Qianyun Xu, limin Fan, Lin Qian   +3 more
wiley   +1 more source