Results 51 to 60 of about 24,570,426 (223)

A Semi-Automatic Semantic Consistency-Checking Method for Learning Ontology from Relational Database

Information, 2021
To tackle the issues of semantic collision and inconsistencies between ontologies and the original data model while learning ontology from relational database (RDB), a semi-automatic semantic consistency checking method based on graph intermediate ...
Chuangtao Ma, Bálint Molnár, András Benczúr   +2 more
doaj   +1 more source

Quantitative model checking of linear-time properties based on generalized possibility measures [PDF]

Fuzzy Sets Syst., 2016
Model checking of linear-time properties based on possibility measures was studied in previous work (Li and Li (2013)). However, the linear-time properties considered in the previous work was qualitative and was based on Boolean logic, the linear-time ...
Yongming Li
semanticscholar   +1 more source

Community as Catalyst for Change: Factors Contributing to US Catholic Sisters Engaging in Environmental Activism

Journal for the Scientific Study of Religion, EarlyView.
ABSTRACT Much of the activism on environmental issues within the US Catholic Church is not coming from those with institutional power (like bishops and diocesan priests), but rather from sisters, who have no formal power. What factors facilitate sisters’ environmental activism?
Sabrina Danielsen, Ellie Simmons
wiley   +1 more source

Ancestral Kripke models and nonhereditary Kripke models for the Heyting propositional calculus.

Notre Dame Journal of Formal Logic, 1991
As a sequel to the author's previous work on generalization of Kripke models for intuitionistic propositional logic, ancestral Kripke models are introduced by replacing converse-heredity of rudimentary Kripke models with ancestrality. With some embedding results to the modal logic S4, the author provides another type of modelling as well, where ...
openaire   +2 more sources

Computable Kripke Models and Intermediate Logics

Information and Computation, 1998
In the paper under review the authors investigate effectiveness of Kripke models for first-order theories of intermediate logics, i.e. those that lie between intuitionistic and classical predicate logic. Completeness (by Kripke) results for intermediate logics such as intuitionistic logic, classical logic, constant domain logic, directed frames logic ...
Hajime Ishihara, Bakhadyr Khoussainov, Anil Nerode   +2 more
openaire   +1 more source

Friendly Fire: Did Margaret Macdonald Contribute to Susan Stebbing's Exclusion from the History of Analytic Philosophy?

Metaphilosophy, EarlyView.
Abstract This paper presents the case of Margaret Macdonald's (1903–1956) posthumous treatment of Susan Stebbing (1885–1943). After Stebbing's death, Macdonald—her Ph.D. student and collaborator—wrote an early history of analytic philosophy in which Stebbing's work is credited to Bertrand Russell (specifically, her account of ‘directional analysis ...
Peter West
wiley   +1 more source

A symbolic shortest path algorithm for computing subgame-perfect Nash equilibria

International Journal of Applied Mathematics and Computer Science, 2015
Consider games where players wish to minimize the cost to reach some state. A subgame-perfect Nash equilibrium can be regarded as a collection of optimal paths on such games.
Góngora Pedro A., Rosenblueth David A.
doaj   +1 more source

Embedding mental files in the world

Mind &Language, EarlyView.
Cognitive scientific explanations can take either a mechanistic or design perspective. Some recent philosophical works propose to apply the mechanistic perspective to the influential mental file framework. The design perspective, however, remains underexplored.
Zhengxi Jin
wiley   +1 more source

Categories for Dynamic Epistemic Logic [PDF]

Electronic Proceedings in Theoretical Computer Science, 2017
The primary goal of this paper is to recast the semantics of modal logic, and dynamic epistemic logic (DEL) in particular, in category-theoretic terms. We first review the category of relations and categories of Kripke frames, with particular emphasis ...
Kohei Kishida
doaj   +1 more source

Globally Admissible Inference Rules

Известия Иркутского государственного университета: Серия "Математика", 2022
Setting the basic rules of inference is fundamental to logic. The most general variant of possible inference rules are admissible inference rules: in logic 𝐿, a rule of inference is admissible if the set of theorems 𝐿 is closed with respect to this rule.
V.V. Rimatskiy
doaj   +1 more source