Results 261 to 270 of about 147,987 (297)

Logical Relevance in Ontologies. [PDF]

, 2012
Most ontology development environments (ODEs) are term oriented and take a frame-based view of the information in an ontology about a given term. Even tools, such as Protégé 4, designed for axiom oriented development preserve the frame-based view as the central mode of interaction with the ontology.
Vescovo, C Del, Parsia, B, Sattler, U; id_orcid 0000-0003-4103-3389   +2 more
openaire   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

On semilattice relevant logics

Mathematical Logic Quarterly, 2003
AbstractThe semilattice relevant logics ∪R, ∪T, ∪RW, and ∪TW (slightly different from the orthodox relevant logics R, T, RW, and TW) are defined by semilattice models in which conjunction and disjunction are interpreted in a natural way. For each of them, there is a cut‐free labelled sequent calculus with plural succedents (like LK).
openaire   +1 more source

The Relevance of Relevance to Relevance Logic

2015
I explore the question of whether the concept of relevance is relevant to the study of what Anderson and Belnap call “relevance logic.” The answer should be “Of course!” But there are some twists and turns, as is shown by the fact that it has taken over 50 years to get here. Despite protests by R. K.
openaire   +1 more source

Semantics for relevant logics

Journal of Symbolic Logic, 1972
In what follows there is presented a unified semantic treatment of certain “paradox-free” systems of entailment, including Church's weak theory of implication (Church [7]) and logics akin to the systems E and R of Anderson and Belnap (Anderson [3], Belnap [6]).
openaire   +2 more sources

Relevant deontic logic

Journal of Philosophical Logic, 1992
Novel conditions of relevance are defined for conditionals in order to weed out some of the deontic paradoxes, such as Ross's paradox. Semantically, first-degree positive relevant entailment is defined in terms of fulfilment conditions, which are sets of sets of literals (atomic sentences or their negations).
openaire   +2 more sources

Relevant logic programming

Journal of Automated Reasoning, 1991
Several authors suggested extension of Horn clause programming using bottom-up proof search in Gentzen-type systems for intuitionistic logic with suitable restriction of the language. The author describes a similar program based on the relevance logic LR\(^ +\) without negation and distributivity axiom.
openaire   +2 more sources

RELEVANCE LOGIC AND THE CALCULUS OF RELATIONS

The Review of Symbolic Logic, 2010
Sound and complete semantics for classical propositional logic can be obtained by interpreting sentences as sets. Replacing sets with commuting dense binary relations produces an interpretation that turns out to be sound but not complete for R. Adding transitivity yields sound and complete semantics for RM, because all normal Sugihara matrices are ...
openaire   +1 more source

Gentzenizations of relevant logics with distribution

Journal of Symbolic Logic, 1996
We establish cut-free left-handed Gentzenizations for a range of major relevant logics from B through to R, all with distribution. B is the basic system of the Routley-Meyer semantics (see [15], pp. 287–300) and R is the logic of relevant implication (see [1], p. 341). Previously, the contractionless logics DW, TW, EW, RW and RWK were Gentzenized in [3]
openaire   +2 more sources

Relevant Variants of Intuitionistic Logic

Logic Journal of IGPL, 1994
It is well known that adding a propositional constant \(f\) to the system of relevant logic R, and defining \(\neg\alpha\) as \(\alpha\to f\), provides an intuitionist-like negation. [See, e.g., \textit{R. K. Meyer}, ``Intuitionism, entailment and negation'', in: Truth, Syntax and Modality, Stud. Logic Found. Math.
openaire   +1 more source

Syllogistic Relevance and Term Logic

Journal of Logic, Language and Information
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source