English
Related papers

Related papers: Epstein Semantics: Characterization, Interpolation…

200 papers

Description logics (DLs) are standard knowledge representation languages for modelling ontologies, i.e. knowledge about concepts and the relations between them. Unfortunately, DL ontologies are difficult to learn from data and…

Artificial Intelligence · Computer Science 2020-06-26 Yazmín Ibáñez-García , Víctor Gutiérrez-Basulto , Steven Schockaert

In this paper I introduce a generalized version of Richard Epstein's set-assignment semantics ([Epstein, 1990]). As a case study, I consider how this framework can be used to characterize William Parry's logic of analytic implication and…

Logic · Mathematics 2024-09-24 Nicolò Zamperlin

We give a syntactic characterization of abstract elementary classes (AECs) closed under intersections using a new logic with a quantifier for isomorphism types that we call structural logic: we prove that AECs with intersections correspond…

Logic · Mathematics 2019-05-10 Will Boney , Sebastien Vasey

Generalized structural equations models (GSEMs) [Peters and Halpern 2021], are, as the name suggests, a generalization of structural equations models (SEMs). They can deal with (among other things) infinitely many variables with infinite…

Artificial Intelligence · Computer Science 2021-12-22 Joseph Y. Halpern , Spencer Peters

The paper investigates an evidence-based semantics for epistemic logics. It is shown that the properties of knowledge obtained from a potentially infinite body of evidence are described by modal logic S5. At the same time, the properties of…

Logic in Computer Science · Computer Science 2021-06-23 Pavel Naumov , Jia Tao

We show that the vast majority of extensions of the description logic $\mathcal{EL}$ do not enjoy the Craig interpolation nor the projective Beth definability property. This is the case, for example, for $\mathcal{EL}$ with nominals,…

Logic in Computer Science · Computer Science 2022-05-31 Marie Fortin , Boris Konev , Frank Wolter

Generalizing a theorem of Campercholi, we characterize, in syntactic terms, the ranges of epimorphisms in an arbitrary class of similar first-order structures (as opposed to an elementary class). This allows us to strengthen a result of…

Logic · Mathematics 2020-05-26 T. Moraschini , J. G. Raftery , J. J. Wannenburg

This paper provides a model theoretic semantics to feature terms augmented with set descriptions. We provide constraints to specify HPSG style set descriptions, fixed cardinality set descriptions, set-membership constraints, restricted…

cmp-lg · Computer Science 2008-02-03 Suresh Manandhar

Ontologies formalise how the concepts from a given domain are interrelated. Despite their clear potential as a backbone for explainable AI, existing ontologies tend to be highly incomplete, which acts as a significant barrier to their more…

Artificial Intelligence · Computer Science 2021-05-12 Steven Schockaert , Yazmín Ibáñez-García , Víctor Gutiérrez-Basulto

Interpretability logics are endowed with relational semantics \`a la Kripke: Veltman semantics. For certain applications though, this semantics is not fine-grained enough. Back in 1992, in the research group of de Jongh, the notion of…

Logic · Mathematics 2020-07-10 Joost J. Joosten , Jan Mas Rovira , Luka Mikec , Mladen Vuković

In this paper, we introduce the simulations and bisimulations on polarity-based semantics for non-distributive modal logic, which are natural generalizations of those notions on Kripke semantics for modal logic. We also generalize other…

Logic · Mathematics 2024-04-09 Yiwen Ding , Krishna Manoorkar , Mattia Panettiere , Ruoding Wang

Modal description logics feature modalities that capture dependence of knowledge on parameters such as time, place, or the information state of agents. E.g., the logic S5-ALC combines the standard description logic ALC with an S5-modality…

Logic in Computer Science · Computer Science 2017-05-24 Paul Wild , Lutz Schröder

Semiconic idempotent logic sCI is a common generalization of intuitionistic logic, semilinear idempotent logic sLI, and in particular relevance logic with mingle. We establish the projective Beth definability property and the deductive…

Logic · Mathematics 2023-07-21 Wesley Fussner , Nick Galatos

There has been an increasing interest in topological semantics for epistemic logic, which has been shown to be useful for, e.g., modelling evidence, degrees of belief, and self-reference. We introduce a polytopological PDL capable of…

Logic in Computer Science · Computer Science 2026-02-17 Martín Diéguez , David Fernández-Duque

Over the past decade a considerable amount of research has been done to expand logic programming languages to handle incomplete information. One such language is the language of epistemic specifications. As is usual with logic programming…

Artificial Intelligence · Computer Science 2007-05-23 Richard Watson

We characterize those intersection-type theories which yield complete intersection-type assignment systems for lambda-calculi, with respect to the three canonical set-theoretical semantics for intersection-types: the inference semantics,…

Logic in Computer Science · Computer Science 2007-05-23 M. Dezani-Ciancaglini , F. Honsell , F. Alessi

The Epistemic Halpern-Shoham logic (EHS) is a temporal-epistemic logic that combines the interval operators of the Halpern-Shoham logic with epistemic modalities. The semantics of EHS is based on interpreted systems whose labelling function…

Logic in Computer Science · Computer Science 2015-09-03 Alessio Lomuscio , Jakub Michaliszyn

The terms 'semantics' and 'ontology' are increasingly appearing together with 'explanation', not only in the scientific literature, but also in organizational communication. However, all of these terms are also being significantly…

Artificial Intelligence · Computer Science 2023-04-24 Giancarlo Guizzardi , Nicola Guarino

Substantial efforts have been made in developing various Decision Modeling formalisms, both from industry and academia. A challenging problem is that of expressing decision knowledge in the context of incomplete knowledge. In such contexts,…

Artificial Intelligence · Computer Science 2023-12-19 Đorđe Marković , Simon Vandevelde , Linde Vanbesien , Joost Vennekens , Marc Denecker

We discuss the problems of incompleteness and inexpressibility. We introduce almost self-referential formulas, use them to extend set theory, and relate their expressive power to that of infinitary logic. We discuss the nature of proper…

Logic · Mathematics 2016-12-20 Dmytro Taranovsky
‹ Prev 1 2 3 10 Next ›